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,59552,2129,Algorithms,54.5%,1,false,Array;Hash Table;,true,true,54.54639225447034,15663496,28715922
2,"Add Two Numbers",add-two-numbers,false,Medium,32447,6506,Algorithms,44.9%,2,false,Linked List;Math;Recursion;,true,true,44.91639415591921,5285345,11767081
3,"Longest Substring Without Repeating Characters",longest-substring-without-repeating-characters,false,Medium,40916,1972,Algorithms,36.0%,3,false,Hash Table;String;Sliding Window;,true,true,35.96070485880579,6750897,18772986
4,"Median of Two Sorted Arrays",median-of-two-sorted-arrays,false,Hard,29273,3286,Algorithms,42.3%,4,false,Array;Binary Search;Divide and Conquer;,true,true,42.34809688371077,3066742,7241748
5,"Longest Palindromic Substring",longest-palindromic-substring,false,Medium,30119,1851,Algorithms,35.0%,5,false,Two Pointers;String;Dynamic Programming;,true,true,34.97067416684322,3525680,10081793
6,"Zigzag Conversion",zigzag-conversion,false,Medium,8119,15070,Algorithms,50.2%,6,false,String;,true,true,50.191899086582524,1584360,3156606
7,"Reverse Integer",reverse-integer,false,Medium,13658,13690,Algorithms,29.6%,7,false,Math;,true,true,29.58768663525872,3720867,12575727
8,"String to Integer (atoi)",string-to-integer-atoi,false,Medium,4980,14265,Algorithms,18.4%,8,false,String;,true,false,18.40759465747346,1794064,9746325
9,"Palindrome Number",palindrome-number,false,Easy,13413,2790,Algorithms,58.2%,9,false,Math;,true,true,58.20414435625405,5687355,9771396
10,"Regular Expression Matching",regular-expression-matching,false,Hard,12468,2237,Algorithms,28.7%,10,false,String;Dynamic Programming;Recursion;,true,false,28.729989800540643,1076299,3746266
11,"Container With Most Water",container-with-most-water,false,Medium,30257,1900,Algorithms,56.8%,11,false,Array;Two Pointers;Greedy;,true,true,56.75302170925155,3613444,6366969
12,"Integer to Roman",integer-to-roman,false,Medium,7519,5607,Algorithms,67.2%,12,false,Hash Table;Math;String;,true,true,67.22160600555155,1561765,2323309
13,"Roman to Integer",roman-to-integer,false,Easy,15160,1024,Algorithms,63.6%,13,false,Hash Table;Math;String;,true,true,63.59198670563091,4362801,6860625
14,"Longest Common Prefix",longest-common-prefix,false,Easy,18488,4656,Algorithms,44.5%,14,false,String;Trie;,true,true,44.45296848159445,4046268,9102360
15,"3Sum",3sum,false,Medium,31923,2998,Algorithms,36.0%,15,false,Array;Two Pointers;Sorting;,true,true,35.99212350443213,4223868,11735564
16,"3Sum Closest",3sum-closest,false,Medium,10731,582,Algorithms,46.4%,16,false,Array;Two Pointers;Sorting;,true,true,46.402140743745015,1379783,2973536
17,"Letter Combinations of a Phone Number",letter-combinations-of-a-phone-number,false,Medium,19173,1030,Algorithms,62.6%,17,false,Hash Table;String;Backtracking;,true,false,62.567091851331355,2340020,3740019
18,"4Sum",4sum,false,Medium,11705,1432,Algorithms,37.2%,18,false,Array;Two Pointers;Sorting;,true,false,37.22557378951593,1141970,3067700
19,"Remove Nth Node From End of List",remove-nth-node-from-end-of-list,false,Medium,19430,831,Algorithms,47.6%,19,false,Linked List;Two Pointers;,true,true,47.56448272891515,3169256,6663083
20,"Valid Parentheses",valid-parentheses,false,Easy,24966,1837,Algorithms,41.5%,20,false,String;Stack;,true,true,41.52613107864067,5479573,13195502
21,"Merge Two Sorted Lists",merge-two-sorted-lists,false,Easy,22614,2212,Algorithms,65.9%,21,false,Linked List;Recursion;,true,true,65.88408996011258,4818770,7314014
22,"Generate Parentheses",generate-parentheses,false,Medium,21661,1001,Algorithms,76.1%,22,false,String;Dynamic Programming;Backtracking;,true,true,76.11268286750659,2134207,2804010
23,"Merge k Sorted Lists",merge-k-sorted-lists,false,Hard,19939,739,Algorithms,55.1%,23,false,Linked List;Divide and Conquer;Heap (Priority Queue);Merge Sort;,true,true,55.136548622105316,2283915,4142301
24,"Swap Nodes in Pairs",swap-nodes-in-pairs,false,Medium,12229,466,Algorithms,66.1%,24,false,Linked List;Recursion;,true,false,66.05679679457629,1524644,2308082
25,"Reverse Nodes in k-Group",reverse-nodes-in-k-group,false,Hard,14164,734,Algorithms,61.4%,25,false,Linked List;Recursion;,true,false,61.39900632821388,1105293,1800182
26,"Remove Duplicates from Sorted Array",remove-duplicates-from-sorted-array,false,Easy,15776,19336,Algorithms,58.7%,26,false,Array;Two Pointers;,true,true,58.742118221498764,5472918,9316869
27,"Remove Element",remove-element,false,Easy,3279,4340,Algorithms,59.0%,27,false,Array;Two Pointers;,true,true,58.986290511334175,3714707,6297600
28,"Find the Index of the First Occurrence in a String",find-the-index-of-the-first-occurrence-in-a-string,false,Easy,6342,470,Algorithms,44.1%,28,false,Two Pointers;String;String Matching;,true,true,44.09520862722266,2987015,6774029
29,"Divide Two Integers",divide-two-integers,false,Medium,5409,14971,Algorithms,18.0%,29,false,Math;Bit Manipulation;,true,false,17.98487836260496,858225,4771954
30,"Substring with Concatenation of All Words",substring-with-concatenation-of-all-words,false,Hard,2050,317,Algorithms,32.6%,30,false,Hash Table;String;Sliding Window;,true,true,32.6409521381446,524921,1608158
31,"Next Permutation",next-permutation,false,Medium,19150,4834,Algorithms,41.9%,31,false,Array;Two Pointers;,true,true,41.86522026845741,1625891,3883635
32,"Longest Valid Parentheses",longest-valid-parentheses,false,Hard,12593,422,Algorithms,35.3%,32,false,String;Dynamic Programming;Stack;,true,false,35.28586059758415,833062,2360885
33,"Search in Rotated Sorted Array",search-in-rotated-sorted-array,false,Medium,27177,1647,Algorithms,42.0%,33,false,Array;Binary Search;,true,false,42.006075611940396,3237331,7706833
34,"Find First and Last Position of Element in Sorted Array",find-first-and-last-position-of-element-in-sorted-array,false,Medium,21189,550,Algorithms,45.7%,34,false,Array;Binary Search;,true,false,45.738144935732706,2400269,5247860
35,"Search Insert Position",search-insert-position,false,Easy,16839,790,Algorithms,47.9%,35,false,Array;Binary Search;,true,true,47.888436107278686,3442842,7189305
36,"Valid Sudoku",valid-sudoku,false,Medium,11139,1170,Algorithms,61.2%,36,false,Array;Hash Table;Matrix;,true,false,61.2158516221171,1798132,2937364
37,"Sudoku Solver",sudoku-solver,false,Hard,9862,277,Algorithms,63.5%,37,false,Array;Hash Table;Backtracking;Matrix;,true,false,63.53633441453012,696558,1096314
38,"Count and Say",count-and-say,false,Medium,4214,8515,Algorithms,57.3%,38,false,String;,true,false,57.33451274438459,1045500,1823509
39,"Combination Sum",combination-sum,false,Medium,19382,450,Algorithms,73.4%,39,false,Array;Backtracking;,true,true,73.44690370827023,2292197,3120894
40,"Combination Sum II",combination-sum-ii,false,Medium,11267,334,Algorithms,56.9%,40,false,Array;Backtracking;,true,false,56.88157056838603,1254973,2206302
41,"First Missing Positive",first-missing-positive,false,Hard,17224,1887,Algorithms,40.3%,41,false,Array;Hash Table;,true,false,40.32805856601657,1357667,3366566
42,"Trapping Rain Water",trapping-rain-water,false,Hard,33058,559,Algorithms,63.8%,42,false,Array;Two Pointers;Dynamic Programming;Stack;Monotonic Stack;,true,false,63.763374431371275,2516305,3946321
43,"Multiply Strings",multiply-strings,false,Medium,7243,3445,Algorithms,41.5%,43,false,Math;String;Simulation;,true,false,41.49474718589386,901964,2173679
44,"Wildcard Matching",wildcard-matching,false,Hard,8490,373,Algorithms,29.1%,44,false,String;Dynamic Programming;Greedy;Recursion;,true,false,29.060686577432826,658089,2264533
45,"Jump Game II",jump-game-ii,false,Medium,15103,618,Algorithms,41.0%,45,false,Array;Dynamic Programming;Greedy;,true,false,40.961085859159596,1532412,3741141
46,"Permutations",permutations,false,Medium,19539,343,Algorithms,79.8%,46,false,Array;Backtracking;,true,false,79.79208781606903,2385250,2989333
47,"Permutations II",permutations-ii,false,Medium,8665,148,Algorithms,60.6%,47,false,Array;Backtracking;,true,false,60.61390282740202,1031958,1702512
48,"Rotate Image",rotate-image,false,Medium,18202,867,Algorithms,76.7%,48,false,Array;Math;Matrix;,true,false,76.67344651221487,2065739,2694215
49,"Group Anagrams",group-anagrams,false,Medium,19898,658,Algorithms,70.0%,49,false,Array;Hash Table;String;Sorting;,true,true,69.9610618872783,3405871,4868238
50,"Pow(x, n)",powx-n,false,Medium,10253,9884,Algorithms,36.1%,50,false,Math;Recursion;,true,false,36.130463615297955,1992966,5516004
51,"N-Queens",n-queens,false,Hard,12810,306,Algorithms,71.0%,51,false,Array;Backtracking;,true,false,70.97072049271604,869309,1224884
52,"N-Queens II",n-queens-ii,false,Hard,3980,271,Algorithms,75.6%,52,false,Backtracking;,true,false,75.57873984515176,447765,592449
53,"Maximum Subarray",maximum-subarray,false,Medium,34928,1480,Algorithms,51.5%,53,false,Array;Divide and Conquer;Dynamic Programming;,true,true,51.5112650442178,4521975,8778617
54,"Spiral Matrix",spiral-matrix,false,Medium,15471,1390,Algorithms,52.3%,54,false,Array;Matrix;Simulation;,true,false,52.27583783637303,1716839,3284220
55,"Jump Game",jump-game,false,Medium,20021,1334,Algorithms,39.0%,55,false,Array;Dynamic Programming;Greedy;,true,false,38.97627255782655,2335342,5991697
56,"Merge Intervals",merge-intervals,false,Medium,22789,825,Algorithms,48.5%,56,false,Array;Sorting;,true,true,48.46223366007403,2849520,5879881
57,"Insert Interval",insert-interval,false,Medium,10748,849,Algorithms,42.7%,57,false,Array;,true,false,42.658901459008874,1315293,3083295
58,"Length of Last Word",length-of-last-word,false,Easy,5496,304,Algorithms,54.8%,58,false,String;,true,false,54.78390680359498,2460218,4490779
59,"Spiral Matrix II",spiral-matrix-ii,false,Medium,6541,268,Algorithms,72.6%,59,false,Array;Matrix;Simulation;,true,false,72.60844502252209,643647,886462
60,"Permutation Sequence",permutation-sequence,false,Hard,6825,489,Algorithms,48.7%,60,false,Math;Recursion;,true,false,48.69721936148301,444475,912736
61,"Rotate List",rotate-list,false,Medium,10079,1485,Algorithms,39.1%,61,false,Linked List;Two Pointers;,true,false,39.0813870989721,1152906,2950014
62,"Unique Paths",unique-paths,false,Medium,17058,459,Algorithms,65.2%,62,false,Math;Dynamic Programming;Combinatorics;,true,false,65.17770606145767,2129067,3266558
63,"Unique Paths II",unique-paths-ii,false,Medium,9005,524,Algorithms,42.5%,63,false,Array;Dynamic Programming;Matrix;,true,false,42.536257633313426,1097700,2580621
64,"Minimum Path Sum",minimum-path-sum,false,Medium,12766,178,Algorithms,65.5%,64,false,Array;Dynamic Programming;Matrix;,true,false,65.4893977171352,1374238,2098414
65,"Valid Number",valid-number,false,Hard,1329,2095,Algorithms,20.8%,65,false,String;,true,false,20.797970639924003,413139,1986439
66,"Plus One",plus-one,false,Easy,9854,5451,Algorithms,46.7%,66,false,Array;Math;,true,false,46.717471484811554,2661954,5697956
67,"Add Binary",add-binary,false,Easy,9687,1015,Algorithms,54.9%,67,false,Math;String;Bit Manipulation;Simulation;,true,false,54.87621701105727,1702117,3101741
68,"Text Justification",text-justification,false,Hard,3929,4941,Algorithms,46.3%,68,false,Array;String;Simulation;,true,false,46.304763739449534,490348,1058958
69,"Sqrt(x)",sqrtx,false,Easy,8550,4553,Algorithms,39.8%,69,false,Math;Binary Search;,true,true,39.76837438235218,2328858,5856057
70,"Climbing Stairs",climbing-stairs,false,Easy,22628,906,Algorithms,53.3%,70,false,Math;Dynamic Programming;Memoization;,true,false,53.273975491394445,3837538,7203401
71,"Simplify Path",simplify-path,false,Medium,5858,1332,Algorithms,45.7%,71,false,String;Stack;,true,true,45.66165159134345,940622,2059985
72,"Edit Distance",edit-distance,false,Medium,15267,251,Algorithms,57.9%,72,false,String;Dynamic Programming;,true,false,57.8597858110278,1035962,1790465
73,"Set Matrix Zeroes",set-matrix-zeroes,false,Medium,15104,771,Algorithms,58.4%,73,false,Array;Hash Table;Matrix;,true,false,58.35108104029614,1743908,2988646
74,"Search a 2D Matrix",search-a-2d-matrix,false,Medium,16325,433,Algorithms,51.5%,74,false,Array;Binary Search;Matrix;,true,false,51.48956461972824,2126044,4129078
75,"Sort Colors",sort-colors,false,Medium,19213,681,Algorithms,65.8%,75,false,Array;Two Pointers;Sorting;,true,false,65.80515048252718,2538187,3857130
76,"Minimum Window Substring",minimum-window-substring,false,Hard,18414,763,Algorithms,44.3%,76,false,Hash Table;String;Sliding Window;,true,false,44.27631222448052,1576966,3561645
77,"Combinations",combinations,false,Medium,8410,234,Algorithms,71.9%,77,false,Backtracking;,true,false,71.89528394028186,1030542,1433395
78,"Subsets",subsets,false,Medium,17755,294,Algorithms,79.8%,78,false,Array;Backtracking;Bit Manipulation;,true,true,79.84941998063961,2267561,2839799
79,"Word Search",word-search,false,Medium,16309,692,Algorithms,44.2%,79,false,Array;String;Backtracking;Depth-First Search;Matrix;,true,false,44.20992665878598,1912973,4327026
80,"Remove Duplicates from Sorted Array II",remove-duplicates-from-sorted-array-ii,false,Medium,7332,1395,Algorithms,61.3%,80,false,Array;Two Pointers;,true,false,61.33171930849297,1318807,2150285
81,"Search in Rotated Sorted Array II",search-in-rotated-sorted-array-ii,false,Medium,8769,1067,Algorithms,38.4%,81,false,Array;Binary Search;,true,false,38.40833138347727,865063,2252292
82,"Remove Duplicates from Sorted List II",remove-duplicates-from-sorted-list-ii,false,Medium,9056,251,Algorithms,48.9%,82,false,Linked List;Two Pointers;,true,false,48.86902949345998,844143,1727361
83,"Remove Duplicates from Sorted List",remove-duplicates-from-sorted-list,false,Easy,9011,325,Algorithms,54.0%,83,false,Linked List;,true,true,53.98927896308518,1773615,3285127
84,"Largest Rectangle in Histogram",largest-rectangle-in-histogram,false,Hard,17778,307,Algorithms,46.1%,84,false,Array;Stack;Monotonic Stack;,true,true,46.14401398435751,1067512,2313437
85,"Maximal Rectangle",maximal-rectangle,false,Hard,10883,191,Algorithms,52.4%,85,false,Array;Dynamic Programming;Stack;Matrix;Monotonic Stack;,true,false,52.43748093931077,550213,1049277
86,"Partition List",partition-list,false,Medium,7520,916,Algorithms,57.9%,86,false,Linked List;Two Pointers;,true,false,57.887072364149276,708753,1224374
87,"Scramble String",scramble-string,false,Hard,3407,1285,Algorithms,41.3%,87,false,String;Dynamic Programming;,true,false,41.28533799269179,250935,607808
88,"Merge Sorted Array",merge-sorted-array,false,Easy,16079,2164,Algorithms,51.8%,88,false,Array;Two Pointers;Sorting;,true,true,51.78455223186287,4040881,7803259
89,"Gray Code",gray-code,false,Medium,2307,2759,Algorithms,60.7%,89,false,Math;Backtracking;Bit Manipulation;,true,false,60.72095612080485,326734,538091
90,"Subsets II",subsets-ii,false,Medium,10072,346,Algorithms,58.6%,90,false,Array;Backtracking;Bit Manipulation;,true,false,58.56057012746341,1088937,1859506
91,"Decode Ways",decode-ways,false,Medium,12188,4552,Algorithms,35.9%,91,false,String;Dynamic Programming;,true,true,35.85440008509431,1375280,3835738
92,"Reverse Linked List II",reverse-linked-list-ii,false,Medium,11950,669,Algorithms,48.8%,92,false,Linked List;,true,true,48.77998111241243,997929,2045777
93,"Restore IP Addresses",restore-ip-addresses,false,Medium,5338,803,Algorithms,51.9%,93,false,String;Backtracking;,true,false,51.88278418366823,505302,973930
94,"Binary Tree Inorder Traversal",binary-tree-inorder-traversal,false,Easy,13821,822,Algorithms,77.6%,94,false,Stack;Tree;Depth-First Search;Binary Tree;,true,false,77.63631445397432,2881542,3711593
95,"Unique Binary Search Trees II",unique-binary-search-trees-ii,false,Medium,7691,543,Algorithms,59.3%,95,false,Dynamic Programming;Backtracking;Tree;Binary Search Tree;Binary Tree;,true,false,59.33458474543259,487417,821472
96,"Unique Binary Search Trees",unique-binary-search-trees,false,Medium,10540,419,Algorithms,61.9%,96,false,Math;Dynamic Programming;Tree;Binary Search Tree;Binary Tree;,true,false,61.92774739093513,722690,1166989
97,"Interleaving String",interleaving-string,false,Medium,8396,510,Algorithms,41.1%,97,false,String;Dynamic Programming;,true,false,41.07988565463546,597380,1454191
98,"Validate Binary Search Tree",validate-binary-search-tree,false,Medium,17225,1391,Algorithms,33.8%,98,false,Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,true,33.75641506114863,2648121,7844803
99,"Recover Binary Search Tree",recover-binary-search-tree,false,Medium,8064,263,Algorithms,55.0%,99,false,Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,false,54.99865853751261,506338,920637
100,"Same Tree",same-tree,false,Easy,11898,256,Algorithms,64.0%,100,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,true,64.02949917258357,2549424,3981640
101,"Symmetric Tree",symmetric-tree,false,Easy,15706,399,Algorithms,58.2%,101,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,true,58.21122476481384,2267806,3895822
102,"Binary Tree Level Order Traversal",binary-tree-level-order-traversal,false,Medium,15786,331,Algorithms,69.3%,102,false,Tree;Breadth-First Search;Binary Tree;,true,false,69.29540413665457,2587788,3734435
103,"Binary Tree Zigzag Level Order Traversal",binary-tree-zigzag-level-order-traversal,false,Medium,11136,320,Algorithms,60.6%,103,false,Tree;Breadth-First Search;Binary Tree;,true,false,60.606582570705704,1354635,2235133
104,"Maximum Depth of Binary Tree",maximum-depth-of-binary-tree,false,Easy,13211,248,Algorithms,76.5%,104,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,true,76.51302484482648,3632325,4747336
105,"Construct Binary Tree from Preorder and Inorder Traversal",construct-binary-tree-from-preorder-and-inorder-traversal,false,Medium,15471,540,Algorithms,65.7%,105,false,Array;Hash Table;Divide and Conquer;Tree;Binary Tree;,true,false,65.66970360114243,1428092,2174662
106,"Construct Binary Tree from Inorder and Postorder Traversal",construct-binary-tree-from-inorder-and-postorder-traversal,false,Medium,8214,137,Algorithms,65.1%,106,false,Array;Hash Table;Divide and Conquer;Tree;Binary Tree;,true,false,65.11395774413575,735830,1130066
107,"Binary Tree Level Order Traversal II",binary-tree-level-order-traversal-ii,false,Medium,4953,326,Algorithms,65.0%,107,false,Tree;Breadth-First Search;Binary Tree;,true,false,64.97332114577875,699442,1076507
108,"Convert Sorted Array to Binary Search Tree",convert-sorted-array-to-binary-search-tree,false,Easy,11232,586,Algorithms,73.2%,108,false,Array;Divide and Conquer;Tree;Binary Search Tree;Binary Tree;,true,true,73.20414155065494,1366594,1866828
109,"Convert Sorted List to Binary Search Tree",convert-sorted-list-to-binary-search-tree,false,Medium,7580,163,Algorithms,63.5%,109,false,Linked List;Divide and Conquer;Tree;Binary Search Tree;Binary Tree;,true,true,63.49640416698471,573981,903959
110,"Balanced Binary Tree",balanced-binary-tree,false,Easy,11083,741,Algorithms,54.1%,110,false,Tree;Depth-First Search;Binary Tree;,true,false,54.14738279882568,1764869,3259392
111,"Minimum Depth of Binary Tree",minimum-depth-of-binary-tree,false,Easy,7433,1320,Algorithms,49.6%,111,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,49.60559039832478,1337960,2697196
112,"Path Sum",path-sum,false,Easy,9965,1146,Algorithms,52.0%,112,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,52.01872106913543,1672157,3214531
113,"Path Sum II",path-sum-ii,false,Medium,8154,158,Algorithms,59.7%,113,false,Backtracking;Tree;Depth-First Search;Binary Tree;,true,false,59.730375896556474,954350,1597768
114,"Flatten Binary Tree to Linked List",flatten-binary-tree-to-linked-list,false,Medium,12650,571,Algorithms,67.2%,114,false,Linked List;Stack;Tree;Depth-First Search;Binary Tree;,true,false,67.19899553015837,1093400,1627112
115,"Distinct Subsequences",distinct-subsequences,false,Hard,6836,302,Algorithms,49.0%,115,false,String;Dynamic Programming;,true,false,49.000091720834035,486150,992141
116,"Populating Next Right Pointers in Each Node",populating-next-right-pointers-in-each-node,false,Medium,9939,310,Algorithms,64.4%,116,false,Linked List;Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,64.40345532931914,1140399,1770712
117,"Populating Next Right Pointers in Each Node II",populating-next-right-pointers-in-each-node-ii,false,Medium,5950,331,Algorithms,54.4%,117,false,Linked List;Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,54.351222981342886,701574,1290818
118,"Pascal's Triangle",pascals-triangle,false,Easy,13363,486,Algorithms,76.0%,118,false,Array;Dynamic Programming;,true,true,76.02127132968133,1941176,2553467
119,"Pascal's Triangle II",pascals-triangle-ii,false,Easy,4945,354,Algorithms,65.2%,119,false,Array;Dynamic Programming;,true,false,65.21177531983896,984474,1509656
120,"Triangle",triangle,false,Medium,9794,567,Algorithms,58.2%,120,false,Array;Dynamic Programming;,true,false,58.233341196240616,896126,1538857
121,"Best Time to Buy and Sell Stock",best-time-to-buy-and-sell-stock,false,Easy,32173,1229,Algorithms,54.5%,121,false,Array;Dynamic Programming;,true,true,54.51430253577358,5688851,10435542
122,"Best Time to Buy and Sell Stock II",best-time-to-buy-and-sell-stock-ii,false,Medium,14096,2743,Algorithms,68.4%,122,false,Array;Dynamic Programming;Greedy;,true,true,68.3847095603835,2277273,3330094
123,"Best Time to Buy and Sell Stock III",best-time-to-buy-and-sell-stock-iii,false,Hard,9928,202,Algorithms,49.8%,123,false,Array;Dynamic Programming;,true,false,49.83021451392059,709657,1424150
124,"Binary Tree Maximum Path Sum",binary-tree-maximum-path-sum,false,Hard,17131,753,Algorithms,40.7%,124,false,Dynamic Programming;Tree;Depth-First Search;Binary Tree;,true,false,40.70621464925116,1436841,3529776
125,"Valid Palindrome",valid-palindrome,false,Easy,9867,8475,Algorithms,49.6%,125,false,Two Pointers;String;,true,false,49.57487707417342,3719906,7503622
126,"Word Ladder II",word-ladder-ii,false,Hard,6146,790,Algorithms,27.1%,126,false,Hash Table;String;Backtracking;Breadth-First Search;,true,false,27.11557444303606,390621,1440578
127,"Word Ladder",word-ladder,false,Hard,12438,1907,Algorithms,41.2%,127,false,Hash Table;String;Breadth-First Search;,true,true,41.24777345351643,1227308,2975456
128,"Longest Consecutive Sequence",longest-consecutive-sequence,false,Medium,20791,1082,Algorithms,47.7%,128,false,Array;Hash Table;Union Find;,true,false,47.65801531525608,2239665,4699449
129,"Sum Root to Leaf Numbers",sum-root-to-leaf-numbers,false,Medium,8239,144,Algorithms,67.4%,129,false,Tree;Depth-First Search;Binary Tree;,true,false,67.43574287280336,1011311,1499668
130,"Surrounded Regions",surrounded-regions,false,Medium,8956,1987,Algorithms,41.5%,130,false,Array;Depth-First Search;Breadth-First Search;Union Find;Matrix;,true,false,41.532512514401155,849676,2045819
131,"Palindrome Partitioning",palindrome-partitioning,false,Medium,13220,523,Algorithms,70.9%,131,false,String;Dynamic Programming;Backtracking;,true,false,70.9225876488846,1020472,1438855
132,"Palindrome Partitioning II",palindrome-partitioning-ii,false,Hard,5573,142,Algorithms,34.6%,132,false,String;Dynamic Programming;,true,false,34.621313418864176,315108,910158
133,"Clone Graph",clone-graph,false,Medium,9770,3965,Algorithms,60.4%,133,false,Hash Table;Depth-First Search;Breadth-First Search;Graph;,true,false,60.40801456585398,1444226,2390790
134,"Gas Station",gas-station,false,Medium,12396,1250,Algorithms,45.8%,134,false,Array;Greedy;,true,false,45.79226081048117,979902,2139890
135,"Candy",candy,false,Hard,8175,714,Algorithms,44.1%,135,false,Array;Greedy;,true,false,44.12106488484004,662161,1500781
136,"Single Number",single-number,false,Easy,17030,773,Algorithms,74.9%,136,false,Array;Bit Manipulation;,true,false,74.85454520461697,3321771,4437634
137,"Single Number II",single-number-ii,false,Medium,8142,711,Algorithms,64.3%,137,false,Array;Bit Manipulation;,true,false,64.30492856851629,678182,1054639
138,"Copy List with Random Pointer",copy-list-with-random-pointer,false,Medium,14321,1539,Algorithms,58.8%,138,false,Hash Table;Linked List;,true,false,58.798779078468044,1457686,2479110
139,"Word Break",word-break,false,Medium,17626,832,Algorithms,47.6%,139,false,Array;Hash Table;String;Dynamic Programming;Trie;Memoization;,true,true,47.63081267316902,1903371,3996092
140,"Word Break II",word-break-ii,false,Hard,7297,539,Algorithms,52.5%,140,false,Array;Hash Table;String;Dynamic Programming;Backtracking;Trie;Memoization;,true,false,52.48465804066543,709853,1352498
141,"Linked List Cycle",linked-list-cycle,false,Easy,16020,1449,Algorithms,51.6%,141,false,Hash Table;Linked List;Two Pointers;,true,true,51.61713437575507,3529101,6837083
142,"Linked List Cycle II",linked-list-cycle-ii,false,Medium,13951,996,Algorithms,53.4%,142,false,Hash Table;Linked List;Two Pointers;,true,false,53.41363162775787,1492861,2794906
143,"Reorder List",reorder-list,false,Medium,11492,434,Algorithms,61.0%,143,false,Linked List;Two Pointers;Stack;Recursion;,true,false,61.033050583328915,1141654,1870553
144,"Binary Tree Preorder Traversal",binary-tree-preorder-traversal,false,Easy,8205,215,Algorithms,71.7%,144,false,Stack;Tree;Depth-First Search;Binary Tree;,true,false,71.72479171477598,1860475,2593909
145,"Binary Tree Postorder Traversal",binary-tree-postorder-traversal,false,Easy,7272,208,Algorithms,74.3%,145,false,Stack;Tree;Depth-First Search;Binary Tree;,true,false,74.31295745014214,1494029,2010458
146,"LRU Cache",lru-cache,false,Medium,21287,1098,Algorithms,44.0%,146,false,Hash Table;Linked List;Design;Doubly-Linked List;,true,false,43.96047490722405,1897349,4316034
147,"Insertion Sort List",insertion-sort-list,false,Medium,3186,868,Algorithms,55.4%,147,false,Linked List;Sorting;,true,true,55.359572486766695,404843,731298
148,"Sort List",sort-list,false,Medium,12008,376,Algorithms,60.3%,148,false,Linked List;Two Pointers;Divide and Conquer;Sorting;Merge Sort;,true,false,60.325187923805146,934289,1548758
149,"Max Points on a Line",max-points-on-a-line,false,Hard,4267,527,Algorithms,28.1%,149,false,Array;Hash Table;Math;Geometry;,true,false,28.05507656406497,434725,1549547
150,"Evaluate Reverse Polish Notation",evaluate-reverse-polish-notation,false,Medium,7913,1119,Algorithms,53.5%,150,false,Array;Math;Stack;,true,false,53.50598897933572,1249206,2334704
151,"Reverse Words in a String",reverse-words-in-a-string,false,Medium,8983,5292,Algorithms,48.6%,151,false,Two Pointers;String;,true,false,48.58684321694837,2021919,4161479
152,"Maximum Product Subarray",maximum-product-subarray,false,Medium,19015,763,Algorithms,34.3%,152,false,Array;Dynamic Programming;,true,false,34.31900728700368,1485070,4327264
153,"Find Minimum in Rotated Sorted Array",find-minimum-in-rotated-sorted-array,false,Medium,13742,606,Algorithms,51.8%,153,false,Array;Binary Search;,true,false,51.82795341019051,2179919,4206069
154,"Find Minimum in Rotated Sorted Array II",find-minimum-in-rotated-sorted-array-ii,false,Hard,4789,499,Algorithms,43.9%,154,false,Array;Binary Search;,true,false,43.88209032778019,496574,1131605
155,"Min Stack",min-stack,false,Medium,14634,909,Algorithms,55.5%,155,false,Stack;Design;,true,false,55.542755431663615,1973388,3552917
156,"Binary Tree Upside Down",binary-tree-upside-down,true,Medium,274,366,Algorithms,63.7%,156,true,Tree;Depth-First Search;Binary Tree;,false,false,63.742586002372484,107470,168600
157,"Read N Characters Given Read4",read-n-characters-given-read4,true,Easy,589,3551,Algorithms,42.0%,157,true,Array;Simulation;Interactive;,true,false,41.98108214532198,198301,472358
158,"Read N Characters Given read4 II - Call Multiple Times",read-n-characters-given-read4-ii-call-multiple-times,true,Hard,873,1812,Algorithms,42.7%,158,true,Array;Simulation;Interactive;,false,false,42.67250935448404,188627,442034
159,"Longest Substring with At Most Two Distinct Characters",longest-substring-with-at-most-two-distinct-characters,true,Medium,2231,36,Algorithms,56.0%,159,true,Hash Table;String;Sliding Window;,true,true,55.957992159299486,273769,489241
160,"Intersection of Two Linked Lists",intersection-of-two-linked-lists,false,Easy,15397,1396,Algorithms,59.7%,160,false,Hash Table;Linked List;Two Pointers;,true,true,59.71508063864421,1810390,3031721
161,"One Edit Distance",one-edit-distance,true,Medium,1413,191,Algorithms,34.4%,161,true,Two Pointers;String;,true,false,34.42327732494624,218678,635260
162,"Find Peak Element",find-peak-element,false,Medium,12727,4773,Algorithms,46.2%,162,false,Array;Binary Search;,true,true,46.24199422669999,1699316,3674834
163,"Missing Ranges",missing-ranges,true,Easy,1140,2995,Algorithms,34.8%,163,true,Array;,true,false,34.75003633007595,272605,784474
164,"Maximum Gap",maximum-gap,false,Medium,3359,412,Algorithms,48.1%,164,false,Array;Sorting;Bucket Sort;Radix Sort;,true,false,48.06365648499958,249073,518216
165,"Compare Version Numbers",compare-version-numbers,false,Medium,2703,2749,Algorithms,41.7%,165,false,Two Pointers;String;,true,false,41.72373324875109,526178,1261100
166,"Fraction to Recurring Decimal",fraction-to-recurring-decimal,false,Medium,2133,3711,Algorithms,25.7%,166,false,Hash Table;Math;String;,true,false,25.67837492117447,243099,946709
167,"Two Sum II - Input Array Is Sorted",two-sum-ii-input-array-is-sorted,false,Medium,12165,1448,Algorithms,62.5%,167,false,Array;Two Pointers;Binary Search;,true,false,62.543435249874946,2426811,3880201
168,"Excel Sheet Column Title",excel-sheet-column-title,false,Easy,5709,849,Algorithms,42.5%,168,false,Math;String;,true,false,42.46392411547169,588593,1386104
169,"Majority Element",majority-element,false,Easy,20118,690,Algorithms,65.4%,169,false,Array;Hash Table;Divide and Conquer;Sorting;Counting;,true,false,65.39029120471045,3714532,5680563
170,"Two Sum III - Data structure design",two-sum-iii-data-structure-design,true,Easy,685,453,Algorithms,38.5%,170,true,Array;Hash Table;Two Pointers;Design;Data Stream;,true,false,38.483074991097034,164255,426824
171,"Excel Sheet Column Number",excel-sheet-column-number,false,Easy,4856,380,Algorithms,65.0%,171,false,Math;String;,true,false,65.0092205280439,751581,1156115
172,"Factorial Trailing Zeroes",factorial-trailing-zeroes,false,Medium,3292,1966,Algorithms,44.2%,172,false,Math;,true,false,44.21990990419389,515742,1166311
173,"Binary Search Tree Iterator",binary-search-tree-iterator,false,Medium,8755,526,Algorithms,73.8%,173,false,Stack;Tree;Design;Binary Search Tree;Binary Tree;Iterator;,true,false,73.8408168923591,889533,1204663
174,"Dungeon Game",dungeon-game,false,Hard,5919,114,Algorithms,38.8%,174,false,Array;Dynamic Programming;Matrix;,true,false,38.84402991115859,244717,629999
175,"Combine Two Tables",combine-two-tables,false,Easy,3630,229,Database,77.3%,175,false,Database;,true,false,77.26622172146395,1167175,1510591
176,"Second Highest Salary",second-highest-salary,false,Medium,3732,976,Database,42.5%,176,false,Database;,true,false,42.46175341941274,1024736,2413323
177,"Nth Highest Salary",nth-highest-salary,false,Medium,2051,1063,Database,38.0%,177,false,Database;,true,false,37.95214978018434,447172,1178255
178,"Rank Scores",rank-scores,false,Medium,2222,280,Database,64.1%,178,false,Database;,true,false,64.1183921453567,447990,698692
179,"Largest Number",largest-number,false,Medium,8966,756,Algorithms,40.5%,179,false,Array;String;Greedy;Sorting;,true,false,40.525577959471484,675870,1667763
180,"Consecutive Numbers",consecutive-numbers,false,Medium,2259,333,Database,44.9%,180,false,Database;,true,false,44.88524926016527,477615,1064084
181,"Employees Earning More Than Their Managers",employees-earning-more-than-their-managers,false,Easy,2693,268,Database,70.8%,181,false,Database;,true,false,70.75737143622261,739830,1045588
182,"Duplicate Emails",duplicate-emails,false,Easy,2155,74,Database,71.9%,182,false,Database;,true,false,71.88480017338455,769492,1070452
183,"Customers Who Never Order",customers-who-never-order,false,Easy,2710,140,Database,70.1%,183,false,Database;,true,false,70.07319993393205,920616,1313793
184,"Department Highest Salary",department-highest-salary,false,Medium,2127,190,Database,53.5%,184,false,Database;,true,false,53.46485876413954,443869,830207
185,"Department Top Three Salaries",department-top-three-salaries,false,Hard,2213,253,Database,56.2%,185,false,Database;,true,false,56.17861518132747,420042,747698
186,"Reverse Words in a String II",reverse-words-in-a-string-ii,true,Medium,1090,144,Algorithms,55.6%,186,true,Two Pointers;String;,true,true,55.57873261448123,169990,305856
187,"Repeated DNA Sequences",repeated-dna-sequences,false,Medium,3418,546,Algorithms,50.3%,187,false,Hash Table;String;Bit Manipulation;Sliding Window;Rolling Hash;Hash Function;,true,false,50.302916602936676,420966,836862
188,"Best Time to Buy and Sell Stock IV",best-time-to-buy-and-sell-stock-iv,false,Hard,7597,212,Algorithms,45.4%,188,false,Array;Dynamic Programming;,true,false,45.43980725426403,535624,1178755
189,"Rotate Array",rotate-array,false,Medium,18782,2040,Algorithms,42.1%,189,false,Array;Math;Two Pointers;,true,false,42.088811096815654,2748220,6529573
190,"Reverse Bits",reverse-bits,false,Easy,5253,1521,Algorithms,61.4%,190,false,Divide and Conquer;Bit Manipulation;,true,false,61.4270042781866,917200,1493152
191,"Number of 1 Bits",number-of-1-bits,false,Easy,6689,1345,Algorithms,73.2%,191,false,Divide and Conquer;Bit Manipulation;,true,false,73.24605647491393,1668569,2278034
192,"Word Frequency",word-frequency,false,Medium,552,309,Shell,26.4%,192,false,Shell;,false,false,26.418930470905167,57174,216413
193,"Valid Phone Numbers",valid-phone-numbers,false,Easy,441,970,Shell,26.7%,193,false,Shell;,false,false,26.7143055009851,94506,353754
194,"Transpose File",transpose-file,false,Medium,152,287,Shell,27.3%,194,false,Shell;,false,false,27.333680026744922,29434,107684
195,"Tenth Line",tenth-line,false,Easy,398,471,Shell,34.0%,195,false,Shell;,false,false,33.96537557022639,119874,352930
196,"Delete Duplicate Emails",delete-duplicate-emails,false,Easy,1718,359,Database,63.5%,196,false,Database;,true,false,63.53620672055879,641108,1009047
197,"Rising Temperature",rising-temperature,false,Easy,3334,655,Database,49.5%,197,false,Database;,true,false,49.527459932735844,922595,1862797
198,"House Robber",house-robber,false,Medium,21678,454,Algorithms,51.8%,198,false,Array;Dynamic Programming;,true,false,51.808675218711464,2620144,5057347
199,"Binary Tree Right Side View",binary-tree-right-side-view,false,Medium,12395,1041,Algorithms,64.7%,199,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,true,64.70772839802831,1610328,2488620
200,"Number of Islands",number-of-islands,false,Medium,23336,545,Algorithms,61.1%,200,false,Array;Depth-First Search;Breadth-First Search;Union Find;Matrix;,true,true,61.1067652044502,3139424,5137611
201,"Bitwise AND of Numbers Range",bitwise-and-of-numbers-range,false,Medium,4070,303,Algorithms,47.4%,201,false,Bit Manipulation;,true,false,47.38266172014487,429392,906224
202,"Happy Number",happy-number,false,Easy,10773,1530,Algorithms,57.3%,202,false,Hash Table;Math;Two Pointers;,true,false,57.26145256233558,1706305,2979854
203,"Remove Linked List Elements",remove-linked-list-elements,false,Easy,8501,258,Algorithms,50.7%,203,false,Linked List;Recursion;,true,false,50.65748897536082,1269795,2506636
204,"Count Primes",count-primes,false,Medium,8154,1491,Algorithms,34.2%,204,false,Array;Math;Enumeration;Number Theory;,true,false,34.247587231791805,979652,2860495
205,"Isomorphic Strings",isomorphic-strings,false,Easy,9406,2159,Algorithms,46.1%,205,false,Hash Table;String;,true,false,46.1153455306476,1603274,3476661
206,"Reverse Linked List",reverse-linked-list,false,Easy,22256,480,Algorithms,78.3%,206,false,Linked List;Recursion;,true,true,78.25807386873794,4820763,6160085
207,"Course Schedule",course-schedule,false,Medium,16689,770,Algorithms,48.1%,207,false,Depth-First Search;Breadth-First Search;Graph;Topological Sort;,true,false,48.067931466657306,1862410,3874543
208,"Implement Trie (Prefix Tree)",implement-trie-prefix-tree,false,Medium,11838,146,Algorithms,67.0%,208,false,Hash Table;String;Design;Trie;,true,false,67.03073198939381,1207864,1801959
209,"Minimum Size Subarray Sum",minimum-size-subarray-sum,false,Medium,13065,473,Algorithms,48.4%,209,false,Array;Binary Search;Sliding Window;Prefix Sum;,true,false,48.384085774274496,1284473,2654749
210,"Course Schedule II",course-schedule-ii,false,Medium,11079,357,Algorithms,52.2%,210,false,Depth-First Search;Breadth-First Search;Graph;Topological Sort;,true,true,52.164187688427596,1228988,2356005
211,"Design Add and Search Words Data Structure",design-add-and-search-words-data-structure,false,Medium,7734,467,Algorithms,46.4%,211,false,String;Depth-First Search;Design;Trie;,true,false,46.39722474127383,717802,1547088
212,"Word Search II",word-search-ii,false,Hard,9631,479,Algorithms,36.9%,212,false,Array;String;Backtracking;Trie;Matrix;,true,true,36.85007893007677,735787,1996704
213,"House Robber II",house-robber-ii,false,Medium,10172,166,Algorithms,42.9%,213,false,Array;Dynamic Programming;,true,false,42.89040882666125,901047,2100812
214,"Shortest Palindrome",shortest-palindrome,false,Hard,4286,275,Algorithms,40.1%,214,false,String;Rolling Hash;String Matching;Hash Function;,true,false,40.05106385316464,291615,728108
215,"Kth Largest Element in an Array",kth-largest-element-in-an-array,false,Medium,17519,918,Algorithms,67.4%,215,false,Array;Divide and Conquer;Sorting;Heap (Priority Queue);Quickselect;,true,true,67.37370158123687,2711317,4024300
216,"Combination Sum III",combination-sum-iii,false,Medium,6176,114,Algorithms,71.0%,216,false,Array;Backtracking;,true,false,71.03800810512097,601597,846867
217,"Contains Duplicate",contains-duplicate,false,Easy,12468,1315,Algorithms,62.6%,217,false,Array;Hash Table;Sorting;,true,false,62.56480644582321,4657107,7443660
218,"The Skyline Problem",the-skyline-problem,false,Hard,5994,270,Algorithms,43.4%,218,false,Array;Divide and Conquer;Binary Indexed Tree;Segment Tree;Line Sweep;Heap (Priority Queue);Ordered Set;,true,false,43.40174379610999,307382,708225
219,"Contains Duplicate II",contains-duplicate-ii,false,Easy,6475,3175,Algorithms,47.5%,219,false,Array;Hash Table;Sliding Window;,true,false,47.465179750265094,1172324,2469865
220,"Contains Duplicate III",contains-duplicate-iii,false,Hard,1099,106,Algorithms,23.2%,220,false,Array;Sliding Window;Sorting;Bucket Sort;Ordered Set;,true,false,23.23360735812955,269931,1161815
221,"Maximal Square",maximal-square,false,Medium,10404,237,Algorithms,47.9%,221,false,Array;Dynamic Programming;Matrix;,true,false,47.8827589202911,760530,1588316
222,"Count Complete Tree Nodes",count-complete-tree-nodes,false,Easy,8881,549,Algorithms,68.3%,222,false,Binary Search;Bit Manipulation;Tree;Binary Tree;,true,false,68.30759156019309,867850,1270503
223,"Rectangle Area",rectangle-area,false,Medium,2027,1651,Algorithms,47.0%,223,false,Math;Geometry;,true,false,46.98207662689155,239034,508777
224,"Basic Calculator",basic-calculator,false,Hard,6476,521,Algorithms,44.4%,224,false,Math;String;Stack;Recursion;,true,false,44.43457330524764,535173,1204408
225,"Implement Stack using Queues",implement-stack-using-queues,false,Easy,6280,1228,Algorithms,66.0%,225,false,Stack;Design;Queue;,true,false,66.00187526925319,807388,1223283
226,"Invert Binary Tree",invert-binary-tree,false,Easy,14320,235,Algorithms,78.3%,226,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,true,78.29650537643191,2396391,3060663
227,"Basic Calculator II",basic-calculator-ii,false,Medium,6288,887,Algorithms,44.9%,227,false,Math;String;Stack;,true,false,44.87662028457757,748297,1667454
228,"Summary Ranges",summary-ranges,false,Easy,4144,2267,Algorithms,52.2%,228,false,Array;,true,false,52.229715128799334,700917,1341988
229,"Majority Element II",majority-element-ii,false,Medium,9998,447,Algorithms,53.2%,229,false,Array;Hash Table;Sorting;Counting;,true,false,53.2341410532846,846081,1589360
230,"Kth Smallest Element in a BST",kth-smallest-element-in-a-bst,false,Medium,11813,238,Algorithms,74.3%,230,false,Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,false,74.30900610554416,1693052,2278398
231,"Power of Two",power-of-two,false,Easy,7046,459,Algorithms,48.1%,231,false,Math;Bit Manipulation;Recursion;,true,false,48.10193451660813,1540650,3202894
232,"Implement Queue using Stacks",implement-queue-using-stacks,false,Easy,7886,451,Algorithms,67.4%,232,false,Stack;Design;Queue;,true,false,67.44255057089362,1086367,1610804
233,"Number of Digit One",number-of-digit-one,false,Hard,1631,1498,Algorithms,35.3%,233,false,Math;Dynamic Programming;Recursion;,true,false,35.28315971180827,105876,300076
234,"Palindrome Linked List",palindrome-linked-list,false,Easy,16947,912,Algorithms,54.7%,234,false,Linked List;Two Pointers;Stack;Recursion;,true,true,54.74637012865633,2211227,4039038
235,"Lowest Common Ancestor of a Binary Search Tree",lowest-common-ancestor-of-a-binary-search-tree,false,Medium,11456,326,Algorithms,66.9%,235,false,Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,false,66.88911499982417,1730899,2587713
236,"Lowest Common Ancestor of a Binary Tree",lowest-common-ancestor-of-a-binary-tree,false,Medium,17119,445,Algorithms,65.0%,236,false,Tree;Depth-First Search;Binary Tree;,true,false,64.97096411255127,1931600,2973028
237,"Delete Node in a Linked List",delete-node-in-a-linked-list,false,Medium,5403,1638,Algorithms,81.4%,237,false,Linked List;,true,false,81.35014702927052,1586835,1950625
238,"Product of Array Except Self",product-of-array-except-self,false,Medium,23408,1480,Algorithms,67.1%,238,false,Array;Prefix Sum;,true,true,67.12629854990284,3231760,4814450
239,"Sliding Window Maximum",sliding-window-maximum,false,Hard,18730,715,Algorithms,47.1%,239,false,Array;Queue;Sliding Window;Heap (Priority Queue);Monotonic Queue;,true,false,47.085624875105545,1192254,2532109
240,"Search a 2D Matrix II",search-a-2d-matrix-ii,false,Medium,12213,212,Algorithms,54.0%,240,false,Array;Binary Search;Divide and Conquer;Matrix;,true,true,54.049968078840884,1048955,1940715
241,"Different Ways to Add Parentheses",different-ways-to-add-parentheses,false,Medium,6118,379,Algorithms,71.9%,241,false,Math;String;Dynamic Programming;Recursion;Memoization;,true,false,71.9084797644187,334051,464551
242,"Valid Anagram",valid-anagram,false,Easy,12595,418,Algorithms,65.8%,242,false,Hash Table;String;Sorting;,true,true,65.80364683010517,4255988,6467705
243,"Shortest Word Distance",shortest-word-distance,true,Easy,1283,118,Algorithms,65.6%,243,true,Array;String;,true,false,65.64956485120719,224490,341952
244,"Shortest Word Distance II",shortest-word-distance-ii,true,Medium,1066,360,Algorithms,61.7%,244,true,Array;Hash Table;Two Pointers;String;Design;,true,true,61.65306138121165,160568,260438
245,"Shortest Word Distance III",shortest-word-distance-iii,true,Medium,507,100,Algorithms,58.8%,245,true,Array;String;,true,false,58.78424339867664,85554,145539
246,"Strobogrammatic Number",strobogrammatic-number,true,Easy,609,1027,Algorithms,47.6%,246,true,Hash Table;Two Pointers;String;,true,true,47.64162166172486,186221,390880
247,"Strobogrammatic Number II",strobogrammatic-number-ii,true,Medium,932,256,Algorithms,52.8%,247,true,Array;String;Recursion;,true,false,52.79629154917542,148290,280872
248,"Strobogrammatic Number III",strobogrammatic-number-iii,true,Hard,303,189,Algorithms,42.3%,248,true,Array;String;Recursion;,false,false,42.294925427428154,37206,87968
249,"Group Shifted Strings",group-shifted-strings,true,Medium,1715,411,Algorithms,66.7%,249,true,Array;Hash Table;String;,true,true,66.66839270919635,270374,405551
250,"Count Univalue Subtrees",count-univalue-subtrees,true,Medium,1213,442,Algorithms,56.8%,250,true,Tree;Depth-First Search;Binary Tree;,true,false,56.834301371426946,159302,280292
251,"Flatten 2D Vector",flatten-2d-vector,true,Medium,727,409,Algorithms,49.9%,251,true,Array;Two Pointers;Design;Iterator;,true,false,49.85716742819111,133341,267446
252,"Meeting Rooms",meeting-rooms,true,Easy,2063,108,Algorithms,58.6%,252,true,Array;Sorting;,true,true,58.62564462823112,440628,751596
253,"Meeting Rooms II",meeting-rooms-ii,true,Medium,7038,168,Algorithms,51.8%,253,true,Array;Two Pointers;Greedy;Sorting;Heap (Priority Queue);Prefix Sum;,true,true,51.77983240167693,985495,1903241
254,"Factor Combinations",factor-combinations,true,Medium,1151,75,Algorithms,50.0%,254,true,Backtracking;,true,false,50.02911705808759,133161,266167
255,"Verify Preorder Sequence in Binary Search Tree",verify-preorder-sequence-in-binary-search-tree,true,Medium,1222,90,Algorithms,50.5%,255,true,Array;Stack;Tree;Binary Search Tree;Recursion;Monotonic Stack;Binary Tree;,true,false,50.503190237990566,85010,168326
256,"Paint House",paint-house,true,Medium,2323,132,Algorithms,63.2%,256,true,Array;Dynamic Programming;,true,false,63.20983557788025,220973,349586
257,"Binary Tree Paths",binary-tree-paths,false,Easy,6752,313,Algorithms,65.4%,257,false,String;Backtracking;Tree;Depth-First Search;Binary Tree;,true,false,65.4012118393344,809960,1238448
258,"Add Digits",add-digits,false,Easy,4973,1946,Algorithms,67.4%,258,false,Math;Simulation;Number Theory;,true,false,67.412673343404,901900,1337879
259,"3Sum Smaller",3sum-smaller,true,Medium,1580,165,Algorithms,50.9%,259,true,Array;Two Pointers;Binary Search;Sorting;,true,false,50.916716520092265,159157,312583
260,"Single Number III",single-number-iii,false,Medium,6462,267,Algorithms,70.8%,260,false,Array;Bit Manipulation;,true,false,70.77864954486903,495619,700237
261,"Graph Valid Tree",graph-valid-tree,true,Medium,3334,107,Algorithms,48.8%,261,true,Depth-First Search;Breadth-First Search;Union Find;Graph;,true,false,48.81583922954686,446662,914994
262,"Trips and Users",trips-and-users,false,Hard,1281,676,Database,36.8%,262,false,Database;,true,false,36.785535949137405,209217,568748
263,"Ugly Number",ugly-number,false,Easy,3505,1739,Algorithms,42.2%,263,false,Math;,true,false,42.19771710757573,591825,1402504
264,"Ugly Number II",ugly-number-ii,false,Medium,6603,407,Algorithms,49.1%,264,false,Hash Table;Math;Dynamic Programming;Heap (Priority Queue);,true,false,49.13808583228587,470678,957868
265,"Paint House II",paint-house-ii,true,Hard,1327,39,Algorithms,55.8%,265,true,Array;Dynamic Programming;,true,false,55.83233128704934,132331,237015
266,"Palindrome Permutation",palindrome-permutation,true,Easy,1075,73,Algorithms,68.0%,266,true,Hash Table;String;Bit Manipulation;,true,false,68.01085801515232,216973,319027
267,"Palindrome Permutation II",palindrome-permutation-ii,true,Medium,888,97,Algorithms,42.0%,267,true,Hash Table;String;Backtracking;,true,false,41.955856122798764,72214,172119
268,"Missing Number",missing-number,false,Easy,12626,3369,Algorithms,68.8%,268,false,Array;Hash Table;Math;Binary Search;Bit Manipulation;Sorting;,true,true,68.81829523481375,2702341,3926777
269,"Alien Dictionary",alien-dictionary,true,Hard,4506,1013,Algorithms,36.3%,269,true,Array;String;Depth-First Search;Breadth-First Search;Graph;Topological Sort;,true,false,36.279702436069705,416877,1149064
270,"Closest Binary Search Tree Value",closest-binary-search-tree-value,true,Easy,1843,153,Algorithms,50.5%,270,true,Binary Search;Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,false,50.46169552508483,386525,765977
271,"Encode and Decode Strings",encode-and-decode-strings,true,Medium,1502,429,Algorithms,48.5%,271,true,Array;String;Design;,true,false,48.47761924106884,233889,482468
272,"Closest Binary Search Tree Value II",closest-binary-search-tree-value-ii,true,Hard,1307,48,Algorithms,59.8%,272,true,Two Pointers;Stack;Tree;Depth-First Search;Binary Search Tree;Heap (Priority Queue);Binary Tree;,true,false,59.7768736431991,124737,208671
273,"Integer to English Words",integer-to-english-words,false,Hard,3671,6752,Algorithms,34.2%,273,false,Math;String;Recursion;,true,false,34.167217250285304,523340,1531702
274,"H-Index",h-index,false,Medium,1508,706,Algorithms,39.7%,274,false,Array;Sorting;Counting Sort;,true,false,39.71708531039465,624004,1571124
275,"H-Index II",h-index-ii,false,Medium,401,115,Algorithms,38.6%,275,false,Array;Binary Search;,true,false,38.594321442336515,225304,583775
276,"Paint Fence",paint-fence,true,Medium,1591,391,Algorithms,47.4%,276,true,Dynamic Programming;,true,false,47.350453783111895,119424,252213
277,"Find the Celebrity",find-the-celebrity,true,Medium,2912,302,Algorithms,48.0%,277,true,Two Pointers;Graph;Interactive;,true,true,48.0206571775584,290209,604342
278,"First Bad Version",first-bad-version,false,Easy,8541,3349,Algorithms,45.3%,278,false,Binary Search;Interactive;,true,true,45.30196262058463,1834322,4049113
279,"Perfect Squares",perfect-squares,false,Medium,11387,480,Algorithms,55.3%,279,false,Math;Dynamic Programming;Breadth-First Search;,true,false,55.28228755125535,916241,1657387
280,"Wiggle Sort",wiggle-sort,true,Medium,1220,103,Algorithms,68.0%,280,true,Array;Greedy;Sorting;,true,true,68.0153196954408,148287,218020
281,"Zigzag Iterator",zigzag-iterator,true,Medium,688,40,Algorithms,64.9%,281,true,Array;Design;Queue;Iterator;,true,false,64.87273772279879,99326,153109
282,"Expression Add Operators",expression-add-operators,false,Hard,3504,658,Algorithms,40.8%,282,false,Math;String;Backtracking;,true,false,40.754773587279466,252669,619974
283,"Move Zeroes",move-zeroes,false,Easy,17316,497,Algorithms,62.4%,283,false,Array;Two Pointers;,true,true,62.37171815115757,3607290,5783528
284,"Peeking Iterator",peeking-iterator,false,Medium,1870,1042,Algorithms,60.2%,284,false,Array;Design;Iterator;,true,false,60.17799327360124,230105,382374
285,"Inorder Successor in BST",inorder-successor-in-bst,true,Medium,2590,93,Algorithms,50.4%,285,true,Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,false,50.36637346147093,347050,689051
286,"Walls and Gates",walls-and-gates,true,Medium,3193,68,Algorithms,62.3%,286,true,Array;Breadth-First Search;Matrix;,true,false,62.27623057792224,354074,568554
287,"Find the Duplicate Number",find-the-duplicate-number,false,Medium,23826,4967,Algorithms,62.0%,287,false,Array;Two Pointers;Binary Search;Bit Manipulation;,true,false,62.031893299510884,1987605,3204169
288,"Unique Word Abbreviation",unique-word-abbreviation,true,Medium,208,1836,Algorithms,26.8%,288,true,Array;Hash Table;String;Design;,true,false,26.759011158097103,75998,284009
289,"Game of Life",game-of-life,false,Medium,6491,587,Algorithms,70.6%,289,false,Array;Matrix;Simulation;,true,true,70.56418087045505,529586,750503
290,"Word Pattern",word-pattern,false,Easy,7460,1072,Algorithms,42.6%,290,false,Hash Table;String;,true,false,42.649330587023684,854742,2004125
291,"Word Pattern II",word-pattern-ii,true,Medium,928,75,Algorithms,48.5%,291,true,Hash Table;String;Backtracking;,true,false,48.48420244744809,79597,164171
292,"Nim Game",nim-game,false,Easy,1779,2710,Algorithms,57.6%,292,false,Math;Brainteaser;Game Theory;,true,false,57.64457278359979,422005,732083
293,"Flip Game",flip-game,true,Easy,230,468,Algorithms,64.8%,293,true,String;,true,false,64.80575465726945,75767,116914
294,"Flip Game II",flip-game-ii,true,Medium,623,65,Algorithms,52.2%,294,true,Math;Dynamic Programming;Backtracking;Memoization;Game Theory;,false,false,52.18488539657731,72788,139481
295,"Find Median from Data Stream",find-median-from-data-stream,false,Hard,12257,258,Algorithms,52.7%,295,false,Two Pointers;Design;Sorting;Heap (Priority Queue);Data Stream;,true,false,52.70840481167615,910999,1728376
296,"Best Meeting Point",best-meeting-point,true,Hard,1191,105,Algorithms,61.1%,296,true,Array;Math;Sorting;Matrix;,true,false,61.136234580992976,89361,146167
297,"Serialize and Deserialize Binary Tree",serialize-and-deserialize-binary-tree,false,Hard,10392,402,Algorithms,58.0%,297,false,String;Tree;Depth-First Search;Breadth-First Search;Design;Binary Tree;,true,false,58.00860200561032,964063,1661930
298,"Binary Tree Longest Consecutive Sequence",binary-tree-longest-consecutive-sequence,true,Medium,1149,238,Algorithms,53.9%,298,true,Tree;Depth-First Search;Binary Tree;,true,false,53.895326734346185,153108,284084
299,"Bulls and Cows",bulls-and-cows,false,Medium,2496,1792,Algorithms,50.9%,299,false,Hash Table;String;Counting;,true,false,50.912686007453814,395752,777318
300,"Longest Increasing Subsequence",longest-increasing-subsequence,false,Medium,21409,467,Algorithms,56.8%,300,false,Array;Binary Search;Dynamic Programming;,true,false,56.84968937657815,1973351,3471183
301,"Remove Invalid Parentheses",remove-invalid-parentheses,false,Hard,5925,293,Algorithms,48.8%,301,false,String;Backtracking;Breadth-First Search;,true,false,48.769591430234485,456637,936315
302,"Smallest Rectangle Enclosing Black Pixels",smallest-rectangle-enclosing-black-pixels,true,Hard,532,101,Algorithms,59.3%,302,true,Array;Binary Search;Depth-First Search;Breadth-First Search;Matrix;,true,false,59.31274728063396,51420,86693
303,"Range Sum Query - Immutable",range-sum-query-immutable,false,Easy,3366,1942,Algorithms,66.4%,303,false,Array;Design;Prefix Sum;,true,true,66.40173433271971,629432,947915
304,"Range Sum Query 2D - Immutable",range-sum-query-2d-immutable,false,Medium,5051,351,Algorithms,55.7%,304,false,Array;Design;Matrix;Prefix Sum;,true,true,55.65721974839876,394594,708975
305,"Number of Islands II",number-of-islands-ii,true,Hard,1890,73,Algorithms,40.0%,305,true,Array;Hash Table;Union Find;,true,false,39.95465976751512,154742,387294
306,"Additive Number",additive-number,false,Medium,1202,810,Algorithms,32.1%,306,false,String;Backtracking;,false,false,32.120365940578594,98694,307263
307,"Range Sum Query - Mutable",range-sum-query-mutable,false,Medium,4842,258,Algorithms,41.4%,307,false,Array;Design;Binary Indexed Tree;Segment Tree;,true,false,41.44774873145353,290382,700598
308,"Range Sum Query 2D - Mutable",range-sum-query-2d-mutable,true,Medium,809,94,Algorithms,44.6%,308,true,Array;Design;Binary Indexed Tree;Segment Tree;Matrix;,true,true,44.55295126723138,79474,178381
309,"Best Time to Buy and Sell Stock with Cooldown",best-time-to-buy-and-sell-stock-with-cooldown,false,Medium,9572,329,Algorithms,59.5%,309,false,Array;Dynamic Programming;,true,false,59.54614104645544,589020,989188
310,"Minimum Height Trees",minimum-height-trees,false,Medium,8453,394,Algorithms,41.9%,310,false,Depth-First Search;Breadth-First Search;Graph;Topological Sort;,true,false,41.91025812629346,407044,971229
311,"Sparse Matrix Multiplication",sparse-matrix-multiplication,true,Medium,1079,363,Algorithms,68.4%,311,true,Array;Hash Table;Matrix;,true,false,68.43664890974803,199770,291905
312,"Burst Balloons",burst-balloons,false,Hard,9191,264,Algorithms,60.3%,312,false,Array;Dynamic Programming;,true,false,60.31329431714935,327924,543702
313,"Super Ugly Number",super-ugly-number,false,Medium,2207,398,Algorithms,45.4%,313,false,Array;Math;Dynamic Programming;,false,false,45.379908579558176,137796,303650
314,"Binary Tree Vertical Order Traversal",binary-tree-vertical-order-traversal,true,Medium,3328,342,Algorithms,56.1%,314,true,Hash Table;Tree;Depth-First Search;Breadth-First Search;Sorting;Binary Tree;,true,false,56.121168647681166,489766,872695
315,"Count of Smaller Numbers After Self",count-of-smaller-numbers-after-self,false,Hard,8934,244,Algorithms,42.7%,315,false,Array;Binary Search;Divide and Conquer;Binary Indexed Tree;Segment Tree;Merge Sort;Ordered Set;,true,false,42.66653953804638,340091,797091
316,"Remove Duplicate Letters",remove-duplicate-letters,false,Medium,8803,645,Algorithms,50.5%,316,false,String;Stack;Greedy;Monotonic Stack;,true,false,50.533457902558666,360771,713925
317,"Shortest Distance from All Buildings",shortest-distance-from-all-buildings,true,Hard,1893,313,Algorithms,43.7%,317,true,Array;Breadth-First Search;Matrix;,true,false,43.6752766164721,189193,433180
318,"Maximum Product of Word Lengths",maximum-product-of-word-lengths,false,Medium,3553,142,Algorithms,60.3%,318,false,Array;String;Bit Manipulation;,true,false,60.33341005839041,228044,377973
319,"Bulb Switcher",bulb-switcher,false,Medium,2739,3148,Algorithms,53.5%,319,false,Math;Brainteaser;,true,false,53.50573605510864,241641,451617
320,"Generalized Abbreviation",generalized-abbreviation,true,Medium,707,232,Algorithms,59.9%,320,true,String;Backtracking;Bit Manipulation;,true,false,59.88197214411822,73262,122344
321,"Create Maximum Number",create-maximum-number,false,Hard,1992,359,Algorithms,31.4%,321,false,Array;Two Pointers;Stack;Greedy;Monotonic Stack;,false,false,31.41168432481,67123,213688
322,"Coin Change",coin-change,false,Medium,19459,483,Algorithms,45.4%,322,false,Array;Dynamic Programming;Breadth-First Search;,true,true,45.424849765447334,2108725,4642228
323,"Number of Connected Components in an Undirected Graph",number-of-connected-components-in-an-undirected-graph,true,Medium,2712,105,Algorithms,63.5%,323,true,Depth-First Search;Breadth-First Search;Union Find;Graph;,true,true,63.545256181972675,446447,702565
324,"Wiggle Sort II",wiggle-sort-ii,false,Medium,3120,970,Algorithms,35.1%,324,false,Array;Divide and Conquer;Greedy;Sorting;Quickselect;,false,false,35.07905502524601,171319,488385
325,"Maximum Size Subarray Sum Equals k",maximum-size-subarray-sum-equals-k,true,Medium,2073,64,Algorithms,50.1%,325,true,Array;Hash Table;Prefix Sum;,true,false,50.08391513658474,199643,398617
326,"Power of Three",power-of-three,false,Easy,3172,283,Algorithms,47.4%,326,false,Math;Recursion;,true,false,47.3928400157203,941803,1987232
327,"Count of Range Sum",count-of-range-sum,false,Hard,2370,251,Algorithms,36.4%,327,false,Array;Binary Search;Divide and Conquer;Binary Indexed Tree;Segment Tree;Merge Sort;Ordered Set;,false,false,36.36989772712506,83958,230850
328,"Odd Even Linked List",odd-even-linked-list,false,Medium,10388,547,Algorithms,61.7%,328,false,Linked List;,true,false,61.743876316795486,1103134,1786629
329,"Longest Increasing Path in a Matrix",longest-increasing-path-in-a-matrix,false,Hard,9105,140,Algorithms,54.6%,329,false,Array;Dynamic Programming;Depth-First Search;Breadth-First Search;Graph;Topological Sort;Memoization;Matrix;,true,false,54.61440942606524,585887,1072770
330,"Patching Array",patching-array,false,Hard,2339,198,Algorithms,53.3%,330,false,Array;Greedy;,true,false,53.27344290854251,163906,307669
331,"Verify Preorder Serialization of a Binary Tree",verify-preorder-serialization-of-a-binary-tree,false,Medium,2366,126,Algorithms,45.7%,331,false,String;Stack;Tree;Binary Tree;,true,false,45.73015882776134,148739,325256
332,"Reconstruct Itinerary",reconstruct-itinerary,false,Hard,6028,1890,Algorithms,43.4%,332,false,Depth-First Search;Graph;Eulerian Circuit;,false,false,43.3749761542506,466113,1074614
333,"Largest BST Subtree",largest-bst-subtree,true,Medium,1518,136,Algorithms,44.9%,333,true,Dynamic Programming;Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,false,44.927536231884055,117893,262407
334,"Increasing Triplet Subsequence",increasing-triplet-subsequence,false,Medium,8326,599,Algorithms,39.2%,334,false,Array;Greedy;,true,false,39.24483774496477,704424,1794931
335,"Self Crossing",self-crossing,false,Hard,395,515,Algorithms,31.3%,335,false,Array;Math;Geometry;,false,false,31.310633283263762,37729,120499
336,"Palindrome Pairs",palindrome-pairs,false,Hard,4515,469,Algorithms,35.9%,336,false,Array;Hash Table;String;Trie;,true,false,35.85130725703193,216996,605272
337,"House Robber III",house-robber-iii,false,Medium,8664,145,Algorithms,54.6%,337,false,Dynamic Programming;Tree;Depth-First Search;Binary Tree;,true,false,54.60783601075816,413181,756632
338,"Counting Bits",counting-bits,false,Easy,11324,561,Algorithms,79.2%,338,false,Dynamic Programming;Bit Manipulation;,true,false,79.16162476751968,1264557,1597439
339,"Nested List Weight Sum",nested-list-weight-sum,true,Medium,1787,448,Algorithms,84.9%,339,true,Depth-First Search;Breadth-First Search;,true,true,84.88881642481783,338419,398662
340,"Longest Substring with At Most K Distinct Characters",longest-substring-with-at-most-k-distinct-characters,true,Medium,2861,79,Algorithms,49.2%,340,true,Hash Table;String;Sliding Window;,true,true,49.20916162489196,364383,740479
341,"Flatten Nested List Iterator",flatten-nested-list-iterator,false,Medium,4942,1768,Algorithms,65.0%,341,false,Stack;Tree;Depth-First Search;Design;Queue;Iterator;,true,false,64.99319646106682,475731,731971
342,"Power of Four",power-of-four,false,Easy,3989,401,Algorithms,48.8%,342,false,Math;Bit Manipulation;Recursion;,true,false,48.808440396503926,746018,1528460
343,"Integer Break",integer-break,false,Medium,5190,452,Algorithms,60.8%,343,false,Math;Dynamic Programming;,true,false,60.796821532297486,380564,625959
344,"Reverse String",reverse-string,false,Easy,8826,1186,Algorithms,79.3%,344,false,Two Pointers;String;,true,true,79.31448984353268,2971189,3746085
345,"Reverse Vowels of a String",reverse-vowels-of-a-string,false,Easy,4785,2818,Algorithms,56.0%,345,false,Two Pointers;String;,true,true,55.98296556356861,1104225,1972444
346,"Moving Average from Data Stream",moving-average-from-data-stream,true,Easy,1692,182,Algorithms,79.3%,346,true,Array;Design;Queue;Data Stream;,true,true,79.33143111999527,442905,558297
347,"Top K Frequent Elements",top-k-frequent-elements,false,Medium,17855,692,Algorithms,63.8%,347,false,Array;Hash Table;Divide and Conquer;Sorting;Heap (Priority Queue);Bucket Sort;Counting;Quickselect;,true,true,63.77534293282975,2528825,3965208
348,"Design Tic-Tac-Toe",design-tic-tac-toe,true,Medium,2104,117,Algorithms,58.3%,348,true,Array;Hash Table;Design;Matrix;Simulation;,true,false,58.34675161400672,267783,458951
349,"Intersection of Two Arrays",intersection-of-two-arrays,false,Easy,6267,2311,Algorithms,75.7%,349,false,Array;Hash Table;Two Pointers;Binary Search;Sorting;,true,false,75.71104014985164,1393645,1840745
350,"Intersection of Two Arrays II",intersection-of-two-arrays-ii,false,Easy,7812,984,Algorithms,58.8%,350,false,Array;Hash Table;Two Pointers;Binary Search;Sorting;,true,false,58.802403206394985,1479452,2515972
351,"Android Unlock Patterns",android-unlock-patterns,true,Medium,192,219,Algorithms,53.1%,351,true,Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,true,false,53.083713809777514,78712,148279
352,"Data Stream as Disjoint Intervals",data-stream-as-disjoint-intervals,false,Hard,1763,366,Algorithms,60.2%,352,false,Binary Search;Design;Ordered Set;,true,false,60.230089887051555,114916,190793
353,"Design Snake Game",design-snake-game,true,Medium,958,339,Algorithms,39.0%,353,true,Array;Hash Table;Design;Queue;Simulation;,true,false,38.984293329978875,89874,230539
354,"Russian Doll Envelopes",russian-doll-envelopes,false,Hard,6128,153,Algorithms,37.1%,354,false,Array;Binary Search;Dynamic Programming;Sorting;,true,false,37.125263657127164,237966,640982
355,"Design Twitter",design-twitter,false,Medium,4102,572,Algorithms,41.3%,355,false,Hash Table;Linked List;Design;Heap (Priority Queue);,false,false,41.28769568289145,222069,537859
356,"Line Reflection",line-reflection,true,Medium,305,630,Algorithms,35.8%,356,true,Array;Hash Table;Math;,false,false,35.83951082631822,42787,119385
357,"Count Numbers with Unique Digits",count-numbers-with-unique-digits,false,Medium,1584,1503,Algorithms,53.6%,357,false,Math;Dynamic Programming;Backtracking;,false,false,53.62525479758774,152322,284049
358,"Rearrange String k Distance Apart",rearrange-string-k-distance-apart,true,Hard,973,39,Algorithms,39.2%,358,true,Hash Table;String;Greedy;Sorting;Heap (Priority Queue);Counting;,true,false,39.19753618441844,68219,174039
359,"Logger Rate Limiter",logger-rate-limiter,true,Easy,1758,191,Algorithms,76.3%,359,true,Hash Table;Design;Data Stream;,true,true,76.2519812795263,345895,453621
360,"Sort Transformed Array",sort-transformed-array,true,Medium,686,216,Algorithms,56.5%,360,true,Array;Math;Two Pointers;Sorting;,true,false,56.48269964478359,68692,121616
361,"Bomb Enemy",bomb-enemy,true,Medium,976,116,Algorithms,52.0%,361,true,Array;Dynamic Programming;Matrix;,true,false,51.98972627111517,80360,154569
362,"Design Hit Counter",design-hit-counter,true,Medium,2057,238,Algorithms,68.9%,362,true,Array;Binary Search;Design;Queue;Data Stream;,true,false,68.92937333618126,264623,383905
363,"Max Sum of Rectangle No Larger Than K",max-sum-of-rectangle-no-larger-than-k,false,Hard,3489,175,Algorithms,44.4%,363,false,Array;Binary Search;Matrix;Prefix Sum;Ordered Set;,true,false,44.36868093110745,130203,293457
364,"Nested List Weight Sum II",nested-list-weight-sum-ii,true,Medium,1142,468,Algorithms,64.5%,364,true,Stack;Depth-First Search;Breadth-First Search;,true,false,64.54355382017351,144473,223838
365,"Water and Jug Problem",water-and-jug-problem,false,Medium,1556,1490,Algorithms,42.2%,365,false,Math;Depth-First Search;Breadth-First Search;,false,false,42.17193183435061,115592,274097
366,"Find Leaves of Binary Tree",find-leaves-of-binary-tree,true,Medium,3252,62,Algorithms,80.9%,366,true,Tree;Depth-First Search;Binary Tree;,true,true,80.86048212138243,267611,330954
367,"Valid Perfect Square",valid-perfect-square,false,Easy,4358,314,Algorithms,44.0%,367,false,Math;Binary Search;,true,false,43.976609717660295,705713,1604745
368,"Largest Divisible Subset",largest-divisible-subset,false,Medium,6070,285,Algorithms,45.8%,368,false,Array;Math;Dynamic Programming;Sorting;,true,false,45.772814057047924,326768,713892
369,"Plus One Linked List",plus-one-linked-list,true,Medium,947,47,Algorithms,61.1%,369,true,Linked List;Math;,true,true,61.12925701730456,82909,135629
370,"Range Addition",range-addition,true,Medium,1651,84,Algorithms,72.0%,370,true,Array;Prefix Sum;,true,false,71.98849946045026,97397,135296
371,"Sum of Two Integers",sum-of-two-integers,false,Medium,4348,5632,Algorithms,52.9%,371,false,Math;Bit Manipulation;,true,false,52.891947795918206,545167,1030718
372,"Super Pow",super-pow,false,Medium,978,1454,Algorithms,35.1%,372,false,Math;Divide and Conquer;,false,false,35.10787249031349,79736,227118
373,"Find K Pairs with Smallest Sums",find-k-pairs-with-smallest-sums,false,Medium,6458,463,Algorithms,40.3%,373,false,Array;Heap (Priority Queue);,true,false,40.291888092324655,342776,850734
374,"Guess Number Higher or Lower",guess-number-higher-or-lower,false,Easy,3877,586,Algorithms,54.8%,374,false,Binary Search;Interactive;,true,true,54.805575777725544,764863,1395589
375,"Guess Number Higher or Lower II",guess-number-higher-or-lower-ii,false,Medium,2205,2144,Algorithms,50.4%,375,false,Math;Dynamic Programming;Game Theory;,true,false,50.35337453262474,136149,270390
376,"Wiggle Subsequence",wiggle-subsequence,false,Medium,5182,166,Algorithms,48.7%,376,false,Array;Dynamic Programming;Greedy;,true,false,48.678414920506725,260374,534885
377,"Combination Sum IV",combination-sum-iv,false,Medium,7494,674,Algorithms,54.4%,377,false,Array;Dynamic Programming;,true,false,54.44281198429232,523227,961056
378,"Kth Smallest Element in a Sorted Matrix",kth-smallest-element-in-a-sorted-matrix,false,Medium,10092,363,Algorithms,63.1%,378,false,Array;Binary Search;Sorting;Heap (Priority Queue);Matrix;,true,false,63.05810074617718,668798,1060606
379,"Design Phone Directory",design-phone-directory,true,Medium,356,476,Algorithms,52.1%,379,true,Array;Hash Table;Linked List;Design;Queue;,true,false,52.103129976678005,69031,132491
380,"Insert Delete GetRandom O(1)",insert-delete-getrandom-o1,false,Medium,9450,651,Algorithms,54.8%,380,false,Array;Hash Table;Math;Design;Randomized;,true,false,54.8012151360888,1071002,1954339
381,"Insert Delete GetRandom O(1) - Duplicates allowed",insert-delete-getrandom-o1-duplicates-allowed,false,Hard,2331,152,Algorithms,35.7%,381,false,Array;Hash Table;Math;Design;Randomized;,true,false,35.71217470394307,155879,436487
382,"Linked List Random Node",linked-list-random-node,false,Medium,3124,712,Algorithms,63.7%,382,false,Linked List;Math;Reservoir Sampling;Randomized;,true,false,63.65708440304103,256380,402754
383,"Ransom Note",ransom-note,false,Easy,5191,515,Algorithms,63.4%,383,false,Hash Table;String;Counting;,true,true,63.41451397479756,1428640,2252854
384,"Shuffle an Array",shuffle-an-array,false,Medium,1369,938,Algorithms,58.7%,384,false,Array;Math;Design;Randomized;,true,false,58.71716761890826,353117,601387
385,"Mini Parser",mini-parser,false,Medium,465,1428,Algorithms,39.3%,385,false,String;Stack;Depth-First Search;,false,false,39.31047308780053,61298,155933
386,"Lexicographical Numbers",lexicographical-numbers,false,Medium,2689,188,Algorithms,72.9%,386,false,Depth-First Search;Trie;,true,false,72.85441668417855,256547,352138
387,"First Unique Character in a String",first-unique-character-in-a-string,false,Easy,9119,307,Algorithms,62.9%,387,false,Hash Table;String;Queue;Counting;,true,true,62.948987101989594,1878217,2983714
388,"Longest Absolute File Path",longest-absolute-file-path,false,Medium,1318,2523,Algorithms,48.0%,388,false,String;Stack;Depth-First Search;,false,false,47.97926309075908,163994,341804
389,"Find the Difference",find-the-difference,false,Easy,5117,492,Algorithms,59.5%,389,false,Hash Table;String;Bit Manipulation;Sorting;,true,false,59.53676421767027,833913,1400664
390,"Elimination Game",elimination-game,false,Medium,1611,721,Algorithms,45.4%,390,false,Math;Recursion;,false,false,45.36068205724409,81935,180630
391,"Perfect Rectangle",perfect-rectangle,false,Hard,898,119,Algorithms,34.5%,391,false,Array;Line Sweep;,false,false,34.459367109550904,47903,139013
392,"Is Subsequence",is-subsequence,false,Easy,9977,561,Algorithms,48.1%,392,false,Two Pointers;String;Dynamic Programming;,true,false,48.14336869773909,1819835,3780027
393,"UTF-8 Validation",utf-8-validation,false,Medium,920,2866,Algorithms,45.3%,393,false,Array;Bit Manipulation;,true,false,45.29469482021473,127871,282309
394,"Decode String",decode-string,false,Medium,13053,640,Algorithms,60.4%,394,false,String;Stack;Recursion;,true,false,60.38460364338785,929686,1539607
395,"Longest Substring with At Least K Repeating Characters",longest-substring-with-at-least-k-repeating-characters,false,Medium,6364,534,Algorithms,45.3%,395,false,Hash Table;String;Divide and Conquer;Sliding Window;,true,false,45.285069233193816,247116,545690
396,"Rotate Function",rotate-function,false,Medium,1590,271,Algorithms,43.3%,396,false,Array;Math;Dynamic Programming;,false,false,43.31697459584296,93030,214767
397,"Integer Replacement",integer-replacement,false,Medium,1355,481,Algorithms,36.2%,397,false,Dynamic Programming;Greedy;Bit Manipulation;Memoization;,false,false,36.23827607717816,132447,365491
398,"Random Pick Index",random-pick-index,false,Medium,1327,1292,Algorithms,64.2%,398,false,Hash Table;Math;Reservoir Sampling;Randomized;,true,false,64.15254173944025,257482,401358
399,"Evaluate Division",evaluate-division,false,Medium,9549,984,Algorithms,62.5%,399,false,Array;String;Depth-First Search;Breadth-First Search;Union Find;Graph;Shortest Path;,true,false,62.5292022211482,544669,871065
400,"Nth Digit",nth-digit,false,Medium,1123,2080,Algorithms,35.3%,400,false,Math;Binary Search;,false,false,35.26722286191409,104747,297013
401,"Binary Watch",binary-watch,false,Easy,1447,2654,Algorithms,55.7%,401,false,Backtracking;Bit Manipulation;,false,false,55.67474220223827,157005,282004
402,"Remove K Digits",remove-k-digits,false,Medium,9742,506,Algorithms,34.2%,402,false,String;Stack;Greedy;Monotonic Stack;,true,false,34.213364501452226,545627,1594784
403,"Frog Jump",frog-jump,false,Hard,5670,258,Algorithms,46.3%,403,false,Array;Dynamic Programming;,true,false,46.32140941669782,285011,615290
404,"Sum of Left Leaves",sum-of-left-leaves,false,Easy,5565,313,Algorithms,61.2%,404,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,61.22572539308248,672477,1098361
405,"Convert a Number to Hexadecimal",convert-a-number-to-hexadecimal,false,Easy,1341,223,Algorithms,49.9%,405,false,Math;Bit Manipulation;,false,false,49.92452841649381,164382,329262
406,"Queue Reconstruction by Height",queue-reconstruction-by-height,false,Medium,7133,729,Algorithms,73.9%,406,false,Array;Binary Indexed Tree;Segment Tree;Sorting;,true,false,73.90123971100715,315762,427276
407,"Trapping Rain Water II",trapping-rain-water-ii,false,Hard,3808,99,Algorithms,48.7%,407,false,Array;Breadth-First Search;Heap (Priority Queue);Matrix;,false,false,48.659757150840825,95776,196829
408,"Valid Word Abbreviation",valid-word-abbreviation,true,Easy,813,2317,Algorithms,36.5%,408,true,Two Pointers;String;,false,false,36.46090053662381,261860,718193
409,"Longest Palindrome",longest-palindrome,false,Easy,6021,421,Algorithms,55.4%,409,false,Hash Table;String;Greedy;,true,false,55.40437787501834,864901,1561071
410,"Split Array Largest Sum",split-array-largest-sum,false,Hard,10185,237,Algorithms,57.0%,410,false,Array;Binary Search;Dynamic Programming;Greedy;Prefix Sum;,true,false,57.0050461685144,420915,738382
411,"Minimum Unique Word Abbreviation",minimum-unique-word-abbreviation,true,Hard,182,146,Algorithms,39.9%,411,true,Array;String;Backtracking;Bit Manipulation;,false,false,39.938951559389515,15047,37675
412,"Fizz Buzz",fizz-buzz,false,Easy,2893,404,Algorithms,73.6%,412,false,Math;String;Simulation;,true,true,73.55421111053936,1400810,1904460
413,"Arithmetic Slices",arithmetic-slices,false,Medium,5411,300,Algorithms,64.9%,413,false,Array;Dynamic Programming;Sliding Window;,true,false,64.91397489607232,321983,496016
414,"Third Maximum Number",third-maximum-number,false,Easy,3152,3276,Algorithms,36.3%,414,false,Array;Sorting;,true,false,36.26467588931421,620909,1712158
415,"Add Strings",add-strings,false,Easy,5148,773,Algorithms,51.6%,415,false,Math;String;Simulation;,true,false,51.63568419184627,753612,1459478
416,"Partition Equal Subset Sum",partition-equal-subset-sum,false,Medium,12617,260,Algorithms,47.0%,416,false,Array;Dynamic Programming;,true,true,47.018217548507145,999616,2126016
417,"Pacific Atlantic Water Flow",pacific-atlantic-water-flow,false,Medium,7621,1549,Algorithms,56.5%,417,false,Array;Depth-First Search;Breadth-First Search;Matrix;,true,false,56.54856018823998,545055,963871
418,"Sentence Screen Fitting",sentence-screen-fitting,true,Medium,1123,543,Algorithms,36.3%,418,true,Array;String;Dynamic Programming;,false,false,36.287502139984696,103861,286217
419,"Battleships in a Board",battleships-in-a-board,false,Medium,2355,988,Algorithms,76.0%,419,false,Array;Depth-First Search;Matrix;,false,false,76.02900163600681,228179,300121
420,"Strong Password Checker",strong-password-checker,false,Hard,901,1741,Algorithms,14.2%,420,false,String;Greedy;Heap (Priority Queue);,false,false,14.23681305733669,45915,322515
421,"Maximum XOR of Two Numbers in an Array",maximum-xor-of-two-numbers-in-an-array,false,Medium,5633,408,Algorithms,53.3%,421,false,Array;Hash Table;Bit Manipulation;Trie;,true,false,53.25522535261476,179271,336625
422,"Valid Word Square",valid-word-square,true,Easy,436,270,Algorithms,41.7%,422,true,Array;Matrix;,true,false,41.68469695755536,62422,149748
423,"Reconstruct Original Digits from English",reconstruct-original-digits-from-english,false,Medium,841,2755,Algorithms,51.3%,423,false,Hash Table;Math;String;,true,false,51.344349994879245,85227,165991
424,"Longest Repeating Character Replacement",longest-repeating-character-replacement,false,Medium,11232,599,Algorithms,56.0%,424,false,Hash Table;String;Sliding Window;,true,false,55.970694514749184,957548,1710803
425,"Word Squares",word-squares,true,Hard,1100,73,Algorithms,53.7%,425,true,Array;String;Backtracking;Trie;,true,false,53.71221045734321,77055,143459
758,"Convert Binary Search Tree to Sorted Doubly Linked List",convert-binary-search-tree-to-sorted-doubly-linked-list,true,Medium,2655,228,Algorithms,65.3%,426,true,Linked List;Stack;Tree;Depth-First Search;Binary Search Tree;Binary Tree;Doubly-Linked List;,true,false,65.25704400867683,331218,507559
772,"Construct Quad Tree",construct-quad-tree,false,Medium,1586,1868,Algorithms,76.4%,427,false,Array;Divide and Conquer;Tree;Matrix;,true,false,76.38009712036549,146120,191307
765,"Serialize and Deserialize N-ary Tree",serialize-and-deserialize-n-ary-tree,true,Hard,1054,57,Algorithms,67.8%,428,true,String;Tree;Depth-First Search;Breadth-First Search;,true,false,67.82761433705454,92291,136067
764,"N-ary Tree Level Order Traversal",n-ary-tree-level-order-traversal,false,Medium,3664,137,Algorithms,71.1%,429,false,Tree;Breadth-First Search;,true,false,71.09540359037341,326490,459228
766,"Flatten a Multilevel Doubly Linked List",flatten-a-multilevel-doubly-linked-list,false,Medium,5133,332,Algorithms,60.7%,430,false,Linked List;Depth-First Search;Doubly-Linked List;,true,false,60.71955732223893,353774,582636
771,"Encode N-ary Tree to Binary Tree",encode-n-ary-tree-to-binary-tree,true,Hard,524,29,Algorithms,79.9%,431,true,Tree;Depth-First Search;Breadth-First Search;Design;Binary Tree;,true,false,79.89503149055284,22834,28580
432,"All O`one Data Structure",all-oone-data-structure,false,Hard,2080,202,Algorithms,45.0%,432,false,Hash Table;Linked List;Design;Doubly-Linked List;,true,false,45.02989955171161,164836,366057
433,"Minimum Genetic Mutation",minimum-genetic-mutation,false,Medium,3064,332,Algorithms,54.8%,433,false,Hash Table;String;Breadth-First Search;,true,false,54.824653422203575,203826,371773
434,"Number of Segments in a String",number-of-segments-in-a-string,false,Easy,816,1292,Algorithms,36.3%,434,false,String;,true,false,36.259613031323575,210379,580202
435,"Non-overlapping Intervals",non-overlapping-intervals,false,Medium,8417,228,Algorithms,54.6%,435,false,Array;Dynamic Programming;Greedy;Sorting;,true,false,54.61155513091688,695046,1272711
436,"Find Right Interval",find-right-interval,false,Medium,2207,372,Algorithms,53.1%,436,false,Array;Binary Search;Sorting;,false,false,53.133527511606815,127146,239297
437,"Path Sum III",path-sum-iii,false,Medium,11259,536,Algorithms,46.0%,437,false,Tree;Depth-First Search;Binary Tree;,true,false,46.049923353829726,641659,1393407
438,"Find All Anagrams in a String",find-all-anagrams-in-a-string,false,Medium,12569,346,Algorithms,51.6%,438,false,Hash Table;String;Sliding Window;,true,false,51.62510215251681,956417,1852617
439,"Ternary Expression Parser",ternary-expression-parser,true,Medium,500,72,Algorithms,61.5%,439,true,String;Stack;Recursion;,true,false,61.53792073117146,35012,56895
440,"K-th Smallest in Lexicographical Order",k-th-smallest-in-lexicographical-order,false,Hard,1306,127,Algorithms,41.9%,440,false,Trie;,true,false,41.94307119367554,96295,229585
441,"Arranging Coins",arranging-coins,false,Easy,3998,1346,Algorithms,47.1%,441,false,Math;Binary Search;,true,false,47.067462582415395,496428,1054717
442,"Find All Duplicates in an Array",find-all-duplicates-in-an-array,false,Medium,10634,414,Algorithms,76.1%,442,false,Array;Hash Table;,true,false,76.13510067555673,856291,1124700
443,"String Compression",string-compression,false,Medium,5378,8254,Algorithms,56.7%,443,false,Two Pointers;String;,true,false,56.70523032078398,745451,1314613
444,"Sequence Reconstruction",sequence-reconstruction,true,Medium,579,1524,Algorithms,28.9%,444,true,Array;Graph;Topological Sort;,false,false,28.908625021767794,58102,200985
445,"Add Two Numbers II",add-two-numbers-ii,false,Medium,5963,292,Algorithms,61.6%,445,false,Linked List;Math;Stack;,true,false,61.55688855759749,506226,822371
446,"Arithmetic Slices II - Subsequence",arithmetic-slices-ii-subsequence,false,Hard,3382,159,Algorithms,54.6%,446,false,Array;Dynamic Programming;,true,false,54.57462299775403,154784,283619
447,"Number of Boomerangs",number-of-boomerangs,false,Medium,856,1024,Algorithms,56.0%,447,false,Array;Hash Table;Math;,false,false,55.97282686695689,105300,188127
448,"Find All Numbers Disappeared in an Array",find-all-numbers-disappeared-in-an-array,false,Easy,9615,508,Algorithms,61.7%,448,false,Array;Hash Table;,true,false,61.713419586281184,994663,1611745
449,"Serialize and Deserialize BST",serialize-and-deserialize-bst,false,Medium,3518,174,Algorithms,58.2%,449,false,String;Tree;Depth-First Search;Breadth-First Search;Design;Binary Search Tree;Binary Tree;,true,false,58.1747176499425,246821,424283
450,"Delete Node in a BST",delete-node-in-a-bst,false,Medium,9464,312,Algorithms,52.3%,450,false,Tree;Binary Search Tree;Binary Tree;,true,false,52.334110847037394,616766,1178517
451,"Sort Characters By Frequency",sort-characters-by-frequency,false,Medium,8504,299,Algorithms,73.4%,451,false,Hash Table;String;Sorting;Heap (Priority Queue);Bucket Sort;Counting;,true,false,73.39717340638026,837056,1140447
452,"Minimum Number of Arrows to Burst Balloons",minimum-number-of-arrows-to-burst-balloons,false,Medium,7616,251,Algorithms,59.7%,452,false,Array;Greedy;Sorting;,true,false,59.720597765098226,604551,1012297
453,"Minimum Moves to Equal Array Elements",minimum-moves-to-equal-array-elements,false,Medium,2658,1901,Algorithms,57.4%,453,false,Array;Math;,true,false,57.36831487051573,187676,327143
454,"4Sum II",4sum-ii,false,Medium,4959,145,Algorithms,57.4%,454,false,Array;Hash Table;,true,false,57.401192022109015,344786,600660
455,"Assign Cookies",assign-cookies,false,Easy,4210,391,Algorithms,53.3%,455,false,Array;Two Pointers;Greedy;Sorting;,true,false,53.321127986136,583357,1094045
456,"132 Pattern",132-pattern,false,Medium,7327,442,Algorithms,33.8%,456,false,Array;Binary Search;Stack;Monotonic Stack;Ordered Set;,true,true,33.7913668976468,275377,814929
457,"Circular Array Loop",circular-array-loop,false,Medium,713,823,Algorithms,34.9%,457,false,Array;Hash Table;Two Pointers;,false,false,34.94030276159108,88262,252608
458,"Poor Pigs",poor-pigs,false,Hard,1810,3363,Algorithms,59.4%,458,false,Math;Dynamic Programming;Combinatorics;,true,false,59.365956645039105,122881,206989
459,"Repeated Substring Pattern",repeated-substring-pattern,false,Easy,6516,538,Algorithms,46.5%,459,false,String;String Matching;,true,false,46.46204869337505,495370,1066175
460,"LFU Cache",lfu-cache,false,Hard,5830,336,Algorithms,45.4%,460,false,Hash Table;Linked List;Design;Doubly-Linked List;,true,false,45.449842617112814,280265,616648
461,"Hamming Distance",hamming-distance,false,Easy,3891,222,Algorithms,75.8%,461,false,Bit Manipulation;,true,false,75.76358612602836,607353,801643
462,"Minimum Moves to Equal Array Elements II",minimum-moves-to-equal-array-elements-ii,false,Medium,3402,127,Algorithms,60.4%,462,false,Array;Math;Sorting;,true,false,60.44997758517633,194174,321215
463,"Island Perimeter",island-perimeter,false,Easy,6936,400,Algorithms,73.2%,463,false,Array;Depth-First Search;Breadth-First Search;Matrix;,true,false,73.2074176775691,686944,938353
464,"Can I Win",can-i-win,false,Medium,2714,411,Algorithms,30.0%,464,false,Math;Dynamic Programming;Bit Manipulation;Memoization;Game Theory;Bitmask;,false,false,29.997321329785066,103027,343453
465,"Optimal Account Balancing",optimal-account-balancing,true,Hard,1485,156,Algorithms,49.7%,465,true,Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,true,false,49.66734800208408,99140,199608
466,"Count The Repetitions",count-the-repetitions,false,Hard,413,363,Algorithms,31.1%,466,false,String;Dynamic Programming;,true,false,31.11340358116572,21112,67855
467,"Unique Substrings in Wraparound String",unique-substrings-in-wraparound-string,false,Medium,1467,182,Algorithms,40.6%,467,false,String;Dynamic Programming;,false,false,40.58412002697235,48149,118640
468,"Validate IP Address",validate-ip-address,false,Medium,1059,2726,Algorithms,27.6%,468,false,String;,true,false,27.621962742771462,178318,645566
469,"Convex Polygon",convex-polygon,true,Medium,100,240,Algorithms,39.8%,469,true,Array;Math;Geometry;,false,false,39.76402028849959,11054,27799
903,"Implement Rand10() Using Rand7()",implement-rand10-using-rand7,false,Medium,1121,379,Algorithms,45.9%,470,false,Math;Rejection Sampling;Randomized;Probability and Statistics;,true,false,45.85299386843633,90860,198155
471,"Encode String with Shortest Length",encode-string-with-shortest-length,true,Hard,629,54,Algorithms,50.5%,471,true,String;Dynamic Programming;,false,false,50.473948929584736,31310,62032
472,"Concatenated Words",concatenated-words,false,Hard,3931,284,Algorithms,49.3%,472,false,Array;String;Dynamic Programming;Depth-First Search;Trie;,true,false,49.31614966820018,237440,481465
473,"Matchsticks to Square",matchsticks-to-square,false,Medium,3885,304,Algorithms,40.6%,473,false,Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,true,false,40.601268619679246,179160,441267
474,"Ones and Zeroes",ones-and-zeroes,false,Medium,5526,469,Algorithms,48.3%,474,false,Array;String;Dynamic Programming;,true,false,48.2895261620801,225204,466361
475,"Heaters",heaters,false,Medium,2178,1174,Algorithms,39.0%,475,false,Array;Two Pointers;Binary Search;Sorting;,false,false,39.02946928157012,132321,339030
476,"Number Complement",number-complement,false,Easy,3097,137,Algorithms,70.3%,476,false,Bit Manipulation;,true,false,70.28855741494576,487099,692998
477,"Total Hamming Distance",total-hamming-distance,false,Medium,2241,92,Algorithms,53.3%,477,false,Array;Math;Bit Manipulation;,true,false,53.26620813968837,117020,219689
915,"Generate Random Point in a Circle",generate-random-point-in-a-circle,false,Medium,463,774,Algorithms,40.4%,478,false,Math;Geometry;Rejection Sampling;Randomized;,true,false,40.39590318284113,43977,108865
479,"Largest Palindrome Product",largest-palindrome-product,false,Hard,178,1561,Algorithms,34.3%,479,false,Math;Enumeration;,false,false,34.27643366288138,26592,77581
480,"Sliding Window Median",sliding-window-median,false,Hard,3299,213,Algorithms,38.7%,480,false,Array;Hash Table;Sliding Window;Heap (Priority Queue);,true,false,38.715987123717525,167055,431489
481,"Magical String",magical-string,false,Medium,334,1333,Algorithms,51.8%,481,false,Two Pointers;String;,false,false,51.84004894899871,40668,78449
482,"License Key Formatting",license-key-formatting,false,Easy,1132,1427,Algorithms,44.3%,482,false,String;,true,false,44.31721631259937,304089,686162
483,"Smallest Good Base",smallest-good-base,false,Hard,403,520,Algorithms,42.3%,483,false,Math;Binary Search;,false,false,42.25183256833596,24670,58388
484,"Find Permutation",find-permutation,true,Medium,709,148,Algorithms,67.0%,484,true,Array;String;Stack;Greedy;,true,false,66.98507855989988,40672,60718
485,"Max Consecutive Ones",max-consecutive-ones,false,Easy,6022,462,Algorithms,61.3%,485,false,Array;,true,false,61.27540219750149,1451005,2368019
486,"Predict the Winner",predict-the-winner,false,Medium,5930,286,Algorithms,55.5%,486,false,Array;Math;Dynamic Programming;Recursion;Game Theory;,true,true,55.49249351141506,251866,453874
487,"Max Consecutive Ones II",max-consecutive-ones-ii,true,Medium,1558,27,Algorithms,50.9%,487,true,Array;Dynamic Programming;Sliding Window;,true,false,50.85185566744791,157954,310616
488,"Zuma Game",zuma-game,false,Hard,464,497,Algorithms,32.1%,488,false,String;Dynamic Programming;Stack;Breadth-First Search;Memoization;,false,false,32.05173906401181,25176,78548
865,"Robot Room Cleaner",robot-room-cleaner,true,Hard,2803,178,Algorithms,77.0%,489,true,Backtracking;Interactive;,true,false,77.0368692500697,176852,229568
490,"The Maze",the-maze,true,Medium,1866,187,Algorithms,58.9%,490,true,Array;Depth-First Search;Breadth-First Search;Matrix;,true,false,58.88215552480476,185099,314355
491,"Non-decreasing Subsequences",non-decreasing-subsequences,false,Medium,3687,230,Algorithms,61.3%,491,false,Array;Hash Table;Backtracking;Bit Manipulation;,true,false,61.29359754441245,180516,294511
492,"Construct the Rectangle",construct-the-rectangle,false,Easy,722,392,Algorithms,59.5%,492,false,Math;,false,false,59.49275848946791,132886,223365
493,"Reverse Pairs",reverse-pairs,false,Hard,6366,276,Algorithms,31.5%,493,false,Array;Binary Search;Divide and Conquer;Binary Indexed Tree;Segment Tree;Merge Sort;Ordered Set;,true,false,31.49705559752998,228866,726624
494,"Target Sum",target-sum,false,Medium,11612,387,Algorithms,50.1%,494,false,Array;Dynamic Programming;Backtracking;,true,false,50.05328541680244,806424,1611133
495,"Teemo Attacking",teemo-attacking,false,Easy,1205,133,Algorithms,56.8%,495,false,Array;Simulation;,true,false,56.80552055285114,171298,301556
496,"Next Greater Element I",next-greater-element-i,false,Easy,8460,858,Algorithms,73.6%,496,false,Array;Hash Table;Stack;Monotonic Stack;,true,false,73.60044758274327,902433,1226127
914,"Random Point in Non-overlapping Rectangles",random-point-in-non-overlapping-rectangles,false,Medium,494,678,Algorithms,40.6%,497,false,Array;Math;Binary Search;Reservoir Sampling;Prefix Sum;Ordered Set;Randomized;,true,false,40.61460275675478,44433,109402
498,"Diagonal Traverse",diagonal-traverse,false,Medium,3560,710,Algorithms,61.9%,498,false,Array;Matrix;Simulation;,true,false,61.942383523443375,351398,567300
499,"The Maze III",the-maze-iii,true,Hard,492,73,Algorithms,49.8%,499,true,Array;String;Depth-First Search;Breadth-First Search;Graph;Heap (Priority Queue);Matrix;Shortest Path;,true,false,49.76838659710958,34058,68433
500,"Keyboard Row",keyboard-row,false,Easy,1665,1142,Algorithms,71.8%,500,false,Array;Hash Table;String;,false,false,71.75690565016527,259853,362130
501,"Find Mode in Binary Search Tree",find-mode-in-binary-search-tree,false,Easy,3961,795,Algorithms,57.0%,501,false,Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,false,56.98825201051325,333693,585546
502,"IPO",ipo,false,Hard,3900,268,Algorithms,53.0%,502,false,Array;Greedy;Sorting;Heap (Priority Queue);,true,false,53.023483717266096,251051,473471
503,"Next Greater Element II",next-greater-element-ii,false,Medium,8251,203,Algorithms,65.2%,503,false,Array;Stack;Monotonic Stack;,true,false,65.22682851016526,495229,759244
504,"Base 7",base-7,false,Easy,826,234,Algorithms,51.2%,504,false,Math;,false,false,51.21012563008137,152492,297778
505,"The Maze II",the-maze-ii,true,Medium,1341,59,Algorithms,53.8%,505,true,Array;Depth-First Search;Breadth-First Search;Graph;Heap (Priority Queue);Matrix;Shortest Path;,true,false,53.83706588156346,113923,211607
506,"Relative Ranks",relative-ranks,false,Easy,1971,133,Algorithms,72.7%,506,false,Array;Sorting;Heap (Priority Queue);,true,false,72.66274846287561,326884,449865
507,"Perfect Number",perfect-number,false,Easy,1127,1254,Algorithms,43.3%,507,false,Math;,true,false,43.333139838625414,238880,551264
508,"Most Frequent Subtree Sum",most-frequent-subtree-sum,false,Medium,2293,322,Algorithms,67.4%,508,false,Hash Table;Tree;Depth-First Search;Binary Tree;,true,false,67.44706786443014,152715,226422
1013,"Fibonacci Number",fibonacci-number,false,Easy,8439,378,Algorithms,72.2%,509,false,Math;Dynamic Programming;Recursion;Memoization;,true,false,72.21465009275393,2154254,2983131
509,"Inorder Successor in BST II",inorder-successor-in-bst-ii,true,Medium,871,42,Algorithms,60.9%,510,true,Tree;Binary Search Tree;Binary Tree;,true,false,60.89095791668139,68931,113204
1179,"Game Play Analysis I",game-play-analysis-i,false,Easy,897,32,Database,75.3%,511,false,Database;,true,false,75.25732626354304,330840,439612
1180,"Game Play Analysis II",game-play-analysis-ii,true,Easy,270,43,Database,53.5%,512,true,Database;,true,false,53.49640518938025,93233,174279
513,"Find Bottom Left Tree Value",find-bottom-left-tree-value,false,Medium,3848,298,Algorithms,71.5%,513,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,71.50732153072369,385001,538402
514,"Freedom Trail",freedom-trail,false,Hard,1508,81,Algorithms,58.9%,514,false,String;Dynamic Programming;Depth-First Search;Breadth-First Search;,true,false,58.8979171435111,113223,192236
515,"Find Largest Value in Each Tree Row",find-largest-value-in-each-tree-row,false,Medium,4002,127,Algorithms,66.4%,515,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,66.42428551735146,457750,689130
516,"Longest Palindromic Subsequence",longest-palindromic-subsequence,false,Medium,9752,332,Algorithms,63.4%,516,false,String;Dynamic Programming;,true,false,63.4499442884121,565464,891197
517,"Super Washing Machines",super-washing-machines,false,Hard,783,218,Algorithms,41.8%,517,false,Array;Greedy;,true,false,41.763410209898936,32233,77180
518,"Coin Change II",coin-change-ii,false,Medium,9588,187,Algorithms,63.7%,518,false,Array;Dynamic Programming;,true,false,63.6672659215063,733085,1151431
913,"Random Flip Matrix",random-flip-matrix,false,Medium,439,131,Algorithms,42.8%,519,false,Hash Table;Math;Reservoir Sampling;Randomized;,true,false,42.83048323135172,23869,55729
520,"Detect Capital",detect-capital,false,Easy,3446,463,Algorithms,56.2%,520,false,String;,true,false,56.20240994124923,465298,827899
521,"Longest Uncommon Subsequence I",longest-uncommon-subsequence-i,false,Easy,64,206,Algorithms,61.1%,521,false,String;,true,false,61.07594628070962,125245,205065
522,"Longest Uncommon Subsequence II",longest-uncommon-subsequence-ii,false,Medium,524,1331,Algorithms,42.5%,522,false,Array;Hash Table;Two Pointers;String;Sorting;,false,false,42.4547148714126,56953,134150
523,"Continuous Subarray Sum",continuous-subarray-sum,false,Medium,6449,671,Algorithms,30.6%,523,false,Array;Hash Table;Math;Prefix Sum;,true,false,30.593468202857377,631682,2064757
524,"Longest Word in Dictionary through Deleting",longest-word-in-dictionary-through-deleting,false,Medium,1819,359,Algorithms,51.5%,524,false,Array;Two Pointers;String;Sorting;,true,false,51.502497572024666,162802,316106
525,"Contiguous Array",contiguous-array,false,Medium,8147,410,Algorithms,48.9%,525,false,Array;Hash Table;Prefix Sum;,true,false,48.9351093045103,516210,1054887
526,"Beautiful Arrangement",beautiful-arrangement,false,Medium,3275,373,Algorithms,64.4%,526,false,Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,true,false,64.39420735790547,187514,291197
527,"Word Abbreviation",word-abbreviation,true,Hard,391,293,Algorithms,61.4%,527,true,Array;String;Greedy;Trie;Sorting;,true,false,61.426138782460626,28858,46980
912,"Random Pick with Weight",random-pick-with-weight,false,Medium,2021,934,Algorithms,47.9%,528,false,Array;Math;Binary Search;Prefix Sum;Randomized;,true,false,47.86425911001721,549373,1147774
529,"Minesweeper",minesweeper,false,Medium,2003,1075,Algorithms,67.5%,529,false,Array;Depth-First Search;Breadth-First Search;Matrix;,false,false,67.51638605864811,173879,257535
530,"Minimum Absolute Difference in BST",minimum-absolute-difference-in-bst,false,Easy,4502,237,Algorithms,58.6%,530,false,Tree;Depth-First Search;Breadth-First Search;Binary Search Tree;Binary Tree;,true,false,58.59458166986112,460702,786253
531,"Lonely Pixel I",lonely-pixel-i,true,Medium,439,41,Algorithms,62.4%,531,true,Array;Hash Table;Matrix;,true,true,62.386826697078014,44857,71902
532,"K-diff Pairs in an Array",k-diff-pairs-in-an-array,false,Medium,3947,2267,Algorithms,43.9%,532,false,Array;Hash Table;Two Pointers;Binary Search;Sorting;,true,false,43.907057454136904,368915,840218
533,"Lonely Pixel II",lonely-pixel-ii,true,Medium,87,780,Algorithms,48.7%,533,true,Array;Hash Table;Matrix;,false,false,48.69175180662846,13678,28091
1181,"Game Play Analysis III",game-play-analysis-iii,true,Medium,407,17,Database,81.0%,534,true,Database;,true,false,81.01793542466048,82981,102423
535,"Encode and Decode TinyURL",encode-and-decode-tinyurl,false,Medium,2056,3795,Algorithms,86.6%,535,false,Hash Table;String;Design;Hash Function;,true,false,86.58154312411592,274828,317421
536,"Construct Binary Tree from String",construct-binary-tree-from-string,true,Medium,1094,175,Algorithms,57.7%,536,true,String;Stack;Tree;Depth-First Search;Binary Tree;,true,false,57.74642557906971,106828,184995
537,"Complex Number Multiplication",complex-number-multiplication,false,Medium,723,1251,Algorithms,72.2%,537,false,Math;String;Simulation;,true,false,72.15564123960522,100305,139012
538,"Convert BST to Greater Tree",convert-bst-to-greater-tree,false,Medium,5278,175,Algorithms,70.1%,538,false,Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,false,70.06947094861268,317613,453283
539,"Minimum Time Difference",minimum-time-difference,false,Medium,2514,314,Algorithms,62.2%,539,false,Array;Math;String;Sorting;,true,false,62.17849333327964,308805,496644
540,"Single Element in a Sorted Array",single-element-in-a-sorted-array,false,Medium,11635,204,Algorithms,59.2%,540,false,Array;Binary Search;,true,false,59.24230192851545,802108,1353944
541,"Reverse String II",reverse-string-ii,false,Easy,2062,3972,Algorithms,51.5%,541,false,Two Pointers;String;,true,false,51.47564002449012,280813,545526
542,"01 Matrix",01-matrix,false,Medium,9809,427,Algorithms,50.1%,542,false,Array;Dynamic Programming;Breadth-First Search;Matrix;,true,false,50.114124836706985,660198,1317402
543,"Diameter of Binary Tree",diameter-of-binary-tree,false,Easy,14327,1105,Algorithms,62.2%,543,false,Tree;Depth-First Search;Binary Tree;,true,false,62.23950437594965,1800278,2892503
544,"Output Contest Matches",output-contest-matches,true,Medium,391,137,Algorithms,77.3%,544,true,String;Recursion;Simulation;,true,false,77.28377811932374,27656,35785
545,"Boundary of Binary Tree",boundary-of-binary-tree,true,Medium,1360,2252,Algorithms,46.4%,545,true,Tree;Depth-First Search;Binary Tree;,true,false,46.44976848714465,147367,317261
546,"Remove Boxes",remove-boxes,false,Hard,2339,126,Algorithms,48.1%,546,false,Array;Dynamic Programming;Memoization;,true,false,48.10716976812949,50437,104843
547,"Number of Provinces",number-of-provinces,false,Medium,10087,383,Algorithms,67.7%,547,false,Depth-First Search;Breadth-First Search;Union Find;Graph;,true,false,67.66478599993327,1074918,1588591
548,"Split Array with Equal Sum",split-array-with-equal-sum,true,Hard,414,131,Algorithms,50.2%,548,true,Array;Hash Table;Prefix Sum;,true,false,50.173138758347754,24342,48516
549,"Binary Tree Longest Consecutive Sequence II",binary-tree-longest-consecutive-sequence-ii,true,Medium,1168,96,Algorithms,49.5%,549,true,Tree;Depth-First Search;Binary Tree;,true,false,49.53826208954163,55789,112618
1182,"Game Play Analysis IV",game-play-analysis-iv,false,Medium,1066,215,Database,38.6%,550,false,Database;,true,false,38.55263736880678,254080,659047
551,"Student Attendance Record I",student-attendance-record-i,false,Easy,799,55,Algorithms,49.4%,551,false,String;,true,false,49.37589147429187,241971,490059
552,"Student Attendance Record II",student-attendance-record-ii,false,Hard,2313,288,Algorithms,55.5%,552,false,Dynamic Programming;,true,false,55.4848372838023,144103,259716
553,"Optimal Division",optimal-division,false,Medium,389,1614,Algorithms,61.4%,553,false,Array;Math;Dynamic Programming;,true,false,61.38953284158764,43694,71175
554,"Brick Wall",brick-wall,false,Medium,2579,179,Algorithms,55.7%,554,false,Array;Hash Table;,true,true,55.6645479138716,151853,272801
555,"Split Concatenated Strings",split-concatenated-strings,true,Medium,77,262,Algorithms,43.4%,555,true,Array;String;Greedy;,false,false,43.36435924304999,7035,16223
556,"Next Greater Element III",next-greater-element-iii,false,Medium,3759,480,Algorithms,34.4%,556,false,Math;Two Pointers;String;,true,false,34.35011957663246,171066,498007
557,"Reverse Words in a String III",reverse-words-in-a-string-iii,false,Easy,6001,250,Algorithms,83.4%,557,false,Two Pointers;String;,true,false,83.44315835015615,970111,1162602
773,"Logical OR of Two Binary Grids Represented as Quad-Trees",logical-or-of-two-binary-grids-represented-as-quad-trees,false,Medium,191,473,Algorithms,50.5%,558,false,Divide and Conquer;Tree;,false,false,50.51383897610491,16024,31722
774,"Maximum Depth of N-ary Tree",maximum-depth-of-n-ary-tree,false,Easy,2802,89,Algorithms,72.6%,559,false,Tree;Depth-First Search;Breadth-First Search;,true,false,72.61896854391043,306118,421540
560,"Subarray Sum Equals K",subarray-sum-equals-k,false,Medium,22412,708,Algorithms,44.6%,560,false,Array;Hash Table;Prefix Sum;,true,true,44.583304517826,1534305,3441433
561,"Array Partition",array-partition,false,Easy,2136,277,Algorithms,79.8%,561,false,Array;Greedy;Sorting;Counting Sort;,true,false,79.78590098630892,533574,668757
562,"Longest Line of Consecutive One in Matrix",longest-line-of-consecutive-one-in-matrix,true,Medium,894,118,Algorithms,50.5%,562,true,Array;Dynamic Programming;Matrix;,true,false,50.485418104643884,78263,155021
563,"Binary Tree Tilt",binary-tree-tilt,false,Easy,2279,2202,Algorithms,63.2%,563,false,Tree;Depth-First Search;Binary Tree;,true,false,63.18576216621463,229243,362808
564,"Find the Closest Palindrome",find-the-closest-palindrome,false,Hard,1251,1704,Algorithms,31.6%,564,false,Math;String;,true,false,31.61254251502586,122130,386333
565,"Array Nesting",array-nesting,false,Medium,2225,156,Algorithms,56.1%,565,false,Array;Depth-First Search;,true,false,56.082566767411414,136201,242858
566,"Reshape the Matrix",reshape-the-matrix,false,Easy,3564,422,Algorithms,63.6%,566,false,Array;Matrix;Simulation;,true,false,63.56626044229132,404657,636592
567,"Permutation in String",permutation-in-string,false,Medium,12048,465,Algorithms,46.6%,567,false,Hash Table;Two Pointers;String;Sliding Window;,true,false,46.611304659210326,1114208,2390433
568,"Maximum Vacation Days",maximum-vacation-days,true,Hard,575,114,Algorithms,46.1%,568,true,Array;Dynamic Programming;Matrix;,true,false,46.06656937055694,39140,84964
569,"Median Employee Salary",median-employee-salary,true,Hard,331,154,Database,65.9%,569,true,Database;,true,false,65.90782059609953,43629,66197
570,"Managers with at Least 5 Direct Reports",managers-with-at-least-5-direct-reports,false,Medium,1317,148,Database,49.3%,570,false,Database;,true,false,49.34509145119375,547804,1110151
571,"Find Median Given Frequency of Numbers",find-median-given-frequency-of-numbers,true,Hard,309,79,Database,42.4%,571,true,Database;,false,false,42.446628261606236,31315,73775
572,"Subtree of Another Tree",subtree-of-another-tree,false,Easy,8388,541,Algorithms,49.2%,572,false,Tree;Depth-First Search;String Matching;Binary Tree;Hash Function;,true,false,49.17465828578201,979239,1991351
573,"Squirrel Simulation",squirrel-simulation,true,Medium,413,40,Algorithms,57.2%,573,true,Array;Math;,true,true,57.1559247447403,23119,40449
574,"Winning Candidate",winning-candidate,true,Medium,178,413,Database,61.4%,574,true,Database;,true,false,61.44272606252289,68771,111927
575,"Distribute Candies",distribute-candies,false,Easy,1580,1395,Algorithms,68.8%,575,false,Array;Hash Table;,true,false,68.77771822292151,318224,462684
576,"Out of Boundary Paths",out-of-boundary-paths,false,Medium,3914,294,Algorithms,48.1%,576,false,Dynamic Programming;,true,false,48.13746851413565,215186,447025
577,"Employee Bonus",employee-bonus,false,Easy,1143,247,Database,76.9%,577,false,Database;,true,false,76.85805864636492,587943,764977
578,"Get Highest Answer Rate Question",get-highest-answer-rate-question,true,Medium,132,916,Database,40.2%,578,true,Database;,true,false,40.2350083740917,60299,149867
579,"Find Cumulative Salary of an Employee",find-cumulative-salary-of-an-employee,true,Hard,242,404,Database,48.0%,579,true,Database;,true,false,48.00172221659406,37906,78968
580,"Count Student Number in Departments",count-student-number-in-departments,true,Medium,248,36,Database,59.5%,580,true,Database;,true,false,59.471137372234715,71159,119653
581,"Shortest Unsorted Continuous Subarray",shortest-unsorted-continuous-subarray,false,Medium,7817,267,Algorithms,37.2%,581,false,Array;Two Pointers;Stack;Greedy;Sorting;Monotonic Stack;,true,false,37.18198093579136,345797,930014
582,"Kill Process",kill-process,true,Medium,1118,21,Algorithms,69.9%,582,true,Array;Hash Table;Tree;Depth-First Search;Breadth-First Search;,true,true,69.88859383588687,90273,129167
583,"Delete Operation for Two Strings",delete-operation-for-two-strings,false,Medium,5880,89,Algorithms,63.0%,583,false,String;Dynamic Programming;,true,false,62.99930516350371,290137,460539
584,"Find Customer Referee",find-customer-referee,false,Easy,2342,383,Database,71.3%,584,false,Database;,true,false,71.34406264069946,1300942,1823477
585,"Investments in 2016",investments-in-2016,false,Medium,663,535,Database,49.5%,585,false,Database;,true,false,49.5481327837558,167932,338925
586,"Customer Placing the Largest Number of Orders",customer-placing-the-largest-number-of-orders,false,Easy,1025,81,Database,64.6%,586,false,Database;,true,false,64.55440540043779,309069,478774
587,"Erect the Fence",erect-the-fence,false,Hard,1485,645,Algorithms,52.0%,587,false,Array;Math;Geometry;,true,false,51.97458363068881,60448,116303
588,"Design In-Memory File System",design-in-memory-file-system,true,Hard,1515,171,Algorithms,48.1%,588,true,Hash Table;String;Design;Trie;Sorting;,true,false,48.05696426465385,114093,237411
775,"N-ary Tree Preorder Traversal",n-ary-tree-preorder-traversal,false,Easy,3185,203,Algorithms,75.9%,589,false,Stack;Tree;Depth-First Search;,true,false,75.94344071244763,450940,593784
776,"N-ary Tree Postorder Traversal",n-ary-tree-postorder-traversal,false,Easy,2690,119,Algorithms,80.5%,590,false,Stack;Tree;Depth-First Search;,true,false,80.49144158422449,385979,479528
591,"Tag Validator",tag-validator,false,Hard,173,651,Algorithms,38.9%,591,false,String;Stack;,true,false,38.93635248084092,16817,43191
592,"Fraction Addition and Subtraction",fraction-addition-and-subtraction,false,Medium,866,689,Algorithms,66.1%,592,false,Math;String;Simulation;,true,false,66.09557792787052,129663,196175
593,"Valid Square",valid-square,false,Medium,1073,910,Algorithms,44.1%,593,false,Math;Geometry;,true,false,44.130163184500354,114798,260135
594,"Longest Harmonious Subsequence",longest-harmonious-subsequence,false,Easy,2233,286,Algorithms,56.1%,594,false,Array;Hash Table;Sliding Window;Sorting;Counting;,true,false,56.09225480072436,183061,326357
595,"Big Countries",big-countries,false,Easy,2896,1337,Database,68.2%,595,false,Database;,true,false,68.1688888927169,1582915,2322034
596,"Classes More Than 5 Students",classes-more-than-5-students,false,Easy,1112,1079,Database,58.8%,596,false,Database;,true,false,58.82123674976696,543306,923659
597,"Friend Requests I: Overall Acceptance Rate",friend-requests-i-overall-acceptance-rate,true,Easy,309,770,Database,41.6%,597,true,Database;,true,false,41.583471699699444,79140,190316
598,"Range Addition II",range-addition-ii,false,Easy,964,977,Algorithms,56.8%,598,false,Array;Math;,true,false,56.784887612604564,111132,195707
599,"Minimum Index Sum of Two Lists",minimum-index-sum-of-two-lists,false,Easy,1997,408,Algorithms,57.0%,599,false,Array;Hash Table;String;,true,false,56.994315941502485,257289,451432
600,"Non-negative Integers without Consecutive Ones",non-negative-integers-without-consecutive-ones,false,Hard,1553,136,Algorithms,40.0%,600,false,Dynamic Programming;,true,false,39.990766215655974,42443,106132
601,"Human Traffic of Stadium",human-traffic-of-stadium,false,Hard,718,571,Database,49.3%,601,false,Database;,true,false,49.26033030221985,117878,239296
602,"Friend Requests II: Who Has the Most Friends",friend-requests-ii-who-has-the-most-friends,false,Medium,721,135,Database,59.5%,602,false,Database;,true,false,59.52732056537967,194569,326857
603,"Consecutive Available Seats",consecutive-available-seats,true,Easy,646,78,Database,65.6%,603,true,Database;,true,false,65.61219635160371,92401,140829
604,"Design Compressed String Iterator",design-compressed-string-iterator,true,Easy,443,162,Algorithms,40.0%,604,true,Array;String;Design;Iterator;,true,false,40.0108253177118,35482,88681
605,"Can Place Flowers",can-place-flowers,false,Easy,6813,1228,Algorithms,28.8%,605,false,Array;Greedy;,true,false,28.829302907126493,1014067,3517478
606,"Construct String from Binary Tree",construct-string-from-binary-tree,false,Medium,98,44,Algorithms,69.8%,606,false,String;Tree;Depth-First Search;Binary Tree;,true,false,69.75252623314789,330507,473828
607,"Sales Person",sales-person,false,Easy,1224,105,Database,65.8%,607,false,Database;,true,false,65.75525374672698,252633,384202
608,"Tree Node",tree-node,false,Medium,1268,127,Database,73.3%,608,false,Database;,true,false,73.31308931377684,179142,244351
609,"Find Duplicate File in System",find-duplicate-file-in-system,false,Medium,1528,1652,Algorithms,67.6%,609,false,Array;Hash Table;String;,true,false,67.58175856415566,156641,231780
610,"Triangle Judgement",triangle-judgement,false,Easy,651,188,Database,73.0%,610,false,Database;,true,false,73.03135435892162,269863,369517
611,"Valid Triangle Number",valid-triangle-number,false,Medium,3863,220,Algorithms,51.7%,611,false,Array;Two Pointers;Binary Search;Greedy;Sorting;,true,false,51.710740207072334,212808,411540
612,"Shortest Distance in a Plane",shortest-distance-in-a-plane,true,Medium,221,70,Database,61.3%,612,true,Database;,true,false,61.336548977817664,43744,71318
613,"Shortest Distance in a Line",shortest-distance-in-a-line,true,Easy,334,40,Database,80.0%,613,true,Database;,true,false,80.01837870576318,76628,95763
614,"Second Degree Follower",second-degree-follower,true,Medium,161,744,Database,39.4%,614,true,Database;,false,false,39.41781586734409,56481,143288
615,"Average Salary: Departments VS Company",average-salary-departments-vs-company,true,Hard,240,76,Database,56.3%,615,true,Database;,true,false,56.331410562229834,38965,69171
616,"Add Bold Tag in String",add-bold-tag-in-string,true,Medium,1097,197,Algorithms,50.6%,616,true,Array;Hash Table;String;Trie;String Matching;,true,false,50.56419958919789,96746,191333
617,"Merge Two Binary Trees",merge-two-binary-trees,false,Easy,8863,305,Algorithms,79.2%,617,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,79.2183605305478,813284,1026636
618,"Students Report By Geography",students-report-by-geography,true,Hard,190,170,Database,63.5%,618,true,Database;,true,false,63.54598787402735,25888,40739
619,"Biggest Single Number",biggest-single-number,false,Easy,717,184,Database,67.7%,619,false,Database;,true,false,67.7190408409066,309231,456642
620,"Not Boring Movies",not-boring-movies,false,Easy,1233,545,Database,74.6%,620,false,Database;,true,false,74.64335152578538,677251,907318
621,"Task Scheduler",task-scheduler,false,Medium,10823,2118,Algorithms,60.7%,621,false,Array;Hash Table;Greedy;Sorting;Heap (Priority Queue);Counting;,true,false,60.740456750046455,725613,1194613
860,"Design Circular Queue",design-circular-queue,false,Medium,3618,305,Algorithms,52.1%,622,false,Array;Linked List;Design;Queue;,true,false,52.13517592956944,355076,681065
623,"Add One Row to Tree",add-one-row-to-tree,false,Medium,3588,269,Algorithms,64.1%,623,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,64.06467951409108,283836,443046
624,"Maximum Distance in Arrays",maximum-distance-in-arrays,false,Medium,1434,113,Algorithms,45.7%,624,false,Array;Greedy;,true,false,45.72183116270196,182124,398340
625,"Minimum Factorization",minimum-factorization,true,Medium,130,112,Algorithms,33.7%,625,true,Math;Greedy;,true,true,33.710073710073715,11662,34595
626,"Exchange Seats",exchange-seats,false,Medium,1561,596,Database,71.7%,626,false,Database;,true,false,71.74923841590508,290869,405399
627,"Swap Salary",swap-salary,false,Easy,1760,567,Database,83.7%,627,false,Database;,true,false,83.70119899744846,444824,531443
628,"Maximum Product of Three Numbers",maximum-product-of-three-numbers,false,Easy,4298,689,Algorithms,45.2%,628,false,Array;Math;Sorting;,true,false,45.191673549110504,374821,829400
629,"K Inverse Pairs Array",k-inverse-pairs-array,false,Hard,2708,327,Algorithms,49.1%,629,false,Dynamic Programming;,true,false,49.14802608512727,133171,270959
630,"Course Schedule III",course-schedule-iii,false,Hard,3834,101,Algorithms,40.4%,630,false,Array;Greedy;Sorting;Heap (Priority Queue);,true,false,40.36440275590686,118168,292753
631,"Design Excel Sum Formula",design-excel-sum-formula,true,Hard,245,281,Algorithms,43.9%,631,true,Array;Graph;Design;Topological Sort;Matrix;,true,false,43.87738497213295,21571,49162
632,"Smallest Range Covering Elements from K Lists",smallest-range-covering-elements-from-k-lists,false,Hard,4106,95,Algorithms,69.8%,632,false,Array;Hash Table;Greedy;Sliding Window;Sorting;Heap (Priority Queue);,true,false,69.7964823691977,204565,293089
633,"Sum of Square Numbers",sum-of-square-numbers,false,Medium,3278,612,Algorithms,36.5%,633,false,Math;Two Pointers;Binary Search;,true,false,36.468485301201994,373965,1025448
634,"Find the Derangement of An Array",find-the-derangement-of-an-array,true,Medium,218,163,Algorithms,41.9%,634,true,Math;Dynamic Programming;Combinatorics;,true,false,41.851439249649616,11646,27827
635,"Design Log Storage System",design-log-storage-system,true,Medium,477,218,Algorithms,59.2%,635,true,Hash Table;String;Design;Ordered Set;,true,false,59.227495908346974,36188,61100
636,"Exclusive Time of Functions",exclusive-time-of-functions,false,Medium,2008,2852,Algorithms,63.6%,636,false,Array;Stack;,true,false,63.57115425429776,251607,395788
637,"Average of Levels in Binary Tree",average-of-levels-in-binary-tree,false,Easy,5360,339,Algorithms,73.6%,637,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,73.56403383982268,593124,806268
638,"Shopping Offers",shopping-offers,false,Medium,1545,770,Algorithms,51.8%,638,false,Array;Dynamic Programming;Backtracking;Bit Manipulation;Memoization;Bitmask;,true,false,51.80202806643016,66000,127409
639,"Decode Ways II",decode-ways-ii,false,Hard,1597,820,Algorithms,31.0%,639,false,String;Dynamic Programming;,true,false,30.9574305438494,78969,255089
640,"Solve the Equation",solve-the-equation,false,Medium,517,843,Algorithms,44.4%,640,false,Math;String;Simulation;,true,false,44.35545228352286,43141,97262
859,"Design Circular Deque",design-circular-deque,false,Medium,1597,101,Algorithms,64.6%,641,false,Array;Linked List;Design;Queue;,true,false,64.60037457072426,167981,260031
642,"Design Search Autocomplete System",design-search-autocomplete-system,true,Hard,2131,184,Algorithms,49.2%,642,true,String;Depth-First Search;Design;Trie;Sorting;Heap (Priority Queue);Data Stream;,true,false,49.21448467966574,150177,305149
643,"Maximum Average Subarray I",maximum-average-subarray-i,false,Easy,3690,344,Algorithms,44.3%,643,false,Array;Sliding Window;,true,false,44.312301821930575,669251,1510293
644,"Maximum Average Subarray II",maximum-average-subarray-ii,true,Hard,627,72,Algorithms,37.2%,644,true,Array;Binary Search;Prefix Sum;,true,true,37.16115372600743,21413,57622
645,"Set Mismatch",set-mismatch,false,Easy,4855,1179,Algorithms,44.7%,645,false,Array;Hash Table;Bit Manipulation;Sorting;,true,false,44.69167470122649,498300,1114974
646,"Maximum Length of Pair Chain",maximum-length-of-pair-chain,false,Medium,4676,135,Algorithms,60.4%,646,false,Array;Dynamic Programming;Greedy;Sorting;,true,false,60.40271713882232,261338,432660
647,"Palindromic Substrings",palindromic-substrings,false,Medium,10985,242,Algorithms,71.0%,647,false,Two Pointers;String;Dynamic Programming;,true,false,71.02108860419985,921483,1297478
648,"Replace Words",replace-words,false,Medium,2989,217,Algorithms,68.1%,648,false,Array;Hash Table;String;Trie;,true,false,68.11456394647375,285101,418561
649,"Dota2 Senate",dota2-senate,false,Medium,2510,1919,Algorithms,48.2%,649,false,String;Greedy;Queue;,true,false,48.22684743361439,196070,406561
650,"2 Keys Keyboard",2-keys-keyboard,false,Medium,4249,243,Algorithms,59.6%,650,false,Math;Dynamic Programming;,true,false,59.61624384533586,266859,447628
651,"4 Keys Keyboard",4-keys-keyboard,true,Medium,720,93,Algorithms,55.8%,651,true,Math;Dynamic Programming;,true,false,55.81498975135906,31315,56105
652,"Find Duplicate Subtrees",find-duplicate-subtrees,false,Medium,5915,486,Algorithms,59.8%,652,false,Hash Table;Tree;Depth-First Search;Binary Tree;,true,false,59.838401726666476,281125,469807
653,"Two Sum IV - Input is a BST",two-sum-iv-input-is-a-bst,false,Easy,6874,277,Algorithms,61.8%,653,false,Hash Table;Two Pointers;Tree;Depth-First Search;Breadth-First Search;Binary Search Tree;Binary Tree;,true,false,61.76278265702714,604500,978742
654,"Maximum Binary Tree",maximum-binary-tree,false,Medium,5274,344,Algorithms,85.8%,654,false,Array;Divide and Conquer;Stack;Tree;Monotonic Stack;Binary Tree;,true,false,85.7852156024013,315659,367965
655,"Print Binary Tree",print-binary-tree,false,Medium,508,458,Algorithms,65.1%,655,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,65.06516694987621,75432,115933
656,"Coin Path",coin-path,true,Hard,247,110,Algorithms,32.3%,656,true,Array;Dynamic Programming;,true,false,32.25735229179546,14610,45291
657,"Robot Return to Origin",robot-return-to-origin,false,Easy,2459,748,Algorithms,76.0%,657,false,String;Simulation;,true,false,75.99270664505673,465121,612061
658,"Find K Closest Elements",find-k-closest-elements,false,Medium,8436,743,Algorithms,48.2%,658,false,Array;Two Pointers;Binary Search;Sliding Window;Sorting;Heap (Priority Queue);,true,false,48.157391023079704,632751,1313923
659,"Split Array into Consecutive Subsequences",split-array-into-consecutive-subsequences,false,Medium,4468,809,Algorithms,51.3%,659,false,Array;Hash Table;Greedy;Heap (Priority Queue);,true,false,51.287561781739896,135313,263832
660,"Remove 9",remove-9,true,Hard,163,204,Algorithms,57.4%,660,true,Math;,true,false,57.36547612822256,10970,19123
661,"Image Smoother",image-smoother,false,Easy,1168,2941,Algorithms,67.9%,661,false,Array;Matrix;,true,false,67.90411058958303,176641,260133
662,"Maximum Width of Binary Tree",maximum-width-of-binary-tree,false,Medium,8999,1243,Algorithms,43.5%,662,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,43.510034363307206,438849,1008618
663,"Equal Tree Partition",equal-tree-partition,true,Medium,488,37,Algorithms,41.6%,663,true,Tree;Depth-First Search;Binary Tree;,true,false,41.57497275133648,32041,77068
664,"Strange Printer",strange-printer,false,Hard,2664,281,Algorithms,61.0%,664,false,String;Dynamic Programming;,true,false,60.97407967150475,149681,245483
665,"Non-decreasing Array",non-decreasing-array,false,Medium,5766,782,Algorithms,24.9%,665,false,Array;,true,false,24.941393808128424,274070,1098859
666,"Path Sum IV",path-sum-iv,true,Medium,422,518,Algorithms,62.6%,666,true,Array;Hash Table;Tree;Depth-First Search;Binary Tree;,true,false,62.55670103092783,39442,63050
667,"Beautiful Arrangement II",beautiful-arrangement-ii,false,Medium,797,1055,Algorithms,60.2%,667,false,Array;Math;,true,false,60.23816188979091,55948,92878
668,"Kth Smallest Number in Multiplication Table",kth-smallest-number-in-multiplication-table,false,Hard,2184,59,Algorithms,52.3%,668,false,Math;Binary Search;,true,false,52.339135667639916,70448,134599
669,"Trim a Binary Search Tree",trim-a-binary-search-tree,false,Medium,5907,262,Algorithms,66.3%,669,false,Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,true,66.34273883718946,310829,468520
670,"Maximum Swap",maximum-swap,false,Medium,4089,260,Algorithms,51.6%,670,false,Math;Greedy;,true,false,51.64745694647479,421840,816770
671,"Second Minimum Node In a Binary Tree",second-minimum-node-in-a-binary-tree,false,Easy,1889,1885,Algorithms,45.0%,671,false,Tree;Depth-First Search;Binary Tree;,true,false,44.99408371062748,207999,462282
672,"Bulb Switcher II",bulb-switcher-ii,false,Medium,175,228,Algorithms,50.0%,672,false,Math;Bit Manipulation;Depth-First Search;Breadth-First Search;,true,false,50.0366198855876,25278,50519
673,"Number of Longest Increasing Subsequence",number-of-longest-increasing-subsequence,false,Medium,6922,272,Algorithms,49.1%,673,false,Array;Dynamic Programming;Binary Indexed Tree;Segment Tree;,true,false,49.13905964320916,261234,531618
674,"Longest Continuous Increasing Subsequence",longest-continuous-increasing-subsequence,false,Easy,2371,183,Algorithms,50.7%,674,false,Array;,true,false,50.73787845967872,290450,572452
675,"Cut Off Trees for Golf Event",cut-off-trees-for-golf-event,false,Hard,1245,681,Algorithms,34.9%,675,false,Array;Breadth-First Search;Heap (Priority Queue);Matrix;,true,false,34.86187269748369,73622,211181
676,"Implement Magic Dictionary",implement-magic-dictionary,false,Medium,1418,211,Algorithms,57.9%,676,false,Hash Table;String;Depth-First Search;Design;Trie;,true,false,57.86621474460174,89802,155189
677,"Map Sum Pairs",map-sum-pairs,false,Medium,1673,160,Algorithms,56.9%,677,false,Hash Table;String;Design;Trie;,true,false,56.92072810548987,125269,220077
678,"Valid Parenthesis String",valid-parenthesis-string,false,Medium,6356,196,Algorithms,38.4%,678,false,String;Dynamic Programming;Stack;Greedy;,true,false,38.43360315029534,430412,1119881
679,"24 Game",24-game,false,Hard,1491,252,Algorithms,49.7%,679,false,Array;Math;Backtracking;,true,false,49.6696742711323,84280,169681
680,"Valid Palindrome II",valid-palindrome-ii,false,Easy,8427,467,Algorithms,42.1%,680,false,Two Pointers;String;Greedy;,true,false,42.07294058820066,871698,2071872
681,"Next Closest Time",next-closest-time,true,Medium,735,1070,Algorithms,46.8%,681,true,Hash Table;String;Backtracking;Enumeration;,true,false,46.84228034429706,112651,240490
682,"Baseball Game",baseball-game,false,Easy,2967,1923,Algorithms,77.8%,682,false,Array;Stack;Simulation;,true,false,77.83787671460239,422080,542255
683,"K Empty Slots",k-empty-slots,true,Hard,807,697,Algorithms,37.2%,683,true,Array;Binary Indexed Tree;Segment Tree;Queue;Sliding Window;Heap (Priority Queue);Ordered Set;Monotonic Queue;,true,false,37.21716097920205,62667,168382
684,"Redundant Connection",redundant-connection,false,Medium,6326,409,Algorithms,63.8%,684,false,Depth-First Search;Breadth-First Search;Union Find;Graph;,true,false,63.824376597043496,416124,651984
685,"Redundant Connection II",redundant-connection-ii,false,Hard,2374,320,Algorithms,34.8%,685,false,Depth-First Search;Breadth-First Search;Union Find;Graph;,true,false,34.80182822839211,76524,219885
686,"Repeated String Match",repeated-string-match,false,Medium,2624,989,Algorithms,36.0%,686,false,String;String Matching;,true,false,36.03155525282505,190962,529986
687,"Longest Univalue Path",longest-univalue-path,false,Medium,4280,673,Algorithms,42.2%,687,false,Tree;Depth-First Search;Binary Tree;,true,false,42.16194111232279,194859,462168
688,"Knight Probability in Chessboard",knight-probability-in-chessboard,false,Medium,3898,483,Algorithms,56.4%,688,false,Dynamic Programming;,true,false,56.413086053917816,165622,293587
689,"Maximum Sum of 3 Non-Overlapping Subarrays",maximum-sum-of-3-non-overlapping-subarrays,false,Hard,2505,152,Algorithms,59.3%,689,false,Array;Dynamic Programming;,true,false,59.32890244306692,143182,241336
690,"Employee Importance",employee-importance,false,Medium,2135,1342,Algorithms,67.8%,690,false,Array;Hash Table;Tree;Depth-First Search;Breadth-First Search;,true,false,67.78952196175815,224666,331417
691,"Stickers to Spell Word",stickers-to-spell-word,false,Hard,1260,122,Algorithms,49.7%,691,false,Array;String;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,true,false,49.68956093792974,84913,170887
692,"Top K Frequent Words",top-k-frequent-words,false,Medium,7756,354,Algorithms,58.7%,692,false,Hash Table;String;Trie;Sorting;Heap (Priority Queue);Bucket Sort;Counting;,true,false,58.716641382611044,664946,1132466
693,"Binary Number with Alternating Bits",binary-number-with-alternating-bits,false,Easy,1382,112,Algorithms,63.2%,693,false,Bit Manipulation;,true,false,63.1763380572372,146930,232573
694,"Number of Distinct Islands",number-of-distinct-islands,true,Medium,2267,150,Algorithms,61.9%,694,true,Hash Table;Depth-First Search;Breadth-First Search;Union Find;Hash Function;,true,true,61.85131707849904,181199,292958
695,"Max Area of Island",max-area-of-island,false,Medium,10137,209,Algorithms,72.7%,695,false,Array;Depth-First Search;Breadth-First Search;Union Find;Matrix;,true,false,72.70709170743426,980602,1348702
696,"Count Binary Substrings",count-binary-substrings,false,Easy,4040,885,Algorithms,65.7%,696,false,Two Pointers;String;,true,false,65.73602931359314,221559,337044
697,"Degree of an Array",degree-of-an-array,false,Easy,3092,1761,Algorithms,57.0%,697,false,Array;Hash Table;,true,false,56.99589082021971,232745,408354
698,"Partition to K Equal Sum Subsets",partition-to-k-equal-sum-subsets,false,Medium,7241,522,Algorithms,38.1%,698,false,Array;Dynamic Programming;Backtracking;Bit Manipulation;Memoization;Bitmask;,true,false,38.103405091158365,289041,758569
699,"Falling Squares",falling-squares,false,Hard,644,75,Algorithms,45.7%,699,false,Array;Segment Tree;Ordered Set;,true,false,45.69563064735734,29534,64632
783,"Search in a Binary Search Tree",search-in-a-binary-search-tree,false,Easy,6102,196,Algorithms,81.0%,700,false,Tree;Binary Search Tree;Binary Tree;,true,false,81.04445135219149,1042868,1286788
784,"Insert into a Binary Search Tree",insert-into-a-binary-search-tree,false,Medium,5988,180,Algorithms,73.6%,701,false,Tree;Binary Search Tree;Binary Tree;,true,false,73.56816199523821,624156,848407
786,"Search in a Sorted Array of Unknown Size",search-in-a-sorted-array-of-unknown-size,true,Medium,920,49,Algorithms,72.5%,702,true,Array;Binary Search;Interactive;,true,false,72.51586661523896,103404,142595
789,"Kth Largest Element in a Stream",kth-largest-element-in-a-stream,false,Easy,5959,3816,Algorithms,59.5%,703,false,Tree;Design;Binary Search Tree;Heap (Priority Queue);Binary Tree;Data Stream;,true,false,59.52177700279516,752334,1263967
792,"Binary Search",binary-search,false,Easy,12244,263,Algorithms,58.9%,704,false,Array;Binary Search;,true,false,58.86288511425487,2866304,4869459
816,"Design HashSet",design-hashset,false,Easy,3838,314,Algorithms,67.2%,705,false,Array;Hash Table;Linked List;Design;Hash Function;,true,false,67.21842341979976,459556,683680
817,"Design HashMap",design-hashmap,false,Easy,5191,477,Algorithms,65.6%,706,false,Array;Hash Table;Linked List;Design;Hash Function;,true,false,65.61256212748262,629566,959520
838,"Design Linked List",design-linked-list,false,Medium,2746,1643,Algorithms,28.7%,707,false,Linked List;Design;,true,false,28.679830063085415,375879,1310604
850,"Insert into a Sorted Circular Linked List",insert-into-a-sorted-circular-linked-list,true,Medium,1264,790,Algorithms,37.3%,708,true,Linked List;,true,false,37.32095962886227,203369,544919
742,"To Lower Case",to-lower-case,false,Easy,1892,2784,Algorithms,83.9%,709,false,String;,true,false,83.8507766338891,581130,693053
894,"Random Pick with Blacklist",random-pick-with-blacklist,false,Hard,873,120,Algorithms,33.8%,710,false,Array;Hash Table;Math;Binary Search;Sorting;Randomized;,false,false,33.78347019589936,45131,133589
711,"Number of Distinct Islands II",number-of-distinct-islands-ii,true,Hard,266,277,Algorithms,54.3%,711,true,Hash Table;Depth-First Search;Breadth-First Search;Union Find;Hash Function;,true,false,54.29027939715853,12572,23157
712,"Minimum ASCII Delete Sum for Two Strings",minimum-ascii-delete-sum-for-two-strings,false,Medium,4033,107,Algorithms,65.4%,712,false,String;Dynamic Programming;,true,false,65.42255588642368,155987,238430
713,"Subarray Product Less Than K",subarray-product-less-than-k,false,Medium,6991,222,Algorithms,52.2%,713,false,Array;Binary Search;Sliding Window;Prefix Sum;,true,false,52.1607497342283,454835,871986
714,"Best Time to Buy and Sell Stock with Transaction Fee",best-time-to-buy-and-sell-stock-with-transaction-fee,false,Medium,7295,218,Algorithms,69.7%,714,false,Array;Dynamic Programming;Greedy;,true,false,69.69754548572588,432835,621019
715,"Range Module",range-module,false,Hard,1532,129,Algorithms,44.0%,715,false,Design;Segment Tree;Ordered Set;,true,false,43.9733621946371,79634,181096
716,"Max Stack",max-stack,true,Hard,1953,513,Algorithms,45.2%,716,true,Linked List;Stack;Design;Doubly-Linked List;Ordered Set;,true,false,45.16296261009188,161169,356861
717,"1-bit and 2-bit Characters",1-bit-and-2-bit-characters,false,Easy,886,2132,Algorithms,45.2%,717,false,Array;,true,false,45.18518287218463,144706,320251
718,"Maximum Length of Repeated Subarray",maximum-length-of-repeated-subarray,false,Medium,6891,172,Algorithms,51.0%,718,false,Array;Binary Search;Dynamic Programming;Sliding Window;Rolling Hash;Hash Function;,true,false,50.96305935583886,323485,634744
719,"Find K-th Smallest Pair Distance",find-k-th-smallest-pair-distance,false,Hard,3776,120,Algorithms,45.5%,719,false,Array;Two Pointers;Binary Search;Sorting;,true,false,45.50206545154465,189676,416854
720,"Longest Word in Dictionary",longest-word-in-dictionary,false,Medium,2002,1499,Algorithms,53.0%,720,false,Array;Hash Table;String;Trie;Sorting;,true,false,53.0491896355941,164444,309984
721,"Accounts Merge",accounts-merge,false,Medium,7006,1218,Algorithms,58.5%,721,false,Array;Hash Table;String;Depth-First Search;Breadth-First Search;Union Find;Sorting;,true,false,58.531880162904585,461485,788431
722,"Remove Comments",remove-comments,false,Medium,728,1822,Algorithms,39.0%,722,false,Array;String;,true,false,39.04190699811137,76487,195910
723,"Candy Crush",candy-crush,true,Medium,1025,530,Algorithms,77.1%,723,true,Array;Two Pointers;Matrix;Simulation;,true,false,77.10124067466754,76065,98656
724,"Find Pivot Index",find-pivot-index,false,Easy,8594,875,Algorithms,59.4%,724,false,Array;Prefix Sum;,true,false,59.40572551873821,1271655,2140627
725,"Split Linked List in Parts",split-linked-list-in-parts,false,Medium,4481,363,Algorithms,70.0%,725,false,Linked List;,true,false,70.03879100989487,321566,459126
726,"Number of Atoms",number-of-atoms,false,Hard,1900,407,Algorithms,65.0%,726,false,Hash Table;String;Stack;Sorting;,true,false,65.0344033741936,151417,232826
727,"Minimum Window Subsequence",minimum-window-subsequence,true,Hard,1469,93,Algorithms,43.5%,727,true,String;Dynamic Programming;Sliding Window;,true,false,43.52912525444679,94732,217629
728,"Self Dividing Numbers",self-dividing-numbers,false,Easy,1813,382,Algorithms,79.2%,728,false,Math;,true,false,79.24767088126248,266754,336608
729,"My Calendar I",my-calendar-i,false,Medium,4678,128,Algorithms,58.4%,729,false,Array;Binary Search;Design;Segment Tree;Ordered Set;,true,false,58.370203385719485,409108,700885
730,"Count Different Palindromic Subsequences",count-different-palindromic-subsequences,false,Hard,1950,101,Algorithms,46.0%,730,false,String;Dynamic Programming;,true,false,46.049740137430675,39606,86007
731,"My Calendar II",my-calendar-ii,false,Medium,2170,179,Algorithms,62.8%,731,false,Array;Binary Search;Design;Segment Tree;Prefix Sum;Ordered Set;,true,false,62.762819011941,187639,298966
732,"My Calendar III",my-calendar-iii,false,Hard,2023,271,Algorithms,71.9%,732,false,Binary Search;Design;Segment Tree;Prefix Sum;Ordered Set;,true,false,71.92121493467737,97605,135711
733,"Flood Fill",flood-fill,false,Easy,8673,895,Algorithms,65.4%,733,false,Array;Depth-First Search;Breadth-First Search;Matrix;,true,false,65.44881736684589,1050355,1604850
734,"Sentence Similarity",sentence-similarity,true,Easy,58,64,Algorithms,44.5%,734,true,Array;Hash Table;String;,true,false,44.47924475560016,70013,157406
735,"Asteroid Collision",asteroid-collision,false,Medium,8358,1169,Algorithms,44.9%,735,false,Array;Stack;Simulation;,true,false,44.94153830443616,668952,1488494
736,"Parse Lisp Expression",parse-lisp-expression,false,Hard,483,365,Algorithms,52.2%,736,false,Hash Table;String;Stack;Recursion;,true,false,52.17343506079462,23729,45481
737,"Sentence Similarity II",sentence-similarity-ii,true,Medium,846,43,Algorithms,50.4%,737,true,Array;Hash Table;String;Depth-First Search;Breadth-First Search;Union Find;,true,false,50.42855778023447,73897,146538
738,"Monotone Increasing Digits",monotone-increasing-digits,false,Medium,1348,108,Algorithms,48.4%,738,false,Math;Greedy;,true,false,48.396949085385984,58630,121144
739,"Daily Temperatures",daily-temperatures,false,Medium,13541,340,Algorithms,66.7%,739,false,Array;Stack;Monotonic Stack;,true,false,66.71861208235543,1170085,1753760
740,"Delete and Earn",delete-and-earn,false,Medium,7662,390,Algorithms,56.6%,740,false,Array;Hash Table;Dynamic Programming;,true,false,56.581648667360504,376747,665849
741,"Cherry Pickup",cherry-pickup,false,Hard,4369,162,Algorithms,37.4%,741,false,Array;Dynamic Programming;Matrix;,true,false,37.415556923699725,88726,237140
743,"Closest Leaf in a Binary Tree",closest-leaf-in-a-binary-tree,true,Medium,872,184,Algorithms,46.7%,742,true,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,46.71393458120628,49414,105780
744,"Network Delay Time",network-delay-time,false,Medium,7665,375,Algorithms,55.9%,743,false,Depth-First Search;Breadth-First Search;Graph;Heap (Priority Queue);Shortest Path;,true,false,55.91215196559269,592800,1060232
745,"Find Smallest Letter Greater Than Target",find-smallest-letter-greater-than-target,false,Easy,4553,2208,Algorithms,53.3%,744,false,Array;Binary Search;,true,false,53.29687822050537,550775,1033413
746,"Prefix and Suffix Search",prefix-and-suffix-search,false,Hard,2294,489,Algorithms,41.2%,745,false,Array;Hash Table;String;Design;Trie;,true,false,41.19787316397417,101114,245435
747,"Min Cost Climbing Stairs",min-cost-climbing-stairs,false,Easy,11689,1807,Algorithms,66.6%,746,false,Array;Dynamic Programming;,true,false,66.59241497153032,1360506,2043040
748,"Largest Number At Least Twice of Others",largest-number-at-least-twice-of-others,false,Easy,1254,919,Algorithms,50.1%,747,false,Array;Sorting;,true,false,50.10298148144794,276587,552039
749,"Shortest Completing Word",shortest-completing-word,false,Easy,568,1117,Algorithms,60.7%,748,false,Array;Hash Table;String;,true,false,60.68921416374457,86364,142306
750,"Contain Virus",contain-virus,false,Hard,405,460,Algorithms,51.8%,749,false,Array;Depth-First Search;Breadth-First Search;Matrix;Simulation;,true,false,51.77731597943782,14202,27429
751,"Number Of Corner Rectangles",number-of-corner-rectangles,true,Medium,627,92,Algorithms,67.9%,750,true,Array;Math;Dynamic Programming;Matrix;,true,false,67.86272791325119,39490,58191
752,"IP to CIDR",ip-to-cidr,true,Medium,94,329,Algorithms,55.8%,751,true,String;Bit Manipulation;,true,false,55.835603996366935,27049,48444
753,"Open the Lock",open-the-lock,false,Medium,4856,222,Algorithms,60.5%,752,false,Array;Hash Table;String;Breadth-First Search;,true,false,60.510563473901954,341374,564158
754,"Cracking the Safe",cracking-the-safe,false,Hard,596,111,Algorithms,57.4%,753,false,Depth-First Search;Graph;Eulerian Circuit;,true,false,57.41918388977213,62842,109445
755,"Reach a Number",reach-a-number,false,Medium,1861,819,Algorithms,43.5%,754,false,Math;Binary Search;,true,false,43.54173069324319,59505,136662
756,"Pour Water",pour-water,true,Medium,304,774,Algorithms,47.5%,755,true,Array;Simulation;,true,false,47.493468608315666,40539,85357
757,"Pyramid Transition Matrix",pyramid-transition-matrix,false,Medium,540,484,Algorithms,52.8%,756,false,Bit Manipulation;Depth-First Search;Breadth-First Search;,true,false,52.81528549995588,35907,67986
759,"Set Intersection Size At Least Two",set-intersection-size-at-least-two,false,Hard,721,84,Algorithms,44.7%,757,false,Array;Greedy;Sorting;,true,false,44.659296911100846,25128,56266
760,"Bold Words in String",bold-words-in-string,true,Medium,273,124,Algorithms,51.8%,758,true,Array;Hash Table;String;Trie;String Matching;,true,false,51.80579756058926,19623,37878
761,"Employee Free Time",employee-free-time,true,Hard,1914,138,Algorithms,72.4%,759,true,Array;Sorting;Heap (Priority Queue);,true,false,72.4145014333449,158637,219068
762,"Find Anagram Mappings",find-anagram-mappings,true,Easy,616,232,Algorithms,83.8%,760,true,Array;Hash Table;,true,true,83.80366244443914,105394,125763
763,"Special Binary String",special-binary-string,false,Hard,735,222,Algorithms,62.7%,761,false,String;Recursion;,true,false,62.707065839407264,20820,33202
767,"Prime Number of Set Bits in Binary Representation",prime-number-of-set-bits-in-binary-representation,false,Easy,729,511,Algorithms,70.3%,762,false,Math;Bit Manipulation;,true,false,70.34767464361737,109060,155030
768,"Partition Labels",partition-labels,false,Medium,10440,408,Algorithms,80.1%,763,false,Hash Table;Two Pointers;String;Greedy;,true,false,80.11286585374249,581896,726346
769,"Largest Plus Sign",largest-plus-sign,false,Medium,1492,236,Algorithms,48.5%,764,false,Array;Dynamic Programming;,true,false,48.53105011803018,62293,128357
770,"Couples Holding Hands",couples-holding-hands,false,Hard,2385,119,Algorithms,58.0%,765,false,Greedy;Depth-First Search;Breadth-First Search;Union Find;Graph;,true,false,58.00845626551657,68461,118019
777,"Toeplitz Matrix",toeplitz-matrix,false,Easy,3589,170,Algorithms,69.4%,766,false,Array;Matrix;,true,false,69.3904895656517,376498,542579
778,"Reorganize String",reorganize-string,false,Medium,8711,268,Algorithms,55.5%,767,false,Hash Table;String;Greedy;Sorting;Heap (Priority Queue);Counting;,true,false,55.507555701075475,454341,818521
779,"Max Chunks To Make Sorted II",max-chunks-to-make-sorted-ii,false,Hard,1936,60,Algorithms,53.9%,768,false,Array;Stack;Greedy;Sorting;Monotonic Stack;,true,false,53.88442935438786,73639,136661
780,"Max Chunks To Make Sorted",max-chunks-to-make-sorted,false,Medium,3517,342,Algorithms,63.9%,769,false,Array;Stack;Greedy;Sorting;Monotonic Stack;,true,false,63.8617001581246,210415,329486
781,"Basic Calculator IV",basic-calculator-iv,false,Hard,176,1422,Algorithms,55.0%,770,false,Hash Table;Math;String;Stack;Recursion;,true,false,54.971067859021574,11495,20911
782,"Jewels and Stones",jewels-and-stones,false,Easy,5187,607,Algorithms,89.0%,771,false,Hash Table;String;,true,false,89.00126295762973,1156419,1299329
785,"Basic Calculator III",basic-calculator-iii,true,Hard,1145,293,Algorithms,51.6%,772,true,Math;String;Stack;Recursion;,true,false,51.58134037242218,136591,264807
787,"Sliding Puzzle",sliding-puzzle,false,Hard,2637,71,Algorithms,72.9%,773,false,Array;Dynamic Programming;Backtracking;Breadth-First Search;Memoization;Matrix;,true,false,72.91280936284419,171698,235484
788,"Minimize Max Distance to Gas Station",minimize-max-distance-to-gas-station,true,Hard,687,99,Algorithms,52.7%,774,true,Array;Binary Search;,true,false,52.664705592348525,32047,60851
790,"Global and Local Inversions",global-and-local-inversions,false,Medium,1847,376,Algorithms,42.4%,775,false,Array;Math;,true,false,42.35479075537683,79205,187005
791,"Split BST",split-bst,true,Medium,1072,103,Algorithms,82.5%,776,true,Tree;Binary Search Tree;Recursion;Binary Tree;,true,false,82.51465063861758,109827,133100
793,"Swap Adjacent in LR String",swap-adjacent-in-lr-string,false,Medium,1270,935,Algorithms,37.3%,777,false,Two Pointers;String;,true,false,37.300617384534604,82409,220931
794,"Swim in Rising Water",swim-in-rising-water,false,Hard,3836,267,Algorithms,62.0%,778,false,Array;Binary Search;Depth-First Search;Breadth-First Search;Union Find;Heap (Priority Queue);Matrix;,true,false,61.96265589075455,195657,315766
795,"K-th Symbol in Grammar",k-th-symbol-in-grammar,false,Medium,3874,408,Algorithms,47.0%,779,false,Math;Bit Manipulation;Recursion;,true,false,46.992090125152465,219992,468144
796,"Reaching Points",reaching-points,false,Hard,1541,231,Algorithms,33.5%,780,false,Math;,true,false,33.45757053081345,72353,216253
797,"Rabbits in Forest",rabbits-in-forest,false,Medium,1387,643,Algorithms,52.8%,781,false,Array;Hash Table;Math;Greedy;,true,false,52.80659085784235,65570,124171
798,"Transform to Chessboard",transform-to-chessboard,false,Hard,362,311,Algorithms,50.4%,782,false,Array;Math;Bit Manipulation;Matrix;,true,false,50.44027513850601,18846,37363
799,"Minimum Distance Between BST Nodes",minimum-distance-between-bst-nodes,false,Easy,3539,424,Algorithms,60.0%,783,false,Tree;Depth-First Search;Breadth-First Search;Binary Search Tree;Binary Tree;,true,false,60.00791391419998,272970,454889
800,"Letter Case Permutation",letter-case-permutation,false,Medium,4692,156,Algorithms,74.6%,784,false,String;Backtracking;Bit Manipulation;,true,false,74.64790699948544,320615,429503
801,"Is Graph Bipartite?",is-graph-bipartite,false,Medium,8516,394,Algorithms,56.9%,785,false,Depth-First Search;Breadth-First Search;Union Find;Graph;,true,true,56.87700200025178,650590,1143855
802,"K-th Smallest Prime Fraction",k-th-smallest-prime-fraction,false,Medium,2042,117,Algorithms,68.3%,786,false,Array;Two Pointers;Binary Search;Sorting;Heap (Priority Queue);,true,false,68.31838289506021,155673,227863
803,"Cheapest Flights Within K Stops",cheapest-flights-within-k-stops,false,Medium,10247,432,Algorithms,39.9%,787,false,Dynamic Programming;Depth-First Search;Breadth-First Search;Graph;Heap (Priority Queue);Shortest Path;,true,false,39.89389399462075,658118,1649671
804,"Rotated Digits",rotated-digits,false,Medium,761,1935,Algorithms,56.5%,788,false,Math;Dynamic Programming;,true,false,56.45476446058184,114125,202152
805,"Escape The Ghosts",escape-the-ghosts,false,Medium,300,30,Algorithms,62.4%,789,false,Array;Math;,true,false,62.41329618599289,32483,52045
806,"Domino and Tromino Tiling",domino-and-tromino-tiling,false,Medium,3568,1162,Algorithms,49.0%,790,false,Dynamic Programming;,true,true,49.03528700943597,159068,324392
807,"Custom Sort String",custom-sort-string,false,Medium,3678,419,Algorithms,71.5%,791,false,Hash Table;String;Sorting;,true,false,71.47864798310417,489385,684657
808,"Number of Matching Subsequences",number-of-matching-subsequences,false,Medium,5566,239,Algorithms,50.7%,792,false,Array;Hash Table;String;Binary Search;Dynamic Programming;Trie;Sorting;,true,false,50.744967573486065,240998,474920
809,"Preimage Size of Factorial Zeroes Function",preimage-size-of-factorial-zeroes-function,false,Hard,445,101,Algorithms,45.3%,793,false,Math;Binary Search;,true,false,45.32320063623912,20516,45266
810,"Valid Tic-Tac-Toe State",valid-tic-tac-toe-state,false,Medium,560,1160,Algorithms,34.6%,794,false,Array;Matrix;,true,false,34.6141735825293,61561,177850
811,"Number of Subarrays with Bounded Maximum",number-of-subarrays-with-bounded-maximum,false,Medium,2334,124,Algorithms,53.5%,795,false,Array;Two Pointers;,true,false,53.478548889157985,75078,140389
812,"Rotate String",rotate-string,false,Easy,4270,299,Algorithms,63.3%,796,false,String;String Matching;,true,false,63.306301224253836,543158,857982
813,"All Paths From Source to Target",all-paths-from-source-to-target,false,Medium,7332,148,Algorithms,82.8%,797,false,Backtracking;Depth-First Search;Breadth-First Search;Graph;,true,false,82.81630800858866,571216,689740
814,"Smallest Rotation with Highest Score",smallest-rotation-with-highest-score,false,Hard,549,42,Algorithms,51.7%,798,false,Array;Prefix Sum;,true,false,51.71460743167161,15156,29307
815,"Champagne Tower",champagne-tower,false,Medium,3684,207,Algorithms,58.3%,799,false,Dynamic Programming;,true,false,58.268902463544,159394,273549
818,"Similar RGB Color",similar-rgb-color,true,Easy,108,687,Algorithms,67.7%,800,true,Math;String;Enumeration;,true,false,67.71845585153005,17770,26241
819,"Minimum Swaps To Make Sequences Increasing",minimum-swaps-to-make-sequences-increasing,false,Hard,2859,138,Algorithms,40.5%,801,false,Array;Dynamic Programming;,true,false,40.47710475540322,85382,210939
820,"Find Eventual Safe States",find-eventual-safe-states,false,Medium,5966,470,Algorithms,64.9%,802,false,Depth-First Search;Breadth-First Search;Graph;Topological Sort;,true,false,64.89626327431753,306285,471962
821,"Bricks Falling When Hit",bricks-falling-when-hit,false,Hard,1136,189,Algorithms,35.2%,803,false,Array;Union Find;Matrix;,true,false,35.15674773171643,32006,91038
822,"Unique Morse Code Words",unique-morse-code-words,false,Easy,2535,1542,Algorithms,83.1%,804,false,Array;Hash Table;String;,true,false,83.05766701839045,370742,446368
823,"Split Array With Same Average",split-array-with-same-average,false,Hard,1297,137,Algorithms,25.6%,805,false,Array;Math;Dynamic Programming;Bit Manipulation;Bitmask;,true,false,25.587279114886474,39038,152568
824,"Number of Lines To Write String",number-of-lines-to-write-string,false,Easy,621,1341,Algorithms,69.8%,806,false,Array;String;,true,false,69.78288022945613,90507,129698
825,"Max Increase to Keep City Skyline",max-increase-to-keep-city-skyline,false,Medium,2595,531,Algorithms,86.2%,807,false,Array;Greedy;Matrix;,true,false,86.18009080124338,172168,199777
826,"Soup Servings",soup-servings,false,Medium,1010,2725,Algorithms,53.6%,808,false,Math;Dynamic Programming;Probability and Statistics;,true,false,53.60629462334256,69901,130397
827,"Expressive Words",expressive-words,false,Medium,880,1923,Algorithms,46.3%,809,false,Array;Two Pointers;String;,true,false,46.25483786119566,123084,266116
828,"Chalkboard XOR Game",chalkboard-xor-game,false,Hard,232,284,Algorithms,61.4%,810,false,Array;Math;Bit Manipulation;Brainteaser;Game Theory;,true,false,61.36713825465752,13143,21417
829,"Subdomain Visit Count",subdomain-visit-count,false,Medium,1570,1303,Algorithms,76.6%,811,false,Array;Hash Table;String;Counting;,true,false,76.62607238414442,241425,315069
830,"Largest Triangle Area",largest-triangle-area,false,Easy,542,1595,Algorithms,61.5%,812,false,Array;Math;Geometry;,true,false,61.47596691726178,58795,95639
831,"Largest Sum of Averages",largest-sum-of-averages,false,Medium,2135,101,Algorithms,54.0%,813,false,Array;Dynamic Programming;Prefix Sum;,true,false,53.95364530126805,57567,106698
832,"Binary Tree Pruning",binary-tree-pruning,false,Medium,4555,118,Algorithms,72.3%,814,false,Tree;Depth-First Search;Binary Tree;,true,false,72.29042529187106,259505,358976
833,"Bus Routes",bus-routes,false,Hard,4351,125,Algorithms,47.2%,815,false,Array;Hash Table;Breadth-First Search;,true,false,47.171931263482314,225454,477941
834,"Ambiguous Coordinates",ambiguous-coordinates,false,Medium,328,665,Algorithms,56.5%,816,false,String;Backtracking;Enumeration;,true,false,56.53143432599626,31436,55608
835,"Linked List Components",linked-list-components,false,Medium,1126,2251,Algorithms,57.1%,817,false,Array;Hash Table;Linked List;,true,false,57.0529318230251,104411,183008
836,"Race Car",race-car,false,Hard,1935,183,Algorithms,43.9%,818,false,Dynamic Programming;,true,false,43.94700132919389,93568,212911
837,"Most Common Word",most-common-word,false,Easy,1738,3081,Algorithms,44.4%,819,false,Array;Hash Table;String;Counting;,true,false,44.43485684596493,388272,873808
839,"Short Encoding of Words",short-encoding-of-words,false,Medium,1765,656,Algorithms,60.5%,820,false,Array;Hash Table;String;Trie;,true,false,60.487608547175334,99189,163983
841,"Shortest Distance to a Character",shortest-distance-to-a-character,false,Easy,3186,185,Algorithms,72.0%,821,false,Array;Two Pointers;String;,true,false,71.96154669330099,201736,280339
842,"Card Flipping Game",card-flipping-game,false,Medium,176,771,Algorithms,48.1%,822,false,Array;Hash Table;,true,false,48.139879257318604,21131,43895
843,"Binary Trees With Factors",binary-trees-with-factors,false,Medium,3324,257,Algorithms,52.9%,823,false,Array;Hash Table;Dynamic Programming;Sorting;,true,false,52.899952422791216,152327,287953
851,"Goat Latin",goat-latin,false,Easy,939,1255,Algorithms,68.9%,824,false,String;,true,false,68.89744741114296,199465,289510
852,"Friends Of Appropriate Ages",friends-of-appropriate-ages,false,Medium,803,1242,Algorithms,48.6%,825,false,Array;Two Pointers;Binary Search;Sorting;,true,false,48.576867673010746,104876,215897
853,"Most Profit Assigning Work",most-profit-assigning-work,false,Medium,2407,172,Algorithms,55.9%,826,false,Array;Two Pointers;Binary Search;Greedy;Sorting;,true,false,55.85601225427623,218787,391699
854,"Making A Large Island",making-a-large-island,false,Hard,4063,80,Algorithms,49.6%,827,false,Array;Depth-First Search;Breadth-First Search;Union Find;Matrix;,true,false,49.564496993464644,220160,444193
855,"Count Unique Characters of All Substrings of a Given String",count-unique-characters-of-all-substrings-of-a-given-string,false,Hard,2187,252,Algorithms,52.7%,828,false,Hash Table;String;Dynamic Programming;,true,false,52.677547787297016,75813,143919
856,"Consecutive Numbers Sum",consecutive-numbers-sum,false,Hard,1385,1384,Algorithms,41.9%,829,false,Math;Enumeration;,true,false,41.9360171943457,91314,217746
857,"Positions of Large Groups",positions-of-large-groups,false,Easy,886,124,Algorithms,52.6%,830,false,String;,true,false,52.63755801099344,103327,196299
858,"Masking Personal Information",masking-personal-information,false,Medium,171,451,Algorithms,49.8%,831,false,String;,true,false,49.827411634757,21653,43456
861,"Flipping an Image",flipping-an-image,false,Easy,3511,245,Algorithms,82.6%,832,false,Array;Two Pointers;Bit Manipulation;Matrix;Simulation;,true,false,82.60657961317891,470154,569149
862,"Find And Replace in String",find-and-replace-in-string,false,Medium,1210,1034,Algorithms,51.7%,833,false,Array;Hash Table;String;Sorting;,true,false,51.71497039377605,155811,301288
863,"Sum of Distances in Tree",sum-of-distances-in-tree,false,Hard,5666,137,Algorithms,65.3%,834,false,Dynamic Programming;Tree;Depth-First Search;Graph;,true,false,65.27555394865968,164294,251693
864,"Image Overlap",image-overlap,false,Medium,1350,490,Algorithms,63.6%,835,false,Array;Matrix;,true,false,63.64793753182821,97487,153166
866,"Rectangle Overlap",rectangle-overlap,false,Easy,2018,474,Algorithms,45.4%,836,false,Math;Geometry;,true,false,45.39140396527506,157697,347416
867,"New 21 Game",new-21-game,false,Medium,2006,1847,Algorithms,44.9%,837,false,Math;Dynamic Programming;Sliding Window;Probability and Statistics;,true,false,44.88531707123547,79197,176443
868,"Push Dominoes",push-dominoes,false,Medium,3408,230,Algorithms,57.3%,838,false,Two Pointers;String;Dynamic Programming;,true,false,57.298442057780164,129055,225233
869,"Similar String Groups",similar-string-groups,false,Hard,2373,217,Algorithms,55.3%,839,false,Array;Hash Table;String;Depth-First Search;Breadth-First Search;Union Find;,true,false,55.290528177337315,126309,228446
870,"Magic Squares In Grid",magic-squares-in-grid,false,Medium,817,1830,Algorithms,51.6%,840,false,Array;Hash Table;Math;Matrix;,true,false,51.64016362643829,145679,282105
871,"Keys and Rooms",keys-and-rooms,false,Medium,6278,285,Algorithms,74.0%,841,false,Depth-First Search;Breadth-First Search;Graph;,true,false,73.96080373567284,522681,706700
872,"Split Array into Fibonacci Sequence",split-array-into-fibonacci-sequence,false,Medium,1147,306,Algorithms,39.3%,842,false,String;Backtracking;,true,false,39.25688721450435,41681,106175
873,"Guess the Word",guess-the-word,false,Hard,1567,1811,Algorithms,38.3%,843,false,Array;Math;String;Interactive;Game Theory;,false,false,38.26227104026989,152888,399579
874,"Backspace String Compare",backspace-string-compare,false,Easy,7636,368,Algorithms,49.3%,844,false,Two Pointers;String;Stack;Simulation;,true,false,49.34382043063044,893924,1811623
875,"Longest Mountain in Array",longest-mountain-in-array,false,Medium,2851,83,Algorithms,40.7%,845,false,Array;Two Pointers;Dynamic Programming;Enumeration;,true,false,40.70204086277232,143073,351511
876,"Hand of Straights",hand-of-straights,false,Medium,3377,263,Algorithms,56.8%,846,false,Array;Hash Table;Greedy;Sorting;,true,false,56.79773447697184,341159,600655
877,"Shortest Path Visiting All Nodes",shortest-path-visiting-all-nodes,false,Hard,4381,172,Algorithms,65.4%,847,false,Dynamic Programming;Bit Manipulation;Breadth-First Search;Graph;Bitmask;,true,false,65.37592285671236,130170,199110
878,"Shifting Letters",shifting-letters,false,Medium,1423,129,Algorithms,45.0%,848,false,Array;String;Prefix Sum;,true,false,45.04358587809244,108380,240633
879,"Maximize Distance to Closest Person",maximize-distance-to-closest-person,false,Medium,3253,197,Algorithms,48.5%,849,false,Array;,true,false,48.54847807215806,242721,499952
880,"Rectangle Area II",rectangle-area-ii,false,Hard,984,62,Algorithms,54.3%,850,false,Array;Segment Tree;Line Sweep;Ordered Set;,true,false,54.27502724354254,36856,67906
881,"Loud and Rich",loud-and-rich,false,Medium,1353,828,Algorithms,60.6%,851,false,Array;Depth-First Search;Graph;Topological Sort;,true,false,60.620927642966606,54985,90703
882,"Peak Index in a Mountain Array",peak-index-in-a-mountain-array,false,Medium,7769,1928,Algorithms,67.9%,852,false,Array;Binary Search;,true,false,67.94134267175511,926991,1364398
883,"Car Fleet",car-fleet,false,Medium,3747,1055,Algorithms,52.5%,853,false,Array;Stack;Sorting;Monotonic Stack;,true,false,52.54767785690716,328043,624281
884,"K-Similar Strings",k-similar-strings,false,Hard,1147,61,Algorithms,40.0%,854,false,String;Breadth-First Search;,true,false,40.03406314022659,48657,121539
885,"Exam Room",exam-room,false,Medium,1360,496,Algorithms,43.6%,855,false,Design;Heap (Priority Queue);Ordered Set;,true,false,43.618706430419,65261,149617
886,"Score of Parentheses",score-of-parentheses,false,Medium,5475,221,Algorithms,63.9%,856,false,String;Stack;,true,false,63.857401018564154,198237,310437
887,"Minimum Cost to Hire K Workers",minimum-cost-to-hire-k-workers,false,Hard,2951,398,Algorithms,63.4%,857,false,Array;Greedy;Sorting;Heap (Priority Queue);,true,false,63.446460427272335,145819,229830
888,"Mirror Reflection",mirror-reflection,false,Medium,1120,2550,Algorithms,62.3%,858,false,Math;Geometry;Number Theory;,true,false,62.26274655749907,81977,131663
889,"Buddy Strings",buddy-strings,false,Easy,3230,1819,Algorithms,33.4%,859,false,Hash Table;String;,true,false,33.38431256111109,260853,781363
890,"Lemonade Change",lemonade-change,false,Easy,2957,195,Algorithms,58.3%,860,false,Array;Greedy;,true,false,58.28422171761587,399642,685679
891,"Score After Flipping Matrix",score-after-flipping-matrix,false,Medium,2337,218,Algorithms,80.3%,861,false,Array;Greedy;Bit Manipulation;Matrix;,true,false,80.29648418382651,152585,190027
892,"Shortest Subarray with Sum at Least K",shortest-subarray-with-sum-at-least-k,false,Hard,4960,136,Algorithms,32.2%,862,false,Array;Binary Search;Queue;Sliding Window;Heap (Priority Queue);Prefix Sum;Monotonic Queue;,true,false,32.150424858676715,180859,562539
893,"All Nodes Distance K in Binary Tree",all-nodes-distance-k-in-binary-tree,false,Medium,11267,245,Algorithms,65.5%,863,false,Hash Table;Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,65.5240855354127,513680,783956
895,"Shortest Path to Get All Keys",shortest-path-to-get-all-keys,false,Hard,2374,104,Algorithms,53.6%,864,false,Array;Bit Manipulation;Breadth-First Search;Matrix;,true,false,53.594719471947194,81193,151495
896,"Smallest Subtree with all the Deepest Nodes",smallest-subtree-with-all-the-deepest-nodes,false,Medium,2679,375,Algorithms,71.3%,865,false,Hash Table;Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,71.32234495455069,148765,208582
897,"Prime Palindrome",prime-palindrome,false,Medium,452,835,Algorithms,26.4%,866,false,Math;Number Theory;,true,false,26.379888425560686,37451,141963
898,"Transpose Matrix",transpose-matrix,false,Easy,3852,449,Algorithms,73.2%,867,false,Array;Matrix;Simulation;,true,false,73.16964032392733,451308,616799
899,"Binary Gap",binary-gap,false,Easy,652,664,Algorithms,64.2%,868,false,Bit Manipulation;,true,false,64.19046667760647,89970,140161
900,"Reordered Power of 2",reordered-power-of-2,false,Medium,2123,440,Algorithms,62.4%,869,false,Hash Table;Math;Sorting;Counting;Enumeration;,true,false,62.386652740954986,116479,186705
901,"Advantage Shuffle",advantage-shuffle,false,Medium,1632,99,Algorithms,53.0%,870,false,Array;Two Pointers;Greedy;Sorting;,true,false,53.00613770121938,71421,134741
902,"Minimum Number of Refueling Stops",minimum-number-of-refueling-stops,false,Hard,4736,91,Algorithms,40.3%,871,false,Array;Dynamic Programming;Greedy;Heap (Priority Queue);,true,false,40.29626836079075,145316,360619
904,"Leaf-Similar Trees",leaf-similar-trees,false,Easy,4189,119,Algorithms,70.0%,872,false,Tree;Depth-First Search;Binary Tree;,true,false,70.02842204456333,552887,789516
905,"Length of Longest Fibonacci Subsequence",length-of-longest-fibonacci-subsequence,false,Medium,2052,77,Algorithms,48.5%,873,false,Array;Hash Table;Dynamic Programming;,true,false,48.45089038272956,68183,140726
906,"Walking Robot Simulation",walking-robot-simulation,false,Medium,861,195,Algorithms,58.0%,874,false,Array;Hash Table;Simulation;,true,false,58.0003393256272,157254,271126
907,"Koko Eating Bananas",koko-eating-bananas,false,Medium,11452,746,Algorithms,48.7%,875,false,Array;Binary Search;,true,false,48.68926008911086,910934,1870911
908,"Middle of the Linked List",middle-of-the-linked-list,false,Easy,12069,385,Algorithms,79.8%,876,false,Linked List;Two Pointers;,true,true,79.8103481429167,2245418,2813447
909,"Stone Game",stone-game,false,Medium,3362,2920,Algorithms,71.3%,877,false,Array;Math;Dynamic Programming;Game Theory;,true,false,71.30920324189198,269849,378421
910,"Nth Magical Number",nth-magical-number,false,Hard,1294,162,Algorithms,35.7%,878,false,Math;Binary Search;,true,false,35.74942105174191,42298,118318
911,"Profitable Schemes",profitable-schemes,false,Hard,1863,124,Algorithms,48.1%,879,false,Array;Dynamic Programming;,true,false,48.08663026221175,67542,140459
916,"Decoded String at Index",decoded-string-at-index,false,Medium,2541,361,Algorithms,36.5%,880,false,String;Stack;,true,false,36.52505264078222,100262,274501
917,"Boats to Save People",boats-to-save-people,false,Medium,6528,161,Algorithms,59.8%,881,false,Array;Two Pointers;Greedy;Sorting;,true,false,59.75403906438389,446040,746460
918,"Reachable Nodes In Subdivided Graph",reachable-nodes-in-subdivided-graph,false,Hard,837,225,Algorithms,50.7%,882,false,Graph;Heap (Priority Queue);Shortest Path;,true,false,50.72454200363096,30734,60590
919,"Projection Area of 3D Shapes",projection-area-of-3d-shapes,false,Easy,605,1427,Algorithms,73.6%,883,false,Array;Math;Geometry;Matrix;,true,false,73.55301817834365,61583,83726
920,"Uncommon Words from Two Sentences",uncommon-words-from-two-sentences,false,Easy,1832,206,Algorithms,75.2%,884,false,Hash Table;String;Counting;,true,false,75.23094373640961,303766,403777
921,"Spiral Matrix III",spiral-matrix-iii,false,Medium,1555,1027,Algorithms,84.6%,885,false,Array;Matrix;Simulation;,true,false,84.64221927451615,162076,191484
922,"Possible Bipartition",possible-bipartition,false,Medium,4737,114,Algorithms,51.0%,886,false,Depth-First Search;Breadth-First Search;Union Find;Graph;,true,false,51.01570804299044,224614,440284
923,"Super Egg Drop",super-egg-drop,false,Hard,3681,194,Algorithms,28.3%,887,false,Math;Binary Search;Dynamic Programming;,true,false,28.29452033053654,80226,283538
924,"Fair Candy Swap",fair-candy-swap,false,Easy,2147,394,Algorithms,62.6%,888,false,Array;Hash Table;Binary Search;Sorting;,true,false,62.62629960462732,136856,218528
925,"Construct Binary Tree from Preorder and Postorder Traversal",construct-binary-tree-from-preorder-and-postorder-traversal,false,Medium,2775,118,Algorithms,71.9%,889,false,Array;Hash Table;Divide and Conquer;Tree;Binary Tree;,true,false,71.93524022199598,109525,152255
926,"Find and Replace Pattern",find-and-replace-pattern,false,Medium,3953,172,Algorithms,76.8%,890,false,Array;Hash Table;String;,true,false,76.78766370206323,196247,255571
927,"Sum of Subsequence Widths",sum-of-subsequence-widths,false,Hard,716,171,Algorithms,38.4%,891,false,Array;Math;Sorting;,true,false,38.378671364206106,22658,59038
928,"Surface Area of 3D Shapes",surface-area-of-3d-shapes,false,Easy,579,748,Algorithms,67.3%,892,false,Array;Math;Geometry;Matrix;,true,false,67.29771823446691,44506,66133
929,"Groups of Special-Equivalent Strings",groups-of-special-equivalent-strings,false,Medium,543,1485,Algorithms,72.4%,893,false,Array;Hash Table;String;Sorting;,true,false,72.42858709359066,52841,72956
930,"All Possible Full Binary Trees",all-possible-full-binary-trees,false,Medium,5117,358,Algorithms,82.8%,894,false,Dynamic Programming;Tree;Recursion;Memoization;Binary Tree;,true,false,82.78007768578146,194361,234792
931,"Maximum Frequency Stack",maximum-frequency-stack,false,Hard,4751,74,Algorithms,66.6%,895,false,Hash Table;Stack;Design;Ordered Set;,true,false,66.59164158905963,186986,280795
932,"Monotonic Array",monotonic-array,false,Easy,3113,97,Algorithms,61.5%,896,false,Array;,true,false,61.48939069095471,478385,777996
933,"Increasing Order Search Tree",increasing-order-search-tree,false,Easy,4363,676,Algorithms,78.5%,897,false,Stack;Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,false,78.53896812124108,302440,385083
934,"Bitwise ORs of Subarrays",bitwise-ors-of-subarrays,false,Medium,1506,208,Algorithms,40.0%,898,false,Array;Dynamic Programming;Bit Manipulation;,true,false,40.00536118502045,40295,100724
935,"Orderly Queue",orderly-queue,false,Hard,1777,617,Algorithms,66.1%,899,false,Math;String;Sorting;,true,false,66.05750182927918,74028,112066
936,"RLE Iterator",rle-iterator,false,Medium,754,196,Algorithms,59.7%,900,false,Array;Design;Counting;Iterator;,true,false,59.68949393038952,77739,130239
937,"Online Stock Span",online-stock-span,false,Medium,6556,439,Algorithms,66.9%,901,false,Stack;Design;Monotonic Stack;Data Stream;,true,false,66.91664139506116,390562,583654
938,"Numbers At Most N Given Digit Set",numbers-at-most-n-given-digit-set,false,Hard,1407,98,Algorithms,42.9%,902,false,Array;Math;String;Binary Search;Dynamic Programming;,true,false,42.8765934116142,46922,109435
939,"Valid Permutations for DI Sequence",valid-permutations-for-di-sequence,false,Hard,731,43,Algorithms,57.0%,903,false,String;Dynamic Programming;Prefix Sum;,true,false,57.02379395999478,17447,30596
940,"Fruit Into Baskets",fruit-into-baskets,false,Medium,4856,367,Algorithms,45.3%,904,false,Array;Hash Table;Sliding Window;,true,false,45.30525691435284,467461,1031801
941,"Sort Array By Parity",sort-array-by-parity,false,Easy,5456,150,Algorithms,76.3%,905,false,Array;Two Pointers;Sorting;,true,false,76.2572874397457,864075,1133107
942,"Super Palindromes",super-palindromes,false,Hard,366,421,Algorithms,39.1%,906,false,Math;Enumeration;,true,false,39.111979723333434,25616,65494
943,"Sum of Subarray Minimums",sum-of-subarray-minimums,false,Medium,8331,652,Algorithms,37.3%,907,false,Array;Dynamic Programming;Stack;Monotonic Stack;,true,false,37.26676231609308,303120,813381
944,"Smallest Range I",smallest-range-i,false,Easy,733,2059,Algorithms,71.2%,908,false,Array;Math;,true,false,71.15530289622167,100506,141250
945,"Snakes and Ladders",snakes-and-ladders,false,Medium,3009,1112,Algorithms,43.9%,909,false,Array;Breadth-First Search;Matrix;,true,false,43.90026469363871,223570,509268
946,"Smallest Range II",smallest-range-ii,false,Medium,1677,464,Algorithms,36.7%,910,false,Array;Math;Greedy;Sorting;,true,false,36.733403054802324,58657,159683
947,"Online Election",online-election,false,Medium,1036,666,Algorithms,52.3%,911,false,Array;Hash Table;Binary Search;Design;,true,false,52.328658482305435,64662,123569
948,"Sort an Array",sort-an-array,false,Medium,6633,805,Algorithms,57.3%,912,false,Array;Divide and Conquer;Sorting;Heap (Priority Queue);Merge Sort;Bucket Sort;Radix Sort;Counting Sort;,true,false,57.32787918990411,840029,1465304
949,"Cat and Mouse",cat-and-mouse,false,Hard,938,165,Algorithms,33.9%,913,false,Math;Dynamic Programming;Graph;Topological Sort;Memoization;Game Theory;,true,false,33.859143456875216,21615,63838
950,"X of a Kind in a Deck of Cards",x-of-a-kind-in-a-deck-of-cards,false,Easy,1834,535,Algorithms,29.8%,914,false,Array;Hash Table;Math;Counting;Number Theory;,true,false,29.830721227187347,133559,447721
951,"Partition Array into Disjoint Intervals",partition-array-into-disjoint-intervals,false,Medium,1681,81,Algorithms,48.9%,915,false,Array;,true,false,48.86952412563218,86869,177757
952,"Word Subsets",word-subsets,false,Medium,2721,236,Algorithms,51.6%,916,false,Array;Hash Table;String;,true,false,51.63218773112995,117977,228496
953,"Reverse Only Letters",reverse-only-letters,false,Easy,2305,79,Algorithms,66.1%,917,false,Two Pointers;String;,true,false,66.09823437360043,250892,379577
954,"Maximum Sum Circular Subarray",maximum-sum-circular-subarray,false,Medium,6812,314,Algorithms,46.4%,918,false,Array;Divide and Conquer;Dynamic Programming;Queue;Monotonic Queue;,true,false,46.39731508971215,305520,658490
955,"Complete Binary Tree Inserter",complete-binary-tree-inserter,false,Medium,1122,115,Algorithms,66.1%,919,false,Tree;Breadth-First Search;Design;Binary Tree;,true,false,66.11880303707012,59216,89560
956,"Number of Music Playlists",number-of-music-playlists,false,Hard,2392,198,Algorithms,60.3%,920,false,Math;Dynamic Programming;Combinatorics;,true,false,60.25916315008415,72684,120619
957,"Minimum Add to Make Parentheses Valid",minimum-add-to-make-parentheses-valid,false,Medium,4636,233,Algorithms,74.7%,921,false,String;Stack;Greedy;,true,false,74.67350795932492,561037,751320
958,"Sort Array By Parity II",sort-array-by-parity-ii,false,Easy,2653,98,Algorithms,70.9%,922,false,Array;Two Pointers;Sorting;,true,true,70.92910623260072,278986,393332
959,"3Sum With Multiplicity",3sum-with-multiplicity,false,Medium,2640,320,Algorithms,45.6%,923,false,Array;Hash Table;Two Pointers;Sorting;Counting;,true,false,45.649169239817674,108661,238035
960,"Minimize Malware Spread",minimize-malware-spread,false,Hard,1032,617,Algorithms,42.1%,924,false,Array;Hash Table;Depth-First Search;Breadth-First Search;Union Find;Graph;,true,false,42.09108786730128,59074,140348
961,"Long Pressed Name",long-pressed-name,false,Easy,2479,388,Algorithms,32.3%,925,false,Two Pointers;String;,true,false,32.29793275504091,157423,487410
962,"Flip String to Monotone Increasing",flip-string-to-monotone-increasing,false,Medium,4468,179,Algorithms,61.6%,926,false,String;Dynamic Programming;,true,false,61.55078143151438,198688,322804
963,"Three Equal Parts",three-equal-parts,false,Hard,842,123,Algorithms,40.1%,927,false,Array;Math;,true,false,40.057625816365736,31281,78090
964,"Minimize Malware Spread II",minimize-malware-spread-ii,false,Hard,677,89,Algorithms,44.3%,928,false,Array;Hash Table;Depth-First Search;Breadth-First Search;Union Find;Graph;,true,false,44.3041974615101,25237,56963
965,"Unique Email Addresses",unique-email-addresses,false,Easy,2731,348,Algorithms,67.4%,929,false,Array;Hash Table;String;,true,false,67.40655945321919,520533,772229
966,"Binary Subarrays With Sum",binary-subarrays-with-sum,false,Medium,4128,138,Algorithms,64.6%,930,false,Array;Hash Table;Sliding Window;Prefix Sum;,true,false,64.6165250990835,312046,482920
967,"Minimum Falling Path Sum",minimum-falling-path-sum,false,Medium,6528,165,Algorithms,62.3%,931,false,Array;Dynamic Programming;Matrix;,true,false,62.3159231137831,504574,809706
968,"Beautiful Array",beautiful-array,false,Medium,1089,1539,Algorithms,66.3%,932,false,Array;Math;Divide and Conquer;,true,false,66.29100225398648,47350,71428
969,"Number of Recent Calls",number-of-recent-calls,false,Easy,630,975,Algorithms,76.7%,933,false,Design;Queue;Data Stream;,true,false,76.74896199725583,343441,447486
971,"Shortest Bridge",shortest-bridge,false,Medium,5495,214,Algorithms,58.2%,934,false,Array;Depth-First Search;Breadth-First Search;Matrix;,true,false,58.174289169963714,227021,390245
972,"Knight Dialer",knight-dialer,false,Medium,3076,445,Algorithms,60.8%,935,false,Dynamic Programming;,true,false,60.819657518644334,184227,302907
973,"Stamping The Sequence",stamping-the-sequence,false,Hard,1552,219,Algorithms,62.3%,936,false,String;Stack;Greedy;Queue;,true,false,62.257614147577435,60200,96695
974,"Reorder Data in Log Files",reorder-data-in-log-files,false,Medium,2138,4400,Algorithms,56.6%,937,false,Array;String;Sorting;,true,false,56.611919049614656,380945,672906
975,"Range Sum of BST",range-sum-of-bst,false,Easy,7029,382,Algorithms,87.2%,938,false,Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,true,87.24924798630343,1170070,1341066
976,"Minimum Area Rectangle",minimum-area-rectangle,false,Medium,2029,290,Algorithms,54.6%,939,false,Array;Hash Table;Math;Geometry;Sorting;,true,false,54.62705824314954,158348,289871
977,"Distinct Subsequences II",distinct-subsequences-ii,false,Hard,1756,38,Algorithms,43.3%,940,false,String;Dynamic Programming;,true,true,43.308657740886325,43410,100234
978,"Valid Mountain Array",valid-mountain-array,false,Easy,2991,189,Algorithms,33.7%,941,false,Array;,true,false,33.71740174693179,462566,1371890
979,"DI String Match",di-string-match,false,Easy,2496,1045,Algorithms,79.5%,942,false,Array;Two Pointers;String;Greedy;,true,false,79.53155497722837,171135,215179
980,"Find the Shortest Superstring",find-the-shortest-superstring,false,Hard,1464,150,Algorithms,44.3%,943,false,Array;String;Dynamic Programming;Bit Manipulation;Bitmask;,true,false,44.280632580465436,30996,69999
981,"Delete Columns to Make Sorted",delete-columns-to-make-sorted,false,Easy,1726,2892,Algorithms,74.7%,944,false,Array;String;,true,false,74.68986905582356,199410,266984
982,"Minimum Increment to Make Array Unique",minimum-increment-to-make-array-unique,false,Medium,2687,83,Algorithms,60.1%,945,false,Array;Greedy;Sorting;Counting;,true,false,60.14763457412637,248112,412505
983,"Validate Stack Sequences",validate-stack-sequences,false,Medium,5970,124,Algorithms,69.7%,946,false,Array;Stack;Simulation;,true,false,69.72441564295221,327946,470346
984,"Most Stones Removed with Same Row or Column",most-stones-removed-with-same-row-or-column,false,Medium,5970,689,Algorithms,62.1%,947,false,Hash Table;Depth-First Search;Union Find;Graph;,true,false,62.114039795924306,320557,516080
985,"Bag of Tokens",bag-of-tokens,false,Medium,3315,539,Algorithms,59.0%,948,false,Array;Two Pointers;Greedy;Sorting;,true,false,59.0109898213263,240075,406831
986,"Largest Time for Given Digits",largest-time-for-given-digits,false,Medium,725,1065,Algorithms,35.4%,949,false,Array;String;Enumeration;,true,false,35.44957842510578,93170,262824
987,"Reveal Cards In Increasing Order",reveal-cards-in-increasing-order,false,Medium,3525,670,Algorithms,83.1%,950,false,Array;Queue;Sorting;Simulation;,true,false,83.09297269263757,208285,250665
988,"Flip Equivalent Binary Trees",flip-equivalent-binary-trees,false,Medium,2830,116,Algorithms,69.8%,951,false,Tree;Depth-First Search;Binary Tree;,true,false,69.82554684784681,249118,356771
989,"Largest Component Size by Common Factor",largest-component-size-by-common-factor,false,Hard,1663,94,Algorithms,41.1%,952,false,Array;Hash Table;Math;Union Find;Number Theory;,true,false,41.134654522885064,56997,138562
990,"Verifying an Alien Dictionary",verifying-an-alien-dictionary,false,Easy,4929,1649,Algorithms,55.4%,953,false,Array;Hash Table;String;,true,false,55.370314445634946,535380,966908
991,"Array of Doubled Pairs",array-of-doubled-pairs,false,Medium,1545,172,Algorithms,39.2%,954,false,Array;Hash Table;Greedy;Sorting;,true,false,39.22314638285391,93608,238655
992,"Delete Columns to Make Sorted II",delete-columns-to-make-sorted-ii,false,Medium,673,90,Algorithms,35.4%,955,false,Array;String;Greedy;,true,false,35.389605098032824,21713,61356
993,"Tallest Billboard",tallest-billboard,false,Hard,2404,57,Algorithms,52.0%,956,false,Array;Dynamic Programming;,true,false,52.01569806279225,62294,119760
994,"Prison Cells After N Days",prison-cells-after-n-days,false,Medium,1515,1761,Algorithms,39.0%,957,false,Array;Hash Table;Math;Bit Manipulation;,true,false,38.97716688775366,165720,425172
998,"Check Completeness of a Binary Tree",check-completeness-of-a-binary-tree,false,Medium,4356,63,Algorithms,57.8%,958,false,Tree;Breadth-First Search;Binary Tree;,true,false,57.754583428764626,264773,458445
999,"Regions Cut By Slashes",regions-cut-by-slashes,false,Medium,3893,839,Algorithms,77.8%,959,false,Array;Hash Table;Depth-First Search;Breadth-First Search;Union Find;Matrix;,true,false,77.83101794082577,140340,180314
1000,"Delete Columns to Make Sorted III",delete-columns-to-make-sorted-iii,false,Hard,611,14,Algorithms,58.3%,960,false,Array;String;Dynamic Programming;,true,false,58.312945042906705,15969,27385
1001,"N-Repeated Element in Size 2N Array",n-repeated-element-in-size-2n-array,false,Easy,1372,333,Algorithms,77.2%,961,false,Array;Hash Table;,true,false,77.16972241261138,252203,326816
1002,"Maximum Width Ramp",maximum-width-ramp,false,Medium,2638,88,Algorithms,55.5%,962,false,Array;Two Pointers;Stack;Monotonic Stack;,true,false,55.532715414934366,179921,323991
1003,"Minimum Area Rectangle II",minimum-area-rectangle-ii,false,Medium,393,466,Algorithms,55.3%,963,false,Array;Math;Geometry;,true,false,55.30947308112366,30892,55853
1004,"Least Operators to Express Number",least-operators-to-express-number,false,Hard,321,71,Algorithms,48.5%,964,false,Math;Dynamic Programming;Memoization;,true,false,48.464103134029784,10902,22495
1005,"Univalued Binary Tree",univalued-binary-tree,false,Easy,1923,64,Algorithms,71.7%,965,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,71.68325303782174,237916,331899
1006,"Vowel Spellchecker",vowel-spellchecker,false,Medium,431,814,Algorithms,51.4%,966,false,Array;Hash Table;String;,true,false,51.41416740747672,43955,85492
1007,"Numbers With Same Consecutive Differences",numbers-with-same-consecutive-differences,false,Medium,2834,198,Algorithms,58.4%,967,false,Backtracking;Breadth-First Search;,true,false,58.43133015086243,140518,240484
1008,"Binary Tree Cameras",binary-tree-cameras,false,Hard,5421,81,Algorithms,46.9%,968,false,Dynamic Programming;Tree;Depth-First Search;Binary Tree;,true,false,46.90305454679521,152661,325482
1009,"Pancake Sorting",pancake-sorting,false,Medium,1534,1545,Algorithms,70.9%,969,false,Array;Two Pointers;Greedy;Sorting;,true,false,70.92406967426298,100898,142261
1010,"Powerful Integers",powerful-integers,false,Medium,397,84,Algorithms,43.9%,970,false,Hash Table;Math;Enumeration;,true,false,43.92529059581664,57666,131282
1011,"Flip Binary Tree To Match Preorder Traversal",flip-binary-tree-to-match-preorder-traversal,false,Medium,964,275,Algorithms,50.9%,971,false,Tree;Depth-First Search;Binary Tree;,true,false,50.913158196627286,44381,87170
1012,"Equal Rational Numbers",equal-rational-numbers,false,Hard,99,218,Algorithms,44.3%,972,false,Math;String;,true,false,44.296019235907025,8290,18715
1014,"K Closest Points to Origin",k-closest-points-to-origin,false,Medium,8592,317,Algorithms,67.3%,973,false,Array;Math;Divide and Conquer;Geometry;Sorting;Heap (Priority Queue);Quickselect;,true,true,67.31859850270385,1379552,2049289
1016,"Subarray Sums Divisible by K",subarray-sums-divisible-by-k,false,Medium,7366,327,Algorithms,55.5%,974,false,Array;Hash Table;Prefix Sum;,true,false,55.49735624827795,380685,685954
1017,"Odd Even Jump",odd-even-jump,false,Hard,2049,517,Algorithms,40.4%,975,false,Array;Dynamic Programming;Stack;Monotonic Stack;Ordered Set;,true,false,40.416688473683294,92669,229283
1018,"Largest Perimeter Triangle",largest-perimeter-triangle,false,Easy,3008,415,Algorithms,56.7%,976,false,Array;Math;Greedy;Sorting;,true,false,56.741946487767756,259490,457316
1019,"Squares of a Sorted Array",squares-of-a-sorted-array,false,Easy,9506,245,Algorithms,73.0%,977,false,Array;Two Pointers;Sorting;,true,true,73.02849404808326,2060087,2820937
1020,"Longest Turbulent Subarray",longest-turbulent-subarray,false,Medium,2019,239,Algorithms,47.7%,978,false,Array;Dynamic Programming;Sliding Window;,true,false,47.67908896505509,111704,234283
1021,"Distribute Coins in Binary Tree",distribute-coins-in-binary-tree,false,Medium,5890,238,Algorithms,77.2%,979,false,Tree;Depth-First Search;Binary Tree;,true,false,77.17862066898454,205998,266911
1022,"Unique Paths III",unique-paths-iii,false,Hard,5223,191,Algorithms,82.1%,980,false,Array;Backtracking;Bit Manipulation;Matrix;,true,false,82.08404948531495,217297,264725
1023,"Time Based Key-Value Store",time-based-key-value-store,false,Medium,4913,638,Algorithms,49.3%,981,false,Hash Table;String;Binary Search;Design;,true,false,49.29647516354072,526301,1067624
1024,"Triples with Bitwise AND Equal To Zero",triples-with-bitwise-and-equal-to-zero,false,Hard,458,221,Algorithms,58.8%,982,false,Array;Hash Table;Bit Manipulation;,false,false,58.842443729903536,20313,34521
1025,"Minimum Cost For Tickets",minimum-cost-for-tickets,false,Medium,8451,177,Algorithms,67.4%,983,false,Array;Dynamic Programming;,true,false,67.414753448273,406295,602681
1026,"String Without AAA or BBB",string-without-aaa-or-bbb,false,Medium,832,370,Algorithms,44.4%,984,false,String;Greedy;,true,false,44.384051826476274,52343,117932
1027,"Sum of Even Numbers After Queries",sum-of-even-numbers-after-queries,false,Medium,2097,321,Algorithms,68.3%,985,false,Array;Simulation;,true,false,68.34810583054966,144043,210750
1028,"Interval List Intersections",interval-list-intersections,false,Medium,5657,117,Algorithms,72.3%,986,false,Array;Two Pointers;Line Sweep;,true,false,72.26639576756116,468793,648702
1029,"Vertical Order Traversal of a Binary Tree",vertical-order-traversal-of-a-binary-tree,false,Hard,7869,4360,Algorithms,49.8%,987,false,Hash Table;Tree;Depth-First Search;Breadth-First Search;Sorting;Binary Tree;,true,true,49.775421827233984,519077,1042840
1030,"Smallest String Starting From Leaf",smallest-string-starting-from-leaf,false,Medium,2317,333,Algorithms,60.6%,988,false,String;Backtracking;Tree;Depth-First Search;Binary Tree;,true,false,60.634787395492125,199369,328803
1031,"Add to Array-Form of Integer",add-to-array-form-of-integer,false,Easy,3496,299,Algorithms,45.0%,989,false,Array;Math;,true,false,45.009608940671725,284089,631179
1032,"Satisfiability of Equality Equations",satisfiability-of-equality-equations,false,Medium,3810,62,Algorithms,50.8%,990,false,Array;String;Union Find;Graph;,true,false,50.83132961579781,139104,273658
1033,"Broken Calculator",broken-calculator,false,Medium,2743,211,Algorithms,54.8%,991,false,Math;Greedy;,true,false,54.83943708168055,107006,195126
1034,"Subarrays with K Different Integers",subarrays-with-k-different-integers,false,Hard,6233,101,Algorithms,64.7%,992,false,Array;Hash Table;Sliding Window;Counting;,true,false,64.73507146751489,257653,398012
1035,"Cousins in Binary Tree",cousins-in-binary-tree,false,Easy,4153,213,Algorithms,57.4%,993,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,57.359153726737546,302238,526922
1036,"Rotting Oranges",rotting-oranges,false,Medium,13426,421,Algorithms,55.6%,994,false,Array;Breadth-First Search;Matrix;,true,false,55.55445023872253,1072221,1930046
1037,"Minimum Number of K Consecutive Bit Flips",minimum-number-of-k-consecutive-bit-flips,false,Hard,1915,89,Algorithms,62.7%,995,false,Array;Bit Manipulation;Queue;Sliding Window;Prefix Sum;,true,false,62.689285784612956,127342,203132
1038,"Number of Squareful Arrays",number-of-squareful-arrays,false,Hard,997,45,Algorithms,50.3%,996,false,Array;Hash Table;Math;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,true,false,50.33571252190069,42807,85043
1039,"Find the Town Judge",find-the-town-judge,false,Easy,6704,610,Algorithms,49.8%,997,false,Array;Hash Table;Graph;,true,false,49.82501413196832,636386,1277240
1040,"Maximum Binary Tree II",maximum-binary-tree-ii,false,Medium,541,794,Algorithms,70.5%,998,false,Tree;Binary Tree;,false,false,70.46519949901592,39383,55890
1041,"Available Captures for Rook",available-captures-for-rook,false,Easy,739,639,Algorithms,69.9%,999,false,Array;Matrix;Simulation;,false,false,69.88808891774725,73191,104726
1042,"Minimum Cost to Merge Stones",minimum-cost-to-merge-stones,false,Hard,2519,113,Algorithms,43.8%,1000,false,Array;Dynamic Programming;Prefix Sum;,false,false,43.835769500340284,43155,98447
1043,"Grid Illumination",grid-illumination,false,Hard,619,154,Algorithms,37.5%,1001,false,Array;Hash Table;,false,false,37.542723807019854,22847,60856
1044,"Find Common Characters",find-common-characters,false,Easy,4332,419,Algorithms,74.6%,1002,false,Array;Hash Table;String;,true,false,74.58764957809422,380534,510183
1045,"Check If Word Is Valid After Substitutions",check-if-word-is-valid-after-substitutions,false,Medium,1017,470,Algorithms,60.4%,1003,false,String;Stack;,false,false,60.371389270976614,70222,116314
1046,"Max Consecutive Ones III",max-consecutive-ones-iii,false,Medium,9023,153,Algorithms,64.8%,1004,false,Array;Binary Search;Sliding Window;Prefix Sum;,true,false,64.80014412760788,802079,1237771
1047,"Maximize Sum Of Array After K Negations",maximize-sum-of-array-after-k-negations,false,Easy,1589,121,Algorithms,51.8%,1005,false,Array;Greedy;Sorting;,false,false,51.77827858454099,104079,201008
1048,"Clumsy Factorial",clumsy-factorial,false,Medium,386,357,Algorithms,58.1%,1006,false,Math;Stack;Simulation;,false,false,58.123966806880865,35512,61097
1049,"Minimum Domino Rotations For Equal Row",minimum-domino-rotations-for-equal-row,false,Medium,2859,255,Algorithms,52.3%,1007,false,Array;Greedy;,true,false,52.28749101900255,211048,403630
1050,"Construct Binary Search Tree from Preorder Traversal",construct-binary-search-tree-from-preorder-traversal,false,Medium,6303,85,Algorithms,82.8%,1008,false,Array;Stack;Tree;Binary Search Tree;Monotonic Stack;Binary Tree;,true,false,82.83758008704551,416060,502261
1054,"Complement of Base 10 Integer",complement-of-base-10-integer,false,Easy,2487,117,Algorithms,60.8%,1009,false,Bit Manipulation;,true,false,60.753318019677096,277443,456672
1055,"Pairs of Songs With Total Durations Divisible by 60",pairs-of-songs-with-total-durations-divisible-by-60,false,Medium,4255,175,Algorithms,53.1%,1010,false,Array;Hash Table;Counting;,true,true,53.09034935323294,294893,555455
1056,"Capacity To Ship Packages Within D Days",capacity-to-ship-packages-within-d-days,false,Medium,9856,247,Algorithms,71.0%,1011,false,Array;Binary Search;,true,false,70.9752391431299,482499,679816
1057,"Numbers With Repeated Digits",numbers-with-repeated-digits,false,Hard,790,88,Algorithms,42.8%,1012,false,Math;Dynamic Programming;,false,false,42.76901068442934,19134,44738
1062,"Partition Array Into Three Parts With Equal Sum",partition-array-into-three-parts-with-equal-sum,false,Easy,1736,163,Algorithms,42.0%,1013,false,Array;Greedy;,false,false,42.02827200200156,104149,247807
1063,"Best Sightseeing Pair",best-sightseeing-pair,false,Medium,3201,73,Algorithms,62.5%,1014,false,Array;Dynamic Programming;,true,false,62.53215421366535,197635,316054
1064,"Smallest Integer Divisible by K",smallest-integer-divisible-by-k,false,Medium,1152,855,Algorithms,46.6%,1015,false,Hash Table;Math;,true,false,46.59132258824033,65301,140157
1065,"Binary String With Substrings Representing 1 To N",binary-string-with-substrings-representing-1-to-n,false,Medium,364,533,Algorithms,57.8%,1016,false,String;,false,false,57.80086870295108,41386,71601
1070,"Convert to Base -2",convert-to-base-2,false,Medium,526,295,Algorithms,61.1%,1017,false,Math;,false,false,61.078253872460266,30362,49710
1071,"Binary Prefix Divisible By 5",binary-prefix-divisible-by-5,false,Easy,743,192,Algorithms,46.8%,1018,false,Array;Bit Manipulation;,false,false,46.84414208271265,61007,130234
1072,"Next Greater Node In Linked List",next-greater-node-in-linked-list,false,Medium,3358,120,Algorithms,61.7%,1019,false,Array;Linked List;Stack;Monotonic Stack;,true,false,61.651248713211956,174875,283652
1073,"Number of Enclaves",number-of-enclaves,false,Medium,4187,79,Algorithms,69.8%,1020,false,Array;Depth-First Search;Breadth-First Search;Union Find;Matrix;,true,false,69.77627432949801,273922,392573
1078,"Remove Outermost Parentheses",remove-outermost-parentheses,false,Easy,3125,1640,Algorithms,84.5%,1021,false,String;Stack;,false,false,84.50260745728669,410602,485906
1079,"Sum of Root To Leaf Binary Numbers",sum-of-root-to-leaf-binary-numbers,false,Easy,3377,190,Algorithms,73.3%,1022,false,Tree;Depth-First Search;Binary Tree;,true,false,73.2726477252692,224418,306278
1080,"Camelcase Matching",camelcase-matching,false,Medium,936,339,Algorithms,63.0%,1023,false,Array;Two Pointers;String;Trie;String Matching;,false,false,63.03596901783715,53469,84823
1081,"Video Stitching",video-stitching,false,Medium,1788,61,Algorithms,51.6%,1024,false,Array;Dynamic Programming;Greedy;,false,false,51.642559964258794,73979,143252
1086,"Divisor Game",divisor-game,false,Easy,2258,4170,Algorithms,69.7%,1025,false,Math;Dynamic Programming;Brainteaser;Game Theory;,false,false,69.72368193992345,294949,423026
1092,"Maximum Difference Between Node and Ancestor",maximum-difference-between-node-and-ancestor,false,Medium,4975,167,Algorithms,78.1%,1026,false,Tree;Depth-First Search;Binary Tree;,true,false,78.06332419049524,343520,440053
1087,"Longest Arithmetic Subsequence",longest-arithmetic-subsequence,false,Medium,4736,213,Algorithms,49.3%,1027,false,Array;Hash Table;Binary Search;Dynamic Programming;,true,false,49.28551164721087,187626,380692
1093,"Recover a Tree From Preorder Traversal",recover-a-tree-from-preorder-traversal,false,Hard,1649,46,Algorithms,75.2%,1028,false,String;Tree;Depth-First Search;Binary Tree;,false,false,75.22302620139901,56242,74767
1095,"Two City Scheduling",two-city-scheduling,false,Medium,4770,356,Algorithms,67.3%,1029,false,Array;Greedy;Sorting;,true,false,67.29915989648212,257708,382929
1094,"Matrix Cells in Distance Order",matrix-cells-in-distance-order,false,Easy,775,331,Algorithms,72.1%,1030,false,Array;Math;Geometry;Sorting;Matrix;,false,false,72.12135293922395,65184,90381
1096,"Maximum Sum of Two Non-Overlapping Subarrays",maximum-sum-of-two-non-overlapping-subarrays,false,Medium,2583,84,Algorithms,60.0%,1031,false,Array;Dynamic Programming;Sliding Window;,false,false,60.01574652860619,75465,125742
1097,"Stream of Characters",stream-of-characters,false,Hard,1834,185,Algorithms,52.3%,1032,false,Array;String;Design;Trie;Data Stream;,true,false,52.2671861953799,93898,179650
1103,"Moving Stones Until Consecutive",moving-stones-until-consecutive,false,Medium,230,654,Algorithms,49.1%,1033,false,Math;Brainteaser;,false,false,49.11942615491676,27528,56043
1104,"Coloring A Border",coloring-a-border,false,Medium,762,900,Algorithms,49.4%,1034,false,Array;Depth-First Search;Breadth-First Search;Matrix;,false,false,49.39474276567542,39498,79965
1105,"Uncrossed Lines",uncrossed-lines,false,Medium,3864,58,Algorithms,63.8%,1035,false,Array;Dynamic Programming;,true,false,63.81166591692907,170224,266760
1106,"Escape a Large Maze",escape-a-large-maze,false,Hard,682,170,Algorithms,35.1%,1036,false,Array;Hash Table;Depth-First Search;Breadth-First Search;,false,false,35.14746570907164,23882,67948
1115,"Valid Boomerang",valid-boomerang,false,Easy,433,532,Algorithms,37.5%,1037,false,Array;Math;Geometry;,false,false,37.4954443201669,59671,159142
1114,"Binary Search Tree to Greater Sum Tree",binary-search-tree-to-greater-sum-tree,false,Medium,4375,167,Algorithms,88.3%,1038,false,Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,false,88.30652702449972,302192,342208
1111,"Minimum Score Triangulation of Polygon",minimum-score-triangulation-of-polygon,false,Medium,1872,177,Algorithms,60.0%,1039,false,Array;Dynamic Programming;,false,false,59.95897072759271,57578,96029
1113,"Moving Stones Until Consecutive II",moving-stones-until-consecutive-ii,false,Medium,382,666,Algorithms,57.5%,1040,false,Array;Math;Two Pointers;Sorting;,false,false,57.45614035087719,11659,20292
1119,"Robot Bounded In Circle",robot-bounded-in-circle,false,Medium,3780,707,Algorithms,56.0%,1041,false,Math;String;Simulation;,true,false,56.03624533227883,249405,445078
1120,"Flower Planting With No Adjacent",flower-planting-with-no-adjacent,false,Medium,1481,719,Algorithms,51.9%,1042,false,Depth-First Search;Breadth-First Search;Graph;,false,false,51.91817692445721,86800,167187
1121,"Partition Array for Maximum Sum",partition-array-for-maximum-sum,false,Medium,4799,429,Algorithms,76.8%,1043,false,Array;Dynamic Programming;,true,false,76.75930762441686,213080,277595
1122,"Longest Duplicate Substring",longest-duplicate-substring,false,Hard,2265,389,Algorithms,30.6%,1044,false,String;Binary Search;Sliding Window;Rolling Hash;Suffix Array;Hash Function;,true,false,30.602636137935686,72602,237241
1135,"Customers Who Bought All Products",customers-who-bought-all-products,false,Medium,834,78,Database,62.7%,1045,false,Database;,true,false,62.67964614180037,268173,427850
1127,"Last Stone Weight",last-stone-weight,false,Easy,6185,139,Algorithms,65.7%,1046,false,Array;Heap (Priority Queue);,true,false,65.71829557796886,710351,1080903
1128,"Remove All Adjacent Duplicates In String",remove-all-adjacent-duplicates-in-string,false,Easy,6734,265,Algorithms,70.7%,1047,false,String;Stack;,true,false,70.67696184884313,659043,932473
1129,"Longest String Chain",longest-string-chain,false,Medium,7430,260,Algorithms,61.5%,1048,false,Array;Hash Table;Two Pointers;String;Dynamic Programming;Sorting;,true,false,61.54739686342238,441898,717980
1130,"Last Stone Weight II",last-stone-weight-ii,false,Medium,3196,128,Algorithms,56.6%,1049,false,Array;Dynamic Programming;,false,false,56.6126593945116,100736,177939
1136,"Actors and Directors Who Cooperated At Least Three Times",actors-and-directors-who-cooperated-at-least-three-times,false,Easy,685,52,Database,70.4%,1050,false,Database;,true,false,70.41275573198094,212148,301292
1137,"Height Checker",height-checker,false,Easy,1644,114,Algorithms,81.0%,1051,false,Array;Sorting;Counting Sort;,true,false,80.95983291597337,539590,666491
1138,"Grumpy Bookstore Owner",grumpy-bookstore-owner,false,Medium,2493,241,Algorithms,64.1%,1052,false,Array;Sliding Window;,true,false,64.13433261195689,204778,319296
1139,"Previous Permutation With One Swap",previous-permutation-with-one-swap,false,Medium,456,43,Algorithms,49.5%,1053,false,Array;Greedy;,false,false,49.509691346683816,43117,87088
1140,"Distant Barcodes",distant-barcodes,false,Medium,1288,51,Algorithms,47.0%,1054,false,Array;Hash Table;Greedy;Sorting;Heap (Priority Queue);Counting;,false,false,47.02473990741202,47234,100445
1051,"Shortest Way to Form String",shortest-way-to-form-string,true,Medium,1293,71,Algorithms,60.6%,1055,true,Two Pointers;String;Binary Search;Greedy;,true,false,60.64231777628278,96447,159044
1069,"Confusing Number",confusing-number,true,Easy,322,181,Algorithms,49.1%,1056,true,Math;,true,true,49.09484084078126,49493,100811
1052,"Campus Bikes",campus-bikes,true,Medium,989,196,Algorithms,58.9%,1057,true,Array;Greedy;Sorting;,true,false,58.853257592586715,74181,126044
1053,"Minimize Rounding Error to Meet Target",minimize-rounding-error-to-meet-target,true,Medium,153,148,Algorithms,45.4%,1058,true,Array;Math;String;Greedy;Sorting;,false,false,45.35310926656688,9999,22047
511,"All Paths from Source Lead to Destination",all-paths-from-source-lead-to-destination,true,Medium,726,408,Algorithms,37.2%,1059,true,Graph;Topological Sort;,true,true,37.19502233639226,66026,177510
1059,"Missing Element in Sorted Array",missing-element-in-sorted-array,true,Medium,1677,62,Algorithms,58.0%,1060,true,Array;Binary Search;,true,false,57.97368131954362,147761,254876
1058,"Lexicographically Smallest Equivalent String",lexicographically-smallest-equivalent-string,false,Medium,2388,153,Algorithms,76.6%,1061,false,String;Union Find;,true,false,76.5733101816448,85112,111151
1060,"Longest Repeating Substring",longest-repeating-substring,true,Medium,712,74,Algorithms,62.6%,1062,true,String;Binary Search;Dynamic Programming;Rolling Hash;Suffix Array;Hash Function;,true,false,62.59272816007808,51301,81960
1061,"Number of Valid Subarrays",number-of-valid-subarrays,true,Hard,317,17,Algorithms,79.2%,1063,true,Array;Stack;Monotonic Stack;,true,false,79.22641890527167,15690,19804
1066,"Fixed Point",fixed-point,true,Easy,440,67,Algorithms,64.1%,1064,true,Array;Binary Search;,true,false,64.10093240738179,46336,72286
1075,"Index Pairs of a String",index-pairs-of-a-string,true,Easy,381,108,Algorithms,67.9%,1065,true,Array;String;Trie;Sorting;,true,false,67.90762771168649,29112,42870
1067,"Campus Bikes II",campus-bikes-ii,true,Medium,940,86,Algorithms,55.3%,1066,true,Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,true,false,55.27419932952413,52432,94858
1068,"Digit Count in Range",digit-count-in-range,true,Hard,94,25,Algorithms,46.5%,1067,true,Math;Dynamic Programming;,false,false,46.50711513583441,4314,9276
1153,"Product Sales Analysis I",product-sales-analysis-i,false,Easy,1073,228,Database,85.1%,1068,false,Database;,true,false,85.05552560288815,768263,903247
1154,"Product Sales Analysis II",product-sales-analysis-ii,true,Easy,83,182,Database,82.2%,1069,true,Database;,true,false,82.15101651291246,56814,69158
1155,"Product Sales Analysis III",product-sales-analysis-iii,false,Medium,507,990,Database,44.3%,1070,false,Database;,true,false,44.33716631470775,243335,548820
1146,"Greatest Common Divisor of Strings",greatest-common-divisor-of-strings,false,Easy,5429,1481,Algorithms,52.3%,1071,false,Math;String;,true,false,52.27860226376635,648374,1240230
1147,"Flip Columns For Maximum Number of Equal Rows",flip-columns-for-maximum-number-of-equal-rows,false,Medium,1301,122,Algorithms,78.6%,1072,false,Array;Hash Table;Matrix;,true,false,78.56971814122518,111558,141986
1148,"Adding Two Negabinary Numbers",adding-two-negabinary-numbers,false,Medium,324,127,Algorithms,36.9%,1073,false,Array;Math;,false,false,36.92903673437922,19161,51886
1145,"Number of Submatrices That Sum to Target",number-of-submatrices-that-sum-to-target,false,Hard,3758,103,Algorithms,74.4%,1074,false,Array;Hash Table;Matrix;Prefix Sum;,true,false,74.39191904090005,159224,214032
1161,"Project Employees I",project-employees-i,false,Easy,722,181,Database,64.5%,1075,false,Database;,true,false,64.46361211643172,379208,588251
1162,"Project Employees II",project-employees-ii,true,Easy,204,63,Database,50.1%,1076,true,Database;,false,false,50.1462723219804,60850,121347
1163,"Project Employees III",project-employees-iii,true,Medium,275,9,Database,76.8%,1077,true,Database;,true,false,76.80929289474648,62883,81869
1156,"Occurrences After Bigram",occurrences-after-bigram,false,Easy,506,363,Algorithms,63.6%,1078,false,String;,false,false,63.570000799552254,79507,125070
1160,"Letter Tile Possibilities",letter-tile-possibilities,false,Medium,2526,71,Algorithms,76.4%,1079,false,Hash Table;String;Backtracking;Counting;,false,false,76.40879370396586,109030,142693
1157,"Insufficient Nodes in Root to Leaf Paths",insufficient-nodes-in-root-to-leaf-paths,false,Medium,712,721,Algorithms,56.5%,1080,false,Tree;Depth-First Search;Binary Tree;,false,false,56.5134230480224,41365,73195
1159,"Smallest Subsequence of Distinct Characters",smallest-subsequence-of-distinct-characters,false,Medium,2639,198,Algorithms,61.6%,1081,false,String;Stack;Greedy;Monotonic Stack;,false,false,61.550744639876754,76707,124624
1172,"Sales Analysis I",sales-analysis-i,true,Easy,198,79,Database,74.6%,1082,true,Database;,true,false,74.63658606793322,62229,83376
1173,"Sales Analysis II",sales-analysis-ii,true,Easy,273,47,Database,49.8%,1083,true,Database;,true,false,49.835111856551364,61505,123417
1174,"Sales Analysis III",sales-analysis-iii,false,Easy,747,157,Database,46.8%,1084,false,Database;,true,false,46.82172212052691,156540,334332
1082,"Sum of Digits in the Minimum Number",sum-of-digits-in-the-minimum-number,true,Easy,120,151,Algorithms,76.6%,1085,true,Array;Math;,false,false,76.61364613400478,24950,32566
1074,"High Five",high-five,true,Easy,810,128,Algorithms,74.4%,1086,true,Array;Hash Table;Sorting;Heap (Priority Queue);,true,false,74.44384558377686,110497,148430
1076,"Brace Expansion",brace-expansion,true,Medium,648,54,Algorithms,66.6%,1087,true,String;Backtracking;Breadth-First Search;,true,false,66.56808630371532,55597,83519
1077,"Confusing Number II",confusing-number-ii,true,Hard,494,144,Algorithms,47.1%,1088,true,Math;Backtracking;,true,false,47.07246592501643,37955,80631
1168,"Duplicate Zeros",duplicate-zeros,false,Easy,2662,765,Algorithms,52.4%,1089,false,Array;Two Pointers;,true,false,52.39450035294756,463157,883982
1169,"Largest Values From Labels",largest-values-from-labels,false,Medium,471,633,Algorithms,62.7%,1090,false,Array;Hash Table;Greedy;Sorting;Counting;,false,false,62.71752687533409,42239,67348
1171,"Shortest Path in Binary Matrix",shortest-path-in-binary-matrix,false,Medium,6769,253,Algorithms,48.8%,1091,false,Array;Breadth-First Search;Matrix;,true,false,48.766473842641,587755,1205244
1170,"Shortest Common Supersequence ",shortest-common-supersequence,false,Hard,5045,73,Algorithms,59.7%,1092,false,String;Dynamic Programming;,false,false,59.68351838917122,148678,249110
1183,"Statistics from a Large Sample",statistics-from-a-large-sample,false,Medium,162,105,Algorithms,42.2%,1093,false,Array;Math;Probability and Statistics;,false,false,42.157034613062194,21643,51339
1184,"Car Pooling",car-pooling,false,Medium,4540,106,Algorithms,56.0%,1094,false,Array;Sorting;Heap (Priority Queue);Simulation;Prefix Sum;,true,false,55.95117059169347,242688,433748
1185,"Find in Mountain Array",find-in-mountain-array,false,Hard,3349,136,Algorithms,40.2%,1095,false,Array;Binary Search;Interactive;,true,false,40.19506203298102,153145,381002
1188,"Brace Expansion II",brace-expansion-ii,false,Hard,486,290,Algorithms,63.5%,1096,false,String;Backtracking;Stack;Breadth-First Search;,false,false,63.471030173357,26105,41129
1193,"Game Play Analysis V",game-play-analysis-v,true,Hard,188,35,Database,50.7%,1097,true,Database;,true,false,50.67786442711457,25344,50010
1198,"Unpopular Books",unpopular-books,true,Medium,207,612,Database,43.3%,1098,true,Database;,false,false,43.29652757395731,42780,98807
1083,"Two Sum Less Than K",two-sum-less-than-k,true,Easy,1152,131,Algorithms,62.0%,1099,true,Array;Two Pointers;Binary Search;Sorting;,true,true,61.952863445890515,139713,225515
1084,"Find K-Length Substrings With No Repeated Characters",find-k-length-substrings-with-no-repeated-characters,true,Medium,584,11,Algorithms,75.0%,1100,true,Hash Table;String;Sliding Window;,true,false,75.01374610527017,45021,60017
1085,"The Earliest Moment When Everyone Become Friends",the-earliest-moment-when-everyone-become-friends,true,Medium,1068,37,Algorithms,65.5%,1101,true,Array;Union Find;Sorting;,true,false,65.52818939742066,109799,167558
1099,"Path With Maximum Minimum Value",path-with-maximum-minimum-value,true,Medium,1309,124,Algorithms,53.9%,1102,true,Array;Binary Search;Depth-First Search;Breadth-First Search;Union Find;Heap (Priority Queue);Matrix;,true,false,53.87081997251488,64680,120065
1195,"Distribute Candies to People",distribute-candies-to-people,false,Easy,990,197,Algorithms,65.9%,1103,false,Math;Simulation;,true,false,65.94340607705962,94731,143655
1194,"Path In Zigzag Labelled Binary Tree",path-in-zigzag-labelled-binary-tree,false,Medium,1505,322,Algorithms,75.4%,1104,false,Math;Tree;Binary Tree;,false,false,75.44265059488492,48318,64046
1196,"Filling Bookcase Shelves",filling-bookcase-shelves,false,Medium,2572,251,Algorithms,68.7%,1105,false,Array;Dynamic Programming;,true,false,68.74997053040555,145806,212082
1197,"Parsing A Boolean Expression",parsing-a-boolean-expression,false,Hard,1767,81,Algorithms,70.5%,1106,false,String;Stack;Recursion;,true,false,70.4628014708333,126857,180034
1204,"New Users Daily Count",new-users-daily-count,true,Medium,156,168,Database,44.8%,1107,true,Database;,true,false,44.7617399330795,38794,86669
1205,"Defanging an IP Address",defanging-an-ip-address,false,Easy,2178,1766,Algorithms,89.5%,1108,false,String;,false,false,89.46564847408324,717227,801679
1206,"Corporate Flight Bookings",corporate-flight-bookings,false,Medium,1705,163,Algorithms,63.2%,1109,false,Array;Prefix Sum;,false,false,63.18758935986233,73802,116799
1207,"Delete Nodes And Return Forest",delete-nodes-and-return-forest,false,Medium,4632,143,Algorithms,72.5%,1110,false,Array;Hash Table;Tree;Depth-First Search;Binary Tree;,true,false,72.46213299343998,356455,491919
1208,"Maximum Nesting Depth of Two Valid Parentheses Strings",maximum-nesting-depth-of-two-valid-parentheses-strings,false,Medium,442,1813,Algorithms,72.1%,1111,false,String;Stack;,false,false,72.11185246270335,28857,40017
1214,"Highest Grade For Each Student",highest-grade-for-each-student,true,Medium,306,15,Database,70.9%,1112,true,Database;,true,false,70.9270491112796,67358,94968
1215,"Reported Posts",reported-posts,true,Easy,113,407,Database,65.0%,1113,true,Database;,true,false,65.03696103964434,49445,76026
1203,"Print in Order",print-in-order,false,Easy,1502,210,Concurrency,70.4%,1114,false,Concurrency;,true,false,70.40885574681442,176376,250503
1187,"Print FooBar Alternately",print-foobar-alternately,false,Medium,700,55,Concurrency,67.9%,1115,false,Concurrency;,false,false,67.90704275323753,95698,140925
1216,"Print Zero Even Odd",print-zero-even-odd,false,Medium,505,340,Concurrency,62.3%,1116,false,Concurrency;,false,false,62.26507984074661,58178,93436
1186,"Building H2O",building-h2o,false,Medium,533,170,Concurrency,57.2%,1117,false,Concurrency;,false,false,57.15159787264085,60714,106234
1088,"Number of Days in a Month",number-of-days-in-a-month,true,Easy,44,179,Algorithms,58.8%,1118,true,Math;,false,false,58.80820579615761,9030,15355
1089,"Remove Vowels from a String",remove-vowels-from-a-string,true,Easy,363,115,Algorithms,91.2%,1119,true,String;,true,false,91.18397848336728,113234,124182
1091,"Maximum Average Subtree",maximum-average-subtree,true,Medium,843,36,Algorithms,66.7%,1120,true,Tree;Depth-First Search;Binary Tree;,true,false,66.73009891662741,70834,106150
1118,"Divide Array Into Increasing Sequences",divide-array-into-increasing-sequences,true,Hard,123,30,Algorithms,61.2%,1121,true,Array;Counting;,false,false,61.16644665786632,5097,8333
1217,"Relative Sort Array",relative-sort-array,false,Easy,3207,193,Algorithms,74.9%,1122,false,Array;Hash Table;Sorting;Counting Sort;,true,false,74.86519335848737,354176,473085
1218,"Lowest Common Ancestor of Deepest Leaves",lowest-common-ancestor-of-deepest-leaves,false,Medium,2000,850,Algorithms,72.9%,1123,false,Hash Table;Tree;Depth-First Search;Breadth-First Search;Binary Tree;,false,false,72.91138937295271,121754,166989
1219,"Longest Well-Performing Interval",longest-well-performing-interval,false,Medium,1460,119,Algorithms,35.6%,1124,false,Array;Hash Table;Stack;Monotonic Stack;Prefix Sum;,false,false,35.585369436419725,36338,102114
1220,"Smallest Sufficient Team",smallest-sufficient-team,false,Hard,2198,57,Algorithms,55.4%,1125,false,Array;Dynamic Programming;Bit Manipulation;Bitmask;,true,false,55.436821653490554,66196,119408
1225,"Active Businesses",active-businesses,true,Medium,277,33,Database,65.8%,1126,true,Database;,true,false,65.8435817277898,47811,72613
1226,"User Purchase Platform",user-purchase-platform,true,Hard,184,136,Database,47.0%,1127,true,Database;,false,false,46.97150467523098,16929,36041
1227,"Number of Equivalent Domino Pairs",number-of-equivalent-domino-pairs,false,Easy,699,335,Algorithms,48.9%,1128,false,Array;Hash Table;Counting;,false,false,48.91263397206885,75301,153950
1229,"Shortest Path with Alternating Colors",shortest-path-with-alternating-colors,false,Medium,3560,193,Algorithms,47.1%,1129,false,Breadth-First Search;Graph;,true,false,47.136663538958516,127096,269633
1228,"Minimum Cost Tree From Leaf Values",minimum-cost-tree-from-leaf-values,false,Medium,4323,278,Algorithms,67.7%,1130,false,Array;Dynamic Programming;Stack;Greedy;Monotonic Stack;,false,false,67.69013587436034,107408,158676
1230,"Maximum of Absolute Value Expression",maximum-of-absolute-value-expression,false,Medium,655,408,Algorithms,48.4%,1131,false,Array;Math;,false,false,48.42300897983218,26315,54344
1237,"Reported Posts II",reported-posts-ii,true,Medium,163,569,Database,32.3%,1132,true,Database;,true,false,32.2845164041942,40119,124267
1098,"Largest Unique Number",largest-unique-number,true,Easy,338,18,Algorithms,70.6%,1133,true,Array;Hash Table;Sorting;,true,false,70.60975818752036,82403,116702
1090,"Armstrong Number",armstrong-number,true,Easy,212,20,Algorithms,77.8%,1134,true,Math;,true,false,77.81164704241628,39056,50193
1100,"Connecting Cities With Minimum Cost",connecting-cities-with-minimum-cost,true,Medium,1134,59,Algorithms,62.3%,1135,true,Union Find;Graph;Heap (Priority Queue);Minimum Spanning Tree;,true,false,62.33602322297686,79024,126771
1101,"Parallel Courses",parallel-courses,true,Medium,1180,27,Algorithms,61.6%,1136,true,Graph;Topological Sort;,true,false,61.579853354708156,93726,152203
1236,"N-th Tribonacci Number",n-th-tribonacci-number,false,Easy,4550,195,Algorithms,63.7%,1137,false,Math;Dynamic Programming;Memoization;,true,false,63.71558736060564,873264,1370568
1238,"Alphabet Board Path",alphabet-board-path,false,Medium,916,182,Algorithms,51.5%,1138,false,Hash Table;String;,false,false,51.53633415983215,54040,104858
1239,"Largest 1-Bordered Square",largest-1-bordered-square,false,Medium,728,112,Algorithms,50.6%,1139,false,Array;Dynamic Programming;Matrix;,false,false,50.5625575236199,26919,53239
1240,"Stone Game II",stone-game-ii,false,Medium,3338,906,Algorithms,73.1%,1140,false,Array;Math;Dynamic Programming;Prefix Sum;Game Theory;,false,false,73.1443491234614,180412,246652
1245,"User Activity for the Past 30 Days I",user-activity-for-the-past-30-days-i,false,Easy,760,869,Database,49.2%,1141,false,Database;,true,false,49.229905096315576,320786,651608
1246,"User Activity for the Past 30 Days II",user-activity-for-the-past-30-days-ii,true,Easy,101,375,Database,35.7%,1142,true,Database;,false,false,35.74369470171778,44883,125569
1250,"Longest Common Subsequence",longest-common-subsequence,false,Medium,13926,211,Algorithms,57.9%,1143,false,String;Dynamic Programming;,true,false,57.86474637735613,1309058,2262279
1247,"Decrease Elements To Make Array Zigzag",decrease-elements-to-make-array-zigzag,false,Medium,442,168,Algorithms,48.2%,1144,false,Array;Greedy;,false,false,48.24597606273215,22209,46034
1248,"Binary Tree Coloring Game",binary-tree-coloring-game,false,Medium,1368,220,Algorithms,52.3%,1145,false,Tree;Depth-First Search;Binary Tree;,false,false,52.318163847542934,48963,93587
1249,"Snapshot Array",snapshot-array,false,Medium,3768,516,Algorithms,36.8%,1146,false,Array;Hash Table;Binary Search;Design;,true,false,36.76314648282324,232285,631841
1251,"Longest Chunked Palindrome Decomposition",longest-chunked-palindrome-decomposition,false,Hard,685,32,Algorithms,58.6%,1147,false,Two Pointers;String;Dynamic Programming;Greedy;Rolling Hash;Hash Function;,false,false,58.63824300893611,26379,44986
1258,"Article Views I",article-views-i,false,Easy,1702,99,Database,76.9%,1148,false,Database;,true,false,76.94728791155782,969820,1260369
1259,"Article Views II",article-views-ii,true,Medium,130,28,Database,47.2%,1149,true,Database;,true,false,47.152374303328635,39848,84509
1102,"Check If a Number Is Majority Element in a Sorted Array",check-if-a-number-is-majority-element-in-a-sorted-array,true,Easy,460,35,Algorithms,59.0%,1150,true,Array;Binary Search;,true,false,59.02378499340845,53279,90267
1107,"Minimum Swaps to Group All 1's Together",minimum-swaps-to-group-all-1s-together,true,Medium,1232,17,Algorithms,60.3%,1151,true,Array;Sliding Window;,true,true,60.347663787921924,76306,126444
1108,"Analyze User Website Visit Pattern",analyze-user-website-visit-pattern,true,Medium,511,3796,Algorithms,43.0%,1152,true,Array;Hash Table;Sorting;,false,false,42.98258544922848,107885,250997
1124,"String Transforms Into Another String",string-transforms-into-another-string,true,Hard,883,337,Algorithms,34.8%,1153,true,Hash Table;String;,true,false,34.8464980198607,52882,151757
1260,"Day of the Year",day-of-the-year,false,Easy,467,482,Algorithms,48.8%,1154,false,Math;String;,false,false,48.82288045627693,70364,144111
1263,"Number of Dice Rolls With Target Sum",number-of-dice-rolls-with-target-sum,false,Medium,5142,174,Algorithms,61.3%,1155,false,Dynamic Programming;,true,false,61.33485358983059,310925,506931
1261,"Swap For Longest Repeated Character Substring",swap-for-longest-repeated-character-substring,false,Medium,1038,101,Algorithms,43.8%,1156,false,Hash Table;String;Sliding Window;,false,false,43.779207075021354,34849,79603
1262,"Online Majority Element In Subarray",online-majority-element-in-subarray,false,Hard,640,62,Algorithms,42.0%,1157,false,Array;Binary Search;Design;Binary Indexed Tree;Segment Tree;,false,false,42.03223022924975,18023,42879
1268,"Market Analysis I",market-analysis-i,false,Medium,666,68,Database,57.2%,1158,false,Database;,true,false,57.16537539287523,119676,209352
1269,"Market Analysis II",market-analysis-ii,true,Hard,122,80,Database,57.5%,1159,true,Database;,true,false,57.455156950672645,20500,35680
1112,"Find Words That Can Be Formed by Characters",find-words-that-can-be-formed-by-characters,false,Easy,2150,187,Algorithms,70.8%,1160,false,Array;Hash Table;String;Counting;,true,false,70.82435405654248,282307,398601
1116,"Maximum Level Sum of a Binary Tree",maximum-level-sum-of-a-binary-tree,false,Medium,3618,102,Algorithms,67.2%,1161,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,67.21383413022414,338503,503622
1117,"As Far from Land as Possible",as-far-from-land-as-possible,false,Medium,4166,112,Algorithms,51.7%,1162,false,Array;Dynamic Programming;Breadth-First Search;Matrix;,true,false,51.69967935375004,162687,314676
1133,"Last Substring in Lexicographical Order",last-substring-in-lexicographical-order,false,Hard,604,454,Algorithms,34.5%,1163,false,Two Pointers;String;,false,false,34.534968236437955,36586,105939
1278,"Product Price at a Given Date",product-price-at-a-given-date,false,Medium,1028,268,Database,57.0%,1164,false,Database;,true,false,56.98690150225708,192514,337823
1123,"Single-Row Keyboard",single-row-keyboard,true,Easy,531,22,Algorithms,87.6%,1165,true,Hash Table;String;,true,true,87.61253044361399,88854,101417
1125,"Design File System",design-file-system,true,Medium,590,70,Algorithms,63.6%,1166,true,Hash Table;String;Design;Trie;,true,false,63.587310887047245,67290,105823
1126,"Minimum Cost to Connect Sticks",minimum-cost-to-connect-sticks,true,Medium,1329,158,Algorithms,70.6%,1167,true,Array;Greedy;Heap (Priority Queue);,true,true,70.6376532897882,131503,186166
1144,"Optimize Water Distribution in a Village",optimize-water-distribution-in-a-village,true,Hard,1178,40,Algorithms,64.9%,1168,true,Union Find;Graph;Heap (Priority Queue);Minimum Spanning Tree;,true,false,64.92074775212939,52058,80187
1272,"Invalid Transactions",invalid-transactions,false,Medium,572,2354,Algorithms,31.2%,1169,false,Array;Hash Table;String;Sorting;,false,false,31.154632487727724,85488,274399
1273,"Compare Strings by Frequency of the Smallest Character",compare-strings-by-frequency-of-the-smallest-character,false,Medium,721,976,Algorithms,62.6%,1170,false,Array;Hash Table;String;Binary Search;Sorting;,false,false,62.63093265475204,84667,135184
1267,"Remove Zero Sum Consecutive Nodes from Linked List",remove-zero-sum-consecutive-nodes-from-linked-list,false,Medium,3358,217,Algorithms,52.7%,1171,false,Hash Table;Linked List;,true,false,52.749279822422814,171574,325263
1270,"Dinner Plate Stacks",dinner-plate-stacks,false,Hard,492,66,Algorithms,32.7%,1172,false,Hash Table;Stack;Design;Heap (Priority Queue);,false,false,32.65038087733123,19888,60912
1291,"Immediate Food Delivery I",immediate-food-delivery-i,true,Easy,296,13,Database,80.8%,1173,true,Database;,true,false,80.84815184815184,80929,100100
1292,"Immediate Food Delivery II",immediate-food-delivery-ii,false,Medium,859,146,Database,53.3%,1174,false,Database;,false,false,53.27537891342996,247523,464611
1279,"Prime Arrangements",prime-arrangements,false,Easy,414,526,Algorithms,58.6%,1175,false,Math;,false,false,58.623249536021596,34746,59270
1280,"Diet Plan Performance",diet-plan-performance,true,Easy,158,292,Algorithms,53.9%,1176,true,Array;Sliding Window;,false,false,53.86227406505694,34955,64897
1281,"Can Make Palindrome from Substring",can-make-palindrome-from-substring,false,Medium,825,279,Algorithms,39.8%,1177,false,Array;Hash Table;String;Bit Manipulation;Prefix Sum;,false,false,39.75565137854436,30425,76530
1282,"Number of Valid Words for Each Puzzle",number-of-valid-words-for-each-puzzle,false,Hard,1278,88,Algorithms,46.9%,1178,false,Array;Hash Table;String;Bit Manipulation;Trie;,true,false,46.896451213291556,32178,68615
1301,"Reformat Department Table",reformat-department-table,false,Easy,762,613,Database,76.9%,1179,false,Database;,true,false,76.90396293673003,132464,172246
1131,"Count Substrings with Only One Distinct Letter",count-substrings-with-only-one-distinct-letter,true,Easy,356,51,Algorithms,80.3%,1180,true,Math;String;,true,false,80.30635789941898,28887,35971
1132,"Before and After Puzzle",before-and-after-puzzle,true,Medium,74,154,Algorithms,46.2%,1181,true,Array;Hash Table;String;Sorting;,false,false,46.24894633323968,9876,21354
1134,"Shortest Distance to Target Color",shortest-distance-to-target-color,true,Medium,520,22,Algorithms,55.4%,1182,true,Array;Binary Search;Dynamic Programming;,true,false,55.417326396742816,36750,66315
1152,"Maximum Number of Ones",maximum-number-of-ones,true,Hard,167,29,Algorithms,68.4%,1183,true,Greedy;Heap (Priority Queue);,true,false,68.42642183116551,5366,7842
1287,"Distance Between Bus Stops",distance-between-bus-stops,false,Easy,775,90,Algorithms,54.4%,1184,false,Array;,false,false,54.366796156205275,66477,122275
1289,"Day of the Week",day-of-the-week,false,Easy,413,2477,Algorithms,58.1%,1185,false,Math;,false,false,58.08898075305916,73913,127241
1288,"Maximum Subarray Sum with One Deletion",maximum-subarray-sum-with-one-deletion,false,Medium,1859,68,Algorithms,44.6%,1186,false,Array;Dynamic Programming;,false,false,44.57520579468409,57724,129498
1290,"Make Array Strictly Increasing",make-array-strictly-increasing,false,Hard,2268,50,Algorithms,58.0%,1187,false,Array;Binary Search;Dynamic Programming;Sorting;,true,false,57.9694469437372,60563,104474
1209,"Design Bounded Blocking Queue",design-bounded-blocking-queue,true,Medium,525,43,Concurrency,72.7%,1188,true,Concurrency;,false,false,72.69211478049682,55073,75762
1297,"Maximum Number of Balloons",maximum-number-of-balloons,false,Easy,1765,110,Algorithms,59.7%,1189,false,Hash Table;String;Counting;,true,false,59.717658865135306,247550,414534
1298,"Reverse Substrings Between Each Pair of Parentheses",reverse-substrings-between-each-pair-of-parentheses,false,Medium,2850,125,Algorithms,71.7%,1190,false,String;Stack;,true,false,71.73936456650512,226474,315690
1299,"K-Concatenation Maximum Sum",k-concatenation-maximum-sum,false,Medium,1464,123,Algorithms,24.0%,1191,false,Array;Dynamic Programming;,false,false,24.011247084385083,37574,156485
1300,"Critical Connections in a Network",critical-connections-in-a-network,false,Hard,6335,184,Algorithms,57.0%,1192,false,Depth-First Search;Graph;Biconnected Component;,true,false,56.97787206902355,257284,451551
1317,"Monthly Transactions I",monthly-transactions-i,false,Medium,971,107,Database,58.3%,1193,false,Database;,false,false,58.32323305779782,288712,495009
1318,"Tournament Winners",tournament-winners,true,Hard,151,57,Database,49.4%,1194,true,Database;,true,false,49.41126716673715,22199,44927
1316,"Fizz Buzz Multithreaded",fizz-buzz-multithreaded,false,Medium,623,415,Concurrency,73.2%,1195,false,Concurrency;,false,false,73.24792964069886,55634,75953
1141,"How Many Apples Can You Put into the Basket",how-many-apples-can-you-put-into-the-basket,true,Easy,225,17,Algorithms,67.0%,1196,true,Array;Greedy;Sorting;,true,true,66.95471143201758,40522,60522
1142,"Minimum Knight Moves",minimum-knight-moves,true,Medium,1532,407,Algorithms,41.0%,1197,true,Breadth-First Search;,true,false,41.03813105235469,168496,410584
1143,"Find Smallest Common Element in All Rows",find-smallest-common-element-in-all-rows,true,Medium,581,32,Algorithms,76.5%,1198,true,Array;Hash Table;Binary Search;Matrix;Counting;,true,true,76.45618473114095,47149,61668
1167,"Minimum Time to Build Blocks",minimum-time-to-build-blocks,true,Hard,237,31,Algorithms,46.0%,1199,true,Array;Math;Greedy;Heap (Priority Queue);,true,false,45.974834257881206,6796,14782
1306,"Minimum Absolute Difference",minimum-absolute-difference,false,Easy,2399,78,Algorithms,70.1%,1200,false,Array;Sorting;,true,false,70.10612470053206,218593,311803
1307,"Ugly Number III",ugly-number-iii,false,Medium,1259,507,Algorithms,30.1%,1201,false,Math;Binary Search;Combinatorics;Number Theory;,false,false,30.085998387530232,35824,119071
1308,"Smallest String With Swaps",smallest-string-with-swaps,false,Medium,3753,148,Algorithms,58.9%,1202,false,Array;Hash Table;String;Depth-First Search;Breadth-First Search;Union Find;Sorting;,true,false,58.939747847799,124400,211063
1309,"Sort Items by Groups Respecting Dependencies",sort-items-by-groups-respecting-dependencies,false,Hard,1797,309,Algorithms,65.9%,1203,false,Depth-First Search;Breadth-First Search;Graph;Topological Sort;,true,false,65.86286577135144,57576,87418
1327,"Last Person to Fit in the Bus",last-person-to-fit-in-the-bus,false,Medium,816,39,Database,68.1%,1204,false,Database;,false,false,68.07656673117579,190300,279533
1328,"Monthly Transactions II",monthly-transactions-ii,true,Medium,160,550,Database,41.8%,1205,true,Database;,true,false,41.84293334679523,24866,59427
1337,"Design Skiplist",design-skiplist,false,Hard,682,95,Algorithms,61.8%,1206,false,Linked List;Design;,false,false,61.77036863113406,26308,42590
1319,"Unique Number of Occurrences",unique-number-of-occurrences,false,Easy,5211,144,Algorithms,77.8%,1207,false,Array;Hash Table;,true,true,77.84060315093234,758955,975012
1321,"Get Equal Substrings Within Budget",get-equal-substrings-within-budget,false,Medium,1831,142,Algorithms,58.5%,1208,false,String;Binary Search;Sliding Window;Prefix Sum;,true,false,58.53233439025893,170939,292042
1320,"Remove All Adjacent Duplicates in String II",remove-all-adjacent-duplicates-in-string-ii,false,Medium,5861,118,Algorithms,58.8%,1209,false,String;Stack;,true,false,58.82977161954924,348706,592738
1322,"Minimum Moves to Reach Target with Rotations",minimum-moves-to-reach-target-with-rotations,false,Hard,273,74,Algorithms,50.4%,1210,false,Array;Breadth-First Search;Matrix;,false,false,50.36281716860327,10619,21085
1338,"Queries Quality and Percentage",queries-quality-and-percentage,false,Easy,760,474,Database,44.2%,1211,false,Database;,false,false,44.22056985134851,285810,646326
1339,"Team Scores in Football Tournament",team-scores-in-football-tournament,true,Medium,317,25,Database,55.7%,1212,true,Database;,false,false,55.68689892363544,43717,78505
1149,"Intersection of Three Sorted Arrays",intersection-of-three-sorted-arrays,true,Easy,614,26,Algorithms,80.2%,1213,true,Array;Hash Table;Binary Search;Counting;,true,false,80.1701073492981,97086,121100
1150,"Two Sum BSTs",two-sum-bsts,true,Medium,557,46,Algorithms,67.2%,1214,true,Two Pointers;Binary Search;Stack;Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,false,67.2447262844571,51960,77270
1151,"Stepping Numbers",stepping-numbers,true,Medium,185,21,Algorithms,47.6%,1215,true,Math;Backtracking;Breadth-First Search;,false,false,47.56498076381721,10138,21314
1178,"Valid Palindrome III",valid-palindrome-iii,true,Hard,795,14,Algorithms,49.2%,1216,true,String;Dynamic Programming;,true,false,49.158887011531526,86411,175779
1329,"Minimum Cost to Move Chips to The Same Position",minimum-cost-to-move-chips-to-the-same-position,false,Easy,2331,323,Algorithms,72.0%,1217,false,Array;Math;Greedy;,true,false,71.96231584758672,140777,195626
1330,"Longest Arithmetic Subsequence of Given Difference",longest-arithmetic-subsequence-of-given-difference,false,Medium,3272,90,Algorithms,54.5%,1218,false,Array;Hash Table;Dynamic Programming;,true,false,54.491934367088376,153464,281626
1331,"Path with Maximum Gold",path-with-maximum-gold,false,Medium,3329,98,Algorithms,68.0%,1219,false,Array;Backtracking;Matrix;,true,false,68.04572948854079,228141,335276
1332,"Count Vowels Permutation",count-vowels-permutation,false,Hard,3268,218,Algorithms,61.6%,1220,false,Dynamic Programming;,true,false,61.61990508841445,173086,280893
1341,"Split a String in Balanced Strings",split-a-string-in-balanced-strings,false,Easy,2779,949,Algorithms,86.5%,1221,false,String;Greedy;Counting;,false,false,86.52666537456196,330364,381806
1342,"Queens That Can Attack the King",queens-that-can-attack-the-king,false,Medium,966,151,Algorithms,72.0%,1222,false,Array;Matrix;Simulation;,false,false,72.0397129035318,45568,63254
1343,"Dice Roll Simulation",dice-roll-simulation,false,Hard,957,192,Algorithms,49.7%,1223,false,Array;Dynamic Programming;,false,false,49.72112408445956,32449,65262
1344,"Maximum Equal Frequency",maximum-equal-frequency,false,Hard,549,67,Algorithms,37.3%,1224,false,Array;Hash Table;,false,false,37.283877975921065,16475,44188
1357,"Report Contiguous Dates",report-contiguous-dates,true,Hard,332,23,Database,57.1%,1225,true,Database;,false,false,57.10013983005271,26543,46485
1340,"The Dining Philosophers",the-dining-philosophers,false,Medium,364,337,Concurrency,54.5%,1226,false,Concurrency;,false,false,54.47577141896247,38875,71362
1362,"Airplane Seat Assignment Probability",airplane-seat-assignment-probability,false,Medium,628,978,Algorithms,66.6%,1227,false,Math;Dynamic Programming;Brainteaser;Probability and Statistics;,false,false,66.61112148592935,46370,69613
1164,"Missing Number In Arithmetic Progression",missing-number-in-arithmetic-progression,true,Easy,318,44,Algorithms,52.1%,1228,true,Array;Math;,true,true,52.05813744841199,29012,55730
1165,"Meeting Scheduler",meeting-scheduler,true,Medium,929,36,Algorithms,55.3%,1229,true,Array;Two Pointers;Sorting;,true,false,55.26065472513898,89467,161900
1166,"Toss Strange Coins",toss-strange-coins,true,Medium,402,52,Algorithms,58.1%,1230,true,Array;Math;Dynamic Programming;Probability and Statistics;,true,false,58.09709567958961,21744,37427
1192,"Divide Chocolate",divide-chocolate,true,Hard,1005,66,Algorithms,59.3%,1231,true,Array;Binary Search;,true,false,59.349214996780745,59916,100955
1349,"Check If It Is a Straight Line",check-if-it-is-a-straight-line,false,Easy,2633,283,Algorithms,39.6%,1232,false,Array;Math;Geometry;,true,false,39.59575285005355,274317,692794
1350,"Remove Sub-Folders from the Filesystem",remove-sub-folders-from-the-filesystem,false,Medium,1324,199,Algorithms,75.6%,1233,false,Array;String;Depth-First Search;Trie;,true,false,75.63701746312628,159433,210787
1351,"Replace the Substring for Balanced String",replace-the-substring-for-balanced-string,false,Medium,1218,220,Algorithms,38.9%,1234,false,String;Sliding Window;,false,false,38.90333278742221,38007,97696
1352,"Maximum Profit in Job Scheduling",maximum-profit-in-job-scheduling,false,Hard,6947,111,Algorithms,54.3%,1235,false,Array;Binary Search;Dynamic Programming;Sorting;,true,false,54.319136846768465,338417,623017
1271,"Web Crawler",web-crawler,true,Medium,292,331,Algorithms,68.3%,1236,true,String;Depth-First Search;Breadth-First Search;Interactive;,true,false,68.3241526475113,41304,60453
1358,"Find Positive Integer Solution for a Given Equation",find-positive-integer-solution-for-a-given-equation,false,Medium,526,1439,Algorithms,69.7%,1237,false,Math;Two Pointers;Binary Search;Interactive;,false,false,69.72504511807908,72247,103617
1359,"Circular Permutation in Binary Representation",circular-permutation-in-binary-representation,false,Medium,426,192,Algorithms,71.3%,1238,false,Math;Backtracking;Bit Manipulation;,false,false,71.25092471906154,20226,28387
1360,"Maximum Length of a Concatenated String with Unique Characters",maximum-length-of-a-concatenated-string-with-unique-characters,false,Medium,4461,333,Algorithms,54.2%,1239,false,Array;String;Backtracking;Bit Manipulation;,true,true,54.15594859683296,298324,550861
1361,"Tiling a Rectangle with the Fewest Squares",tiling-a-rectangle-with-the-fewest-squares,false,Hard,696,573,Algorithms,54.3%,1240,false,Backtracking;,false,false,54.27523015459441,24997,46056
1377,"Number of Comments per Post",number-of-comments-per-post,true,Easy,181,538,Database,66.0%,1241,true,Database;,false,false,65.95927983683804,37515,56876
1368,"Web Crawler Multithreaded",web-crawler-multithreaded,true,Medium,547,91,Concurrency,49.6%,1242,true,Depth-First Search;Breadth-First Search;Concurrency;,false,false,49.57111416995233,63742,128588
1175,"Array Transformation",array-transformation,true,Easy,153,73,Algorithms,52.7%,1243,true,Array;Simulation;,false,false,52.73967578669405,14380,27266
1176,"Design A Leaderboard",design-a-leaderboard,true,Medium,783,96,Algorithms,67.9%,1244,true,Hash Table;Design;Sorting;,true,false,67.88044512902165,78444,115562
1177,"Tree Diameter",tree-diameter,true,Medium,865,22,Algorithms,61.1%,1245,true,Tree;Depth-First Search;Breadth-First Search;Graph;Topological Sort;,true,false,61.13119547916641,49545,81047
1202,"Palindrome Removal",palindrome-removal,true,Hard,312,14,Algorithms,46.4%,1246,true,Array;Dynamic Programming;,false,false,46.3816198730975,11184,24113
1369,"Minimum Swaps to Make Strings Equal",minimum-swaps-to-make-strings-equal,false,Medium,1409,247,Algorithms,64.4%,1247,false,Math;String;Greedy;,false,false,64.44515771351873,44172,68542
1370,"Count Number of Nice Subarrays",count-number-of-nice-subarrays,false,Medium,4750,123,Algorithms,72.0%,1248,false,Array;Hash Table;Math;Sliding Window;Prefix Sum;,true,false,72.01630452740945,305113,423676
1371,"Minimum Remove to Make Valid Parentheses",minimum-remove-to-make-valid-parentheses,false,Medium,7045,153,Algorithms,69.9%,1249,false,String;Stack;,true,false,69.92963205183507,854345,1221721
1372,"Check If It Is a Good Array",check-if-it-is-a-good-array,false,Hard,525,380,Algorithms,60.7%,1250,false,Array;Math;Number Theory;,false,false,60.704171962450104,27224,44847
1390,"Average Selling Price",average-selling-price,false,Easy,1380,198,Database,37.1%,1251,false,Database;,true,false,37.102288010727435,369653,996295
1378,"Cells with Odd Values in a Matrix",cells-with-odd-values-in-a-matrix,false,Easy,1248,1533,Algorithms,79.0%,1252,false,Array;Math;Simulation;,false,false,78.99176862612165,123506,156353
1379,"Reconstruct a 2-Row Binary Matrix",reconstruct-a-2-row-binary-matrix,false,Medium,468,35,Algorithms,47.2%,1253,false,Array;Greedy;Matrix;,false,false,47.176760060322245,29719,62995
1380,"Number of Closed Islands",number-of-closed-islands,false,Medium,4600,173,Algorithms,66.6%,1254,false,Array;Depth-First Search;Breadth-First Search;Union Find;Matrix;,true,false,66.55840044921305,241804,363298
1381,"Maximum Score Words Formed by Letters",maximum-score-words-formed-by-letters,false,Hard,1767,116,Algorithms,81.8%,1255,false,Array;String;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,true,false,81.8074499804374,121273,148242
1189,"Encode Number",encode-number,true,Medium,79,256,Algorithms,69.9%,1256,true,Math;String;Bit Manipulation;,false,false,69.93742395272032,8047,11506
1190,"Smallest Common Region",smallest-common-region,true,Medium,481,42,Algorithms,67.9%,1257,true,Array;Hash Table;String;Tree;Depth-First Search;Breadth-First Search;,true,false,67.92152366392764,31989,47097
1191,"Synonymous Sentences",synonymous-sentences,true,Medium,359,167,Algorithms,56.5%,1258,true,Array;Hash Table;String;Backtracking;Union Find;,false,false,56.48925189606426,25175,44566
1213,"Handshakes That Don't Cross",handshakes-that-dont-cross,true,Hard,244,17,Algorithms,59.8%,1259,true,Math;Dynamic Programming;,true,false,59.776050967710795,12385,20719
1386,"Shift 2D Grid",shift-2d-grid,false,Easy,1745,344,Algorithms,67.5%,1260,false,Array;Matrix;Simulation;,true,false,67.51534535310844,112303,166337
1387,"Find Elements in a Contaminated Binary Tree",find-elements-in-a-contaminated-binary-tree,false,Medium,1002,95,Algorithms,77.7%,1261,false,Hash Table;Tree;Depth-First Search;Breadth-First Search;Design;Binary Tree;,false,false,77.74690663667042,69117,88900
1388,"Greatest Sum Divisible by Three",greatest-sum-divisible-by-three,false,Medium,1839,45,Algorithms,50.6%,1262,false,Array;Dynamic Programming;Greedy;Sorting;,false,false,50.61541041334786,60369,119269
1389,"Minimum Moves to Move a Box to Their Target Location",minimum-moves-to-move-a-box-to-their-target-location,false,Hard,859,58,Algorithms,49.2%,1263,false,Array;Breadth-First Search;Heap (Priority Queue);Matrix;,false,false,49.16862613369163,29275,59540
1399,"Page Recommendations",page-recommendations,true,Medium,253,24,Database,65.3%,1264,true,Database;,false,false,65.33406275863037,46576,71289
1404,"Print Immutable Linked List in Reverse",print-immutable-linked-list-in-reverse,true,Medium,583,104,Algorithms,94.1%,1265,true,Linked List;Two Pointers;Stack;Recursion;,true,false,94.0546511806312,61302,65177
1395,"Minimum Time Visiting All Points",minimum-time-visiting-all-points,false,Easy,2223,233,Algorithms,82.4%,1266,false,Array;Math;Geometry;,true,false,82.37656604143233,243875,296049
1396,"Count Servers that Communicate",count-servers-that-communicate,false,Medium,1321,86,Algorithms,60.9%,1267,false,Array;Depth-First Search;Breadth-First Search;Union Find;Matrix;Counting;,false,false,60.949119279646744,63355,103948
1397,"Search Suggestions System",search-suggestions-system,false,Medium,4850,251,Algorithms,65.1%,1268,false,Array;String;Binary Search;Trie;Sorting;Heap (Priority Queue);,true,false,65.0590824433123,353857,543901
1398,"Number of Ways to Stay in the Same Place After Some Steps",number-of-ways-to-stay-in-the-same-place-after-some-steps,false,Hard,1558,66,Algorithms,50.2%,1269,false,Dynamic Programming;,true,false,50.18109266258857,95323,189958
1405,"All People Report to the Given Manager",all-people-report-to-the-given-manager,true,Medium,428,29,Database,84.5%,1270,true,Database;,false,false,84.45705669824471,59375,70302
1199,"Hexspeak",hexspeak,true,Easy,78,125,Algorithms,58.2%,1271,true,Math;String;,false,false,58.2060224984035,11849,20357
1200,"Remove Interval",remove-interval,true,Medium,467,35,Algorithms,66.5%,1272,true,Array;,true,true,66.52295118868284,38419,57753
1201,"Delete Tree Nodes",delete-tree-nodes,true,Medium,228,64,Algorithms,61.3%,1273,true,Array;Tree;Depth-First Search;Breadth-First Search;,false,false,61.31816622842118,10727,17494
1233,"Number of Ships in a Rectangle",number-of-ships-in-a-rectangle,true,Hard,529,62,Algorithms,68.8%,1274,true,Array;Divide and Conquer;Interactive;,true,false,68.75738300772376,30267,44020
1400,"Find Winner on a Tic Tac Toe Game",find-winner-on-a-tic-tac-toe-game,false,Easy,1533,358,Algorithms,54.0%,1275,false,Array;Hash Table;Matrix;Simulation;,true,false,54.01505717843557,141843,262599
1401,"Number of Burgers with No Waste of Ingredients",number-of-burgers-with-no-waste-of-ingredients,false,Medium,332,236,Algorithms,51.0%,1276,false,Math;,false,false,51.03729960235349,28365,55577
1402,"Count Square Submatrices with All Ones",count-square-submatrices-with-all-ones,false,Medium,5395,98,Algorithms,78.4%,1277,false,Array;Dynamic Programming;Matrix;,true,false,78.44754552463993,329646,420212
1403,"Palindrome Partitioning III",palindrome-partitioning-iii,false,Hard,1163,19,Algorithms,61.3%,1278,false,String;Dynamic Programming;,false,false,61.27691947565543,31413,51264
1410,"Traffic Light Controlled Intersection",traffic-light-controlled-intersection,true,Easy,75,358,Concurrency,72.9%,1279,true,Concurrency;,false,false,72.86750527958866,15872,21782
1415,"Students and Examinations",students-and-examinations,false,Easy,2113,267,Database,59.9%,1280,false,Database;,true,false,59.86516933197533,407327,680408
1406,"Subtract the Product and Sum of Digits of an Integer",subtract-the-product-and-sum-of-digits-of-an-integer,false,Easy,2623,237,Algorithms,86.6%,1281,false,Math;,false,false,86.62483487450461,540338,623768
1407,"Group the People Given the Group Size They Belong To",group-the-people-given-the-group-size-they-belong-to,false,Medium,3029,719,Algorithms,87.4%,1282,false,Array;Hash Table;Greedy;,true,false,87.40951017874582,221082,252927
1408,"Find the Smallest Divisor Given a Threshold",find-the-smallest-divisor-given-a-threshold,false,Medium,3079,211,Algorithms,62.1%,1283,false,Array;Binary Search;,true,false,62.115955841866274,251557,404985
1409,"Minimum Number of Flips to Convert Binary Matrix to Zero Matrix",minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix,false,Hard,979,101,Algorithms,72.4%,1284,false,Array;Hash Table;Bit Manipulation;Breadth-First Search;Matrix;,true,false,72.42852448241867,35264,48688
1420,"Find the Start and End Number of Continuous Ranges",find-the-start-and-end-number-of-continuous-ranges,true,Medium,573,35,Database,82.0%,1285,true,Database;,false,false,82.01477398859417,42856,52254
1211,"Iterator for Combination",iterator-for-combination,false,Medium,1371,105,Algorithms,73.4%,1286,false,String;Backtracking;Design;Iterator;,true,false,73.40099856106771,76006,103549
1221,"Element Appearing More Than 25% In Sorted Array",element-appearing-more-than-25-in-sorted-array,false,Easy,1729,81,Algorithms,61.0%,1287,false,Array;,true,false,61.03073200274264,228756,374821
1222,"Remove Covered Intervals",remove-covered-intervals,false,Medium,2252,59,Algorithms,56.2%,1288,false,Array;Sorting;,true,false,56.168035581521195,127675,227309
1224,"Minimum Falling Path Sum II",minimum-falling-path-sum-ii,false,Hard,2282,123,Algorithms,64.2%,1289,false,Array;Dynamic Programming;Matrix;,true,false,64.22153819661192,149176,232284
1411,"Convert Binary Number in a Linked List to Integer",convert-binary-number-in-a-linked-list-to-integer,false,Easy,4216,162,Algorithms,81.2%,1290,false,Linked List;Math;,true,false,81.17159913152354,519285,639738
1212,"Sequential Digits",sequential-digits,false,Medium,2876,176,Algorithms,65.3%,1291,false,Enumeration;,true,false,65.26946282401589,223824,342923
1413,"Maximum Side Length of a Square with Sum Less than or Equal to Threshold",maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold,false,Medium,1104,94,Algorithms,53.8%,1292,false,Array;Binary Search;Matrix;Prefix Sum;,false,false,53.80173674315897,36059,67022
1414,"Shortest Path in a Grid with Obstacles Elimination",shortest-path-in-a-grid-with-obstacles-elimination,false,Hard,4603,85,Algorithms,45.4%,1293,false,Array;Breadth-First Search;Matrix;,true,false,45.41493273928198,227104,500066
1425,"Weather Type in Each Country",weather-type-in-each-country,true,Easy,141,30,Database,66.9%,1294,true,Database;,false,false,66.85776337011545,41867,62621
1421,"Find Numbers with Even Number of Digits",find-numbers-with-even-number-of-digits,false,Easy,2449,130,Algorithms,77.6%,1295,false,Array;Math;,true,false,77.61840282641515,748058,963764
1422,"Divide Array in Sets of K Consecutive Numbers",divide-array-in-sets-of-k-consecutive-numbers,false,Medium,1895,114,Algorithms,58.6%,1296,false,Array;Hash Table;Greedy;Sorting;,false,false,58.58207282913165,104569,178500
1423,"Maximum Number of Occurrences of a Substring",maximum-number-of-occurrences-of-a-substring,false,Medium,1139,412,Algorithms,52.6%,1297,false,Hash Table;String;Sliding Window;,false,false,52.623522621766085,62913,119553
1424,"Maximum Candies You Can Get from Boxes",maximum-candies-you-can-get-from-boxes,false,Hard,351,149,Algorithms,57.7%,1298,false,Array;Breadth-First Search;Graph;,false,false,57.68536332692024,19489,33785
1231,"Replace Elements with Greatest Element on Right Side",replace-elements-with-greatest-element-on-right-side,false,Easy,2665,252,Algorithms,71.4%,1299,false,Array;,false,false,71.35984364429076,436677,611936
1232,"Sum of Mutated Array Closest to Target",sum-of-mutated-array-closest-to-target,false,Medium,1159,150,Algorithms,45.0%,1300,false,Array;Binary Search;Sorting;,false,false,45.00697606506668,41613,92459
1234,"Number of Paths with Max Score",number-of-paths-with-max-score,false,Hard,528,26,Algorithms,40.4%,1301,false,Array;Dynamic Programming;Matrix;,false,false,40.36169988400295,15310,37932
1254,"Deepest Leaves Sum",deepest-leaves-sum,false,Medium,4736,123,Algorithms,86.4%,1302,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,86.36353690823205,355240,411331
1438,"Find the Team Size",find-the-team-size,true,Easy,336,16,Database,89.6%,1303,true,Database;,false,false,89.60857352958904,74333,82953
1426,"Find N Unique Integers Sum up to Zero",find-n-unique-integers-sum-up-to-zero,false,Easy,2026,602,Algorithms,76.1%,1304,false,Array;Math;,false,false,76.1454912035381,234155,307510
1427,"All Elements in Two Binary Search Trees",all-elements-in-two-binary-search-trees,false,Medium,3095,96,Algorithms,79.9%,1305,false,Tree;Depth-First Search;Binary Search Tree;Sorting;Binary Tree;,true,false,79.93259548972289,230531,288407
1428,"Jump Game III",jump-game-iii,false,Medium,4207,106,Algorithms,65.6%,1306,false,Array;Depth-First Search;Breadth-First Search;,true,true,65.55793104872859,253896,387285
1429,"Verbal Arithmetic Puzzle",verbal-arithmetic-puzzle,false,Hard,509,132,Algorithms,34.7%,1307,false,Array;Math;String;Backtracking;,false,false,34.67782503315498,15166,43734
1439,"Running Total for Different Genders",running-total-for-different-genders,true,Medium,217,67,Database,86.3%,1308,true,Database;,false,false,86.32905802773931,43010,49821
1434,"Decrypt String from Alphabet to Integer Mapping",decrypt-string-from-alphabet-to-integer-mapping,false,Easy,1556,112,Algorithms,80.0%,1309,false,String;,false,false,79.99988017781612,133531,166914
1435,"XOR Queries of a Subarray",xor-queries-of-a-subarray,false,Medium,2030,58,Algorithms,78.6%,1310,false,Array;Bit Manipulation;Prefix Sum;,true,false,78.62954000892114,199191,253329
1436,"Get Watched Videos by Your Friends",get-watched-videos-by-your-friends,false,Medium,424,429,Algorithms,48.4%,1311,false,Array;Hash Table;Breadth-First Search;Graph;Sorting;,false,false,48.40508587999108,28209,58278
1437,"Minimum Insertion Steps to Make a String Palindrome",minimum-insertion-steps-to-make-a-string-palindrome,false,Hard,5181,68,Algorithms,71.7%,1312,false,String;Dynamic Programming;,true,false,71.72831249892828,209147,291582
1241,"Decompress Run-Length Encoded List",decompress-run-length-encoded-list,false,Easy,1286,1320,Algorithms,85.9%,1313,false,Array;,false,false,85.91712104022238,280955,327007
1242,"Matrix Block Sum",matrix-block-sum,false,Medium,2425,380,Algorithms,75.7%,1314,false,Array;Matrix;Prefix Sum;,false,false,75.73165060376209,94451,124718
1243,"Sum of Nodes with Even-Valued Grandparent",sum-of-nodes-with-even-valued-grandparent,false,Medium,2775,76,Algorithms,85.7%,1315,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,85.68834263889394,164675,192179
1244,"Distinct Echo Substrings",distinct-echo-substrings,false,Hard,321,208,Algorithms,51.5%,1316,false,String;Trie;Rolling Hash;Hash Function;,false,false,51.4749669166299,18671,36272
1440,"Convert Integer to the Sum of Two No-Zero Integers",convert-integer-to-the-sum-of-two-no-zero-integers,false,Easy,422,316,Algorithms,53.9%,1317,false,Math;,false,false,53.94661033224506,53371,98933
1441,"Minimum Flips to Make a OR b Equal to c",minimum-flips-to-make-a-or-b-equal-to-c,false,Medium,2039,105,Algorithms,71.3%,1318,false,Bit Manipulation;,true,false,71.33901294521092,152485,213747
1442,"Number of Operations to Make Network Connected",number-of-operations-to-make-network-connected,false,Medium,5169,77,Algorithms,63.8%,1319,false,Depth-First Search;Breadth-First Search;Union Find;Graph;,true,false,63.80863699794548,255602,400576
1443,"Minimum Distance to Type a Word Using Two Fingers",minimum-distance-to-type-a-word-using-two-fingers,false,Hard,1019,39,Algorithms,59.1%,1320,false,String;Dynamic Programming;,false,false,59.05705894692679,33783,57204
1452,"Restaurant Growth",restaurant-growth,false,Medium,873,317,Database,54.9%,1321,false,Database;,false,false,54.907384482064934,141926,258466
1453,"Ads Performance",ads-performance,true,Easy,264,65,Database,59.4%,1322,true,Database;,true,false,59.41952574456047,46207,77764
1448,"Maximum 69 Number",maximum-69-number,false,Easy,2830,218,Algorithms,82.6%,1323,false,Math;Greedy;,true,false,82.58448822914055,286568,346999
1449,"Print Words Vertically",print-words-vertically,false,Medium,800,118,Algorithms,65.3%,1324,false,Array;String;Simulation;,false,false,65.32282820014326,44688,68411
1450,"Delete Leaves With a Given Value",delete-leaves-with-a-given-value,false,Medium,2775,54,Algorithms,77.4%,1325,false,Tree;Depth-First Search;Binary Tree;,true,false,77.3552960481715,222504,287639
1451,"Minimum Number of Taps to Open to Water a Garden",minimum-number-of-taps-to-open-to-water-a-garden,false,Hard,3458,197,Algorithms,50.7%,1326,false,Array;Dynamic Programming;Greedy;,true,false,50.677092370871655,140182,276620
1462,"List the Products Ordered in a Period",list-the-products-ordered-in-a-period,false,Easy,416,37,Database,71.7%,1327,false,Database;,false,false,71.73889959813114,175650,244847
1252,"Break a Palindrome",break-a-palindrome,false,Medium,2357,750,Algorithms,51.6%,1328,false,String;Greedy;,true,false,51.5740995524917,178057,345245
1253,"Sort the Matrix Diagonally",sort-the-matrix-diagonally,false,Medium,3423,234,Algorithms,82.9%,1329,false,Array;Sorting;Matrix;,true,true,82.89710280104234,172420,207993
1255,"Reverse Subarray To Maximize Array Value",reverse-subarray-to-maximize-array-value,false,Hard,483,56,Algorithms,42.2%,1330,false,Array;Math;Greedy;,false,false,42.20628028443773,6707,15891
1256,"Rank Transform of an Array",rank-transform-of-an-array,false,Easy,2263,112,Algorithms,70.6%,1331,false,Array;Hash Table;Sorting;,true,false,70.56221638880449,283320,401518
1454,"Remove Palindromic Subsequences",remove-palindromic-subsequences,false,Easy,1680,1773,Algorithms,76.6%,1332,false,Two Pointers;String;,true,false,76.58739245641009,140472,183414
1455,"Filter Restaurants by Vegan-Friendly, Price and Distance",filter-restaurants-by-vegan-friendly-price-and-distance,false,Medium,312,224,Algorithms,62.9%,1333,false,Array;Sorting;,false,false,62.92364076019194,33308,52934
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,3265,143,Algorithms,69.0%,1334,false,Dynamic Programming;Graph;Shortest Path;,true,false,69.00725958234996,230986,334728
1457,"Minimum Difficulty of a Job Schedule",minimum-difficulty-of-a-job-schedule,false,Hard,3459,323,Algorithms,59.6%,1335,false,Array;Dynamic Programming;,true,false,59.6300704586327,205908,345309
1467,"Number of Transactions per Visit",number-of-transactions-per-visit,true,Hard,92,317,Database,47.9%,1336,true,Database;,false,false,47.887719298245614,13648,28500
1463,"The K Weakest Rows in a Matrix",the-k-weakest-rows-in-a-matrix,false,Easy,4208,236,Algorithms,73.8%,1337,false,Array;Binary Search;Sorting;Heap (Priority Queue);Matrix;,true,false,73.80270577141428,383500,519629
1464,"Reduce Array Size to The Half",reduce-array-size-to-the-half,false,Medium,3291,150,Algorithms,69.0%,1338,false,Array;Hash Table;Greedy;Sorting;Heap (Priority Queue);,true,false,69.00146887097691,206224,298869
1465,"Maximum Product of Splitted Binary Tree",maximum-product-of-splitted-binary-tree,false,Medium,3038,104,Algorithms,47.8%,1339,false,Tree;Depth-First Search;Binary Tree;,true,false,47.78443202100512,129577,271171
1466,"Jump Game V",jump-game-v,false,Hard,1134,43,Algorithms,63.8%,1340,false,Array;Dynamic Programming;Sorting;,false,false,63.77019491115136,35564,55769
1480,"Movie Rating",movie-rating,false,Medium,674,201,Database,41.0%,1341,false,Database;,false,false,41.00035093552022,155386,378987
1444,"Number of Steps to Reduce a Number to Zero",number-of-steps-to-reduce-a-number-to-zero,false,Easy,4028,172,Algorithms,85.5%,1342,false,Math;Bit Manipulation;,true,true,85.47890537870322,748820,876029
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,1663,106,Algorithms,69.5%,1343,false,Array;Sliding Window;,false,false,69.53189469043555,123016,176922
1446,"Angle Between Hands of a Clock",angle-between-hands-of-a-clock,false,Medium,1330,243,Algorithms,64.1%,1344,false,Math;,true,false,64.07479248924291,130150,203122
1447,"Jump Game IV",jump-game-iv,false,Hard,3774,131,Algorithms,46.1%,1345,false,Array;Hash Table;Breadth-First Search;,true,false,46.090616929171254,150443,326407
1468,"Check If N and Its Double Exist",check-if-n-and-its-double-exist,false,Easy,2400,243,Algorithms,40.9%,1346,false,Array;Hash Table;Two Pointers;Binary Search;Sorting;,true,false,40.939955872353615,531051,1297146
1469,"Minimum Number of Steps to Make Two Strings Anagram",minimum-number-of-steps-to-make-two-strings-anagram,false,Medium,2744,119,Algorithms,82.1%,1347,false,Hash Table;String;Counting;,true,false,82.10600589382808,296726,361394
1470,"Tweet Counts Per Frequency",tweet-counts-per-frequency,false,Medium,200,301,Algorithms,45.0%,1348,false,Hash Table;Binary Search;Design;Sorting;Ordered Set;,false,false,44.96515634309992,34714,77202
1471,"Maximum Students Taking Exam",maximum-students-taking-exam,false,Hard,841,17,Algorithms,51.7%,1349,false,Array;Dynamic Programming;Bit Manipulation;Matrix;Bitmask;,false,false,51.665009940357855,18711,36216
1481,"Students With Invalid Departments",students-with-invalid-departments,true,Easy,180,9,Database,89.8%,1350,true,Database;,false,false,89.81788822104602,60072,66882
1476,"Count Negative Numbers in a Sorted Matrix",count-negative-numbers-in-a-sorted-matrix,false,Easy,5022,133,Algorithms,77.5%,1351,false,Array;Binary Search;Matrix;,true,false,77.52411059175549,458587,591541
1477,"Product of the Last K Numbers",product-of-the-last-k-numbers,false,Medium,1506,73,Algorithms,52.3%,1352,false,Array;Math;Design;Queue;Data Stream;,false,false,52.298146078995046,96420,184366
1478,"Maximum Number of Events That Can Be Attended",maximum-number-of-events-that-can-be-attended,false,Medium,3116,448,Algorithms,32.6%,1353,false,Array;Greedy;Sorting;Heap (Priority Queue);,false,false,32.643103260312984,98809,302699
1479,"Construct Target Array With Multiple Sums",construct-target-array-with-multiple-sums,false,Hard,2047,168,Algorithms,36.2%,1354,false,Array;Heap (Priority Queue);,true,false,36.211153411172525,68199,188337
1494,"Activity Participants",activity-participants,true,Medium,148,48,Database,72.3%,1355,true,Database;,true,false,72.31653951016106,31564,43647
1458,"Sort Integers by The Number of 1 Bits",sort-integers-by-the-number-of-1-bits,false,Easy,2505,122,Algorithms,78.5%,1356,false,Array;Bit Manipulation;Sorting;Counting;,true,false,78.49953836466908,240616,306519
1459,"Apply Discount Every n Orders",apply-discount-every-n-orders,false,Medium,201,229,Algorithms,71.8%,1357,false,Array;Hash Table;Design;,false,false,71.78324387933756,25010,34841
1460,"Number of Substrings Containing All Three Characters",number-of-substrings-containing-all-three-characters,false,Medium,3414,58,Algorithms,68.3%,1358,false,Hash Table;String;Sliding Window;,false,false,68.32975103770548,157035,229820
1461,"Count All Valid Pickup and Delivery Options",count-all-valid-pickup-and-delivery-options,false,Hard,3045,229,Algorithms,64.9%,1359,false,Math;Dynamic Programming;Combinatorics;,true,false,64.88894772752731,127438,196394
1274,"Number of Days Between Two Dates",number-of-days-between-two-dates,false,Easy,387,1295,Algorithms,50.8%,1360,false,Math;String;,false,false,50.8101841986379,59610,117319
1275,"Validate Binary Tree Nodes",validate-binary-tree-nodes,false,Medium,2164,513,Algorithms,43.8%,1361,false,Tree;Depth-First Search;Breadth-First Search;Union Find;Graph;Binary Tree;,true,false,43.80399300232655,121440,277235
1276,"Closest Divisors",closest-divisors,false,Medium,323,98,Algorithms,61.0%,1362,false,Math;,false,false,60.95907420284097,24547,40268
1277,"Largest Multiple of Three",largest-multiple-of-three,false,Hard,609,89,Algorithms,32.6%,1363,false,Array;Dynamic Programming;Greedy;,false,false,32.61512523396534,22827,69989
1495,"Number of Trusted Contacts of a Customer",number-of-trusted-contacts-of-a-customer,true,Medium,90,394,Database,75.0%,1364,true,Database;,true,false,74.96454146054589,21670,28907
1482,"How Many Numbers Are Smaller Than the Current Number",how-many-numbers-are-smaller-than-the-current-number,false,Easy,5559,139,Algorithms,87.0%,1365,false,Array;Hash Table;Sorting;Counting;,false,false,87.04373731825163,621164,713623
1483,"Rank Teams by Votes",rank-teams-by-votes,false,Medium,1478,176,Algorithms,58.8%,1366,false,Array;Hash Table;String;Sorting;Counting;,false,false,58.81430565997208,82143,139665
1484,"Linked List in Binary Tree",linked-list-in-binary-tree,false,Medium,2936,86,Algorithms,52.1%,1367,false,Linked List;Tree;Depth-First Search;Binary Tree;,true,false,52.08964198752606,193176,370852
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,1812,20,Algorithms,62.6%,1368,false,Array;Breadth-First Search;Graph;Heap (Priority Queue);Matrix;Shortest Path;,false,false,62.643143429716574,52515,83832
1504,"Get the Second Most Recent Activity",get-the-second-most-recent-activity,true,Hard,166,13,Database,67.5%,1369,true,Database;,false,false,67.51134644478064,23205,34372
1472,"Increasing Decreasing String",increasing-decreasing-string,false,Easy,802,870,Algorithms,76.6%,1370,false,Hash Table;String;Counting;,false,false,76.63803040126793,85105,111048
1473,"Find the Longest Substring Containing Vowels in Even Counts",find-the-longest-substring-containing-vowels-in-even-counts,false,Medium,2465,136,Algorithms,76.2%,1371,false,Hash Table;String;Bit Manipulation;Prefix Sum;,true,false,76.24161621341288,130838,171610
1474,"Longest ZigZag Path in a Binary Tree",longest-zigzag-path-in-a-binary-tree,false,Medium,3549,77,Algorithms,66.1%,1372,false,Dynamic Programming;Tree;Depth-First Search;Binary Tree;,true,false,66.11475083119537,208993,316107
1475,"Maximum Sum BST in Binary Tree",maximum-sum-bst-in-binary-tree,false,Hard,2742,188,Algorithms,42.7%,1373,false,Dynamic Programming;Tree;Depth-First Search;Binary Search Tree;Binary Tree;,false,false,42.7045480111316,87315,204463
1490,"Generate a String With Characters That Have Odd Counts",generate-a-string-with-characters-that-have-odd-counts,false,Easy,501,1279,Algorithms,78.1%,1374,false,String;,false,false,78.1329637756477,101483,129885
1491,"Number of Times Binary String Is Prefix-Aligned",number-of-times-binary-string-is-prefix-aligned,false,Medium,950,138,Algorithms,65.8%,1375,false,Array;,false,false,65.77461447212337,55448,84300
1492,"Time Needed to Inform All Employees",time-needed-to-inform-all-employees,false,Medium,4144,304,Algorithms,60.1%,1376,false,Tree;Depth-First Search;Breadth-First Search;,true,false,60.12448272906043,231451,384953
1493,"Frog Position After T Seconds",frog-position-after-t-seconds,false,Hard,805,148,Algorithms,35.6%,1377,false,Tree;Depth-First Search;Breadth-First Search;Graph;,false,false,35.62710008480854,33187,93151
1509,"Replace Employee ID With The Unique Identifier",replace-employee-id-with-the-unique-identifier,false,Easy,1484,125,Database,83.7%,1378,false,Database;,true,false,83.65048803286646,763330,912525
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,1767,2012,Algorithms,86.0%,1379,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,85.9696150987527,244059,283890
1496,"Lucky Numbers in a Matrix",lucky-numbers-in-a-matrix,false,Easy,2223,116,Algorithms,79.9%,1380,false,Array;Matrix;,true,false,79.8994714951181,262598,328660
1497,"Design a Stack With Increment Operation",design-a-stack-with-increment-operation,false,Medium,2269,109,Algorithms,80.5%,1381,false,Array;Stack;Design;,true,false,80.5222747069026,231663,287701
1285,"Balance a Binary Search Tree",balance-a-binary-search-tree,false,Medium,3709,91,Algorithms,84.7%,1382,false,Divide and Conquer;Greedy;Tree;Depth-First Search;Binary Search Tree;Binary Tree;,true,false,84.70610058226544,269423,318066
1499,"Maximum Performance of a Team",maximum-performance-of-a-team,false,Hard,3136,83,Algorithms,47.6%,1383,false,Array;Greedy;Sorting;Heap (Priority Queue);,true,false,47.59014774546744,99274,208602
1518,"Total Sales Amount by Year",total-sales-amount-by-year,true,Hard,230,130,Database,61.1%,1384,true,Database;,false,false,61.11510176158714,17867,29235
1486,"Find the Distance Value Between Two Arrays",find-the-distance-value-between-two-arrays,false,Easy,947,3080,Algorithms,69.5%,1385,false,Array;Two Pointers;Binary Search;Sorting;,false,false,69.48558113837542,115706,166518
1487,"Cinema Seat Allocation",cinema-seat-allocation,false,Medium,927,403,Algorithms,42.4%,1386,false,Array;Hash Table;Greedy;Bit Manipulation;,false,false,42.35619109522262,52131,123075
1488,"Sort Integers by The Power Value",sort-integers-by-the-power-value,false,Medium,1482,118,Algorithms,70.4%,1387,false,Dynamic Programming;Memoization;Sorting;,false,false,70.35708337959366,101393,144112
1489,"Pizza With 3n Slices",pizza-with-3n-slices,false,Hard,1082,22,Algorithms,52.4%,1388,false,Array;Dynamic Programming;Greedy;Heap (Priority Queue);,false,false,52.37455117887401,29611,56537
1505,"Create Target Array in the Given Order",create-target-array-in-the-given-order,false,Easy,2099,1884,Algorithms,86.1%,1389,false,Array;Simulation;,false,false,86.09189668375046,270949,314720
1284,"Four Divisors",four-divisors,false,Medium,429,192,Algorithms,44.1%,1390,false,Array;Math;,false,false,44.05126243305279,41454,94102
1507,"Check if There is a Valid Path in a Grid",check-if-there-is-a-valid-path-in-a-grid,false,Medium,838,318,Algorithms,48.5%,1391,false,Array;Depth-First Search;Breadth-First Search;Union Find;Matrix;,false,false,48.535717544019704,31920,65766
1508,"Longest Happy Prefix",longest-happy-prefix,false,Hard,1423,41,Algorithms,47.5%,1392,false,String;Rolling Hash;String Matching;Hash Function;,false,false,47.47632055962623,55787,117504
1523,"Capital Gain/Loss",capital-gainloss,false,Medium,839,48,Database,85.2%,1393,false,Database;,true,false,85.16386568716246,126940,149054
1510,"Find Lucky Integer in an Array",find-lucky-integer-in-an-array,false,Easy,1179,34,Algorithms,68.5%,1394,false,Array;Hash Table;Counting;,true,false,68.47030862989706,143472,209539
1511,"Count Number of Teams",count-number-of-teams,false,Medium,3377,233,Algorithms,70.1%,1395,false,Array;Dynamic Programming;Binary Indexed Tree;Segment Tree;,true,false,70.09209828748968,227404,324436
1512,"Design Underground System",design-underground-system,false,Medium,3530,176,Algorithms,74.8%,1396,false,Hash Table;String;Design;,true,false,74.78892579465959,241824,323343
1513,"Find All Good Strings",find-all-good-strings,false,Hard,498,129,Algorithms,43.1%,1397,false,String;Dynamic Programming;String Matching;,false,false,43.10394805495971,7435,17249
1536,"Customers Who Bought Products A and B but Not C",customers-who-bought-products-a-and-b-but-not-c,true,Medium,313,17,Database,72.3%,1398,true,Database;,true,false,72.25813670155897,58123,80438
1500,"Count Largest Group",count-largest-group,false,Easy,448,992,Algorithms,66.5%,1399,false,Hash Table;Math;,false,false,66.50872785493928,51094,76823
1502,"Construct K Palindrome Strings",construct-k-palindrome-strings,false,Medium,1065,94,Algorithms,62.0%,1400,false,Hash Table;String;Greedy;Counting;,false,false,62.01319987761703,56752,91516
1501,"Circle and Rectangle Overlapping",circle-and-rectangle-overlapping,false,Medium,383,83,Algorithms,47.9%,1401,false,Math;Geometry;,false,false,47.933068496448776,19907,41529
1503,"Reducing Dishes",reducing-dishes,false,Hard,3367,310,Algorithms,76.2%,1402,false,Array;Dynamic Programming;Greedy;Sorting;,true,false,76.24332967354356,159023,208573
1519,"Minimum Subsequence in Non-Increasing Order",minimum-subsequence-in-non-increasing-order,false,Easy,599,507,Algorithms,72.8%,1403,false,Array;Greedy;Sorting;,false,false,72.808766779298,78865,108318
1520,"Number of Steps to Reduce a Number in Binary Representation to One",number-of-steps-to-reduce-a-number-in-binary-representation-to-one,false,Medium,1396,87,Algorithms,61.4%,1404,false,String;Bit Manipulation;,true,false,61.43336627114076,150454,244906
1304,"Longest Happy String",longest-happy-string,false,Medium,2654,311,Algorithms,65.5%,1405,false,String;Greedy;Heap (Priority Queue);,true,false,65.49018407411943,192548,294011
1522,"Stone Game III",stone-game-iii,false,Hard,2240,73,Algorithms,63.4%,1406,false,Array;Math;Dynamic Programming;Game Theory;,true,false,63.40478327437833,96076,151528
1541,"Top Travellers",top-travellers,false,Easy,667,69,Database,57.3%,1407,false,Database;,true,false,57.31338601203898,146152,255005
1524,"String Matching in an Array",string-matching-in-an-array,false,Easy,918,90,Algorithms,64.3%,1408,false,Array;String;String Matching;,false,false,64.28772919605078,100276,155980
1525,"Queries on a Permutation With Key",queries-on-a-permutation-with-key,false,Medium,500,634,Algorithms,84.4%,1409,false,Array;Binary Indexed Tree;Simulation;,false,false,84.3776742417039,53244,63102
1526,"HTML Entity Parser",html-entity-parser,false,Medium,198,325,Algorithms,50.4%,1410,false,Hash Table;String;,false,false,50.44781101077342,27206,53929
1527,"Number of Ways to Paint N × 3 Grid",number-of-ways-to-paint-n-3-grid,false,Hard,1092,53,Algorithms,64.1%,1411,false,Dynamic Programming;,false,false,64.08215028005777,36382,56774
1546,"Find the Quiet Students in All Exams",find-the-quiet-students-in-all-exams,true,Hard,223,26,Database,58.7%,1412,true,Database;,false,false,58.70702762474577,29731,50643
1514,"Minimum Value to Get Positive Step by Step Sum",minimum-value-to-get-positive-step-by-step-sum,false,Easy,1592,346,Algorithms,65.0%,1413,false,Array;Prefix Sum;,true,false,65.0184607303961,168349,258926
1515,"Find the Minimum Number of Fibonacci Numbers Whose Sum Is K",find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k,false,Medium,1027,68,Algorithms,65.0%,1414,false,Math;Greedy;,false,false,64.98976639141787,46042,70845
1516,"The k-th Lexicographical String of All Happy Strings of Length n",the-k-th-lexicographical-string-of-all-happy-strings-of-length-n,false,Medium,982,27,Algorithms,74.8%,1415,false,String;Backtracking;,false,false,74.75064710957722,43317,57949
1517,"Restore The Array",restore-the-array,false,Hard,1624,53,Algorithms,47.1%,1416,false,String;Dynamic Programming;,true,false,47.11766012361091,61521,130570
1532,"Reformat The String",reformat-the-string,false,Easy,597,108,Algorithms,52.2%,1417,false,String;,false,false,52.195793296135705,62957,120617
1533,"Display Table of Food Orders in a Restaurant",display-table-of-food-orders-in-a-restaurant,false,Medium,403,482,Algorithms,75.5%,1418,false,Array;Hash Table;String;Sorting;Ordered Set;,false,false,75.46148573589544,31927,42309
1534,"Minimum Number of Frogs Croaking",minimum-number-of-frogs-croaking,false,Medium,1081,92,Algorithms,50.5%,1419,false,String;Counting;,false,false,50.52175915265945,54854,108575
1535,"Build Array Where You Can Find The Maximum Exactly K Comparisons",build-array-where-you-can-find-the-maximum-exactly-k-comparisons,false,Hard,1375,91,Algorithms,67.7%,1420,false,Dynamic Programming;Prefix Sum;,true,false,67.6859261062261,66739,98601
1551,"NPV Queries",npv-queries,true,Easy,59,296,Database,82.9%,1421,true,Database;,true,false,82.91660602532383,28486,34355
1537,"Maximum Score After Splitting a String",maximum-score-after-splitting-a-string,false,Easy,2073,83,Algorithms,65.1%,1422,false,String;Prefix Sum;,true,false,65.12012930642481,315054,483803
1538,"Maximum Points You Can Obtain from Cards",maximum-points-you-can-obtain-from-cards,false,Medium,6370,263,Algorithms,54.5%,1423,false,Array;Sliding Window;Prefix Sum;,true,false,54.51689330053687,337332,618764
1539,"Diagonal Traverse II",diagonal-traverse-ii,false,Medium,2225,154,Algorithms,57.5%,1424,false,Array;Sorting;Heap (Priority Queue);,true,false,57.50255985914162,152188,264663
1286,"Constrained Subsequence Sum",constrained-subsequence-sum,false,Hard,2159,104,Algorithms,56.5%,1425,false,Array;Dynamic Programming;Queue;Sliding Window;Heap (Priority Queue);Monotonic Queue;,true,false,56.50159821607329,81842,144849
1391,"Counting Elements",counting-elements,true,Easy,160,58,Algorithms,60.3%,1426,true,Array;Hash Table;,true,false,60.33845530173325,139911,231877
1345,"Perform String Shifts",perform-string-shifts,true,Easy,261,12,Algorithms,55.5%,1427,true,Array;Math;String;,true,false,55.48922308623432,87556,157784
1374,"Leftmost Column with at Least a One",leftmost-column-with-at-least-a-one,true,Medium,1238,150,Algorithms,54.8%,1428,true,Array;Binary Search;Matrix;Interactive;,true,false,54.792587333555495,189081,345085
1366,"First Unique Number",first-unique-number,true,Medium,582,33,Algorithms,55.0%,1429,true,Array;Hash Table;Design;Queue;Data Stream;,true,false,55.01029172521969,94338,171494
1432,"Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree",check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree,true,Medium,215,14,Algorithms,47.1%,1430,true,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,false,false,47.12213334445754,45184,95887
1528,"Kids With the Greatest Number of Candies",kids-with-the-greatest-number-of-candies,false,Easy,4603,590,Algorithms,87.9%,1431,false,Array;,true,false,87.9045585368118,1136179,1292512
1529,"Max Difference You Can Get From Changing an Integer",max-difference-you-can-get-from-changing-an-integer,false,Medium,237,295,Algorithms,40.7%,1432,false,Math;Greedy;,false,false,40.69201178588967,19887,48872
1530,"Check If a String Can Break Another String",check-if-a-string-can-break-another-string,false,Medium,765,149,Algorithms,70.1%,1433,false,String;Greedy;Sorting;,false,false,70.0603748648324,46649,66584
1531,"Number of Ways to Wear Different Hats to Each Other",number-of-ways-to-wear-different-hats-to-each-other,false,Hard,909,10,Algorithms,44.5%,1434,false,Array;Dynamic Programming;Bit Manipulation;Bitmask;,true,false,44.450062538254784,16703,37577
1564,"Create a Session Bar Chart",create-a-session-bar-chart,true,Easy,157,262,Database,74.9%,1435,true,Database;,false,false,74.89278274721235,24448,32644
1547,"Destination City",destination-city,false,Easy,2242,105,Algorithms,79.5%,1436,false,Array;Hash Table;String;,true,false,79.47173079980483,289924,364814
1548,"Check If All 1's Are at Least Length K Places Away",check-if-all-1s-are-at-least-length-k-places-away,false,Easy,643,226,Algorithms,58.1%,1437,false,Array;,true,false,58.094660110480476,84239,145003
1549,"Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit",longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit,false,Medium,4173,199,Algorithms,56.6%,1438,false,Array;Queue;Sliding Window;Heap (Priority Queue);Ordered Set;Monotonic Queue;,true,false,56.64911336028694,248284,438284
1550,"Find the Kth Smallest Sum of a Matrix With Sorted Rows",find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows,false,Hard,1248,20,Algorithms,62.0%,1439,false,Array;Binary Search;Heap (Priority Queue);Matrix;,false,false,62.043699035710155,37511,60459
1565,"Evaluate Boolean Expression",evaluate-boolean-expression,true,Medium,218,30,Database,72.5%,1440,true,Database;,false,false,72.52346425870735,32603,44957
1552,"Build an Array With Stack Operations",build-an-array-with-stack-operations,false,Medium,1011,487,Algorithms,80.1%,1441,false,Array;Stack;Simulation;,true,false,80.09684147115065,175509,219120
1553,"Count Triplets That Can Form Two Arrays of Equal XOR",count-triplets-that-can-form-two-arrays-of-equal-xor,false,Medium,1967,132,Algorithms,84.9%,1442,false,Array;Hash Table;Math;Bit Manipulation;Prefix Sum;,true,false,84.88080998228654,129860,152991
1554,"Minimum Time to Collect All Apples in a Tree",minimum-time-to-collect-all-apples-in-a-tree,false,Medium,3696,325,Algorithms,62.7%,1443,false,Hash Table;Tree;Depth-First Search;Breadth-First Search;,true,false,62.6770138957981,132292,211070
1555,"Number of Ways of Cutting a Pizza",number-of-ways-of-cutting-a-pizza,false,Hard,1853,96,Algorithms,61.8%,1444,false,Array;Dynamic Programming;Memoization;Matrix;,true,false,61.779999825797624,70929,114809
1578,"Apples & Oranges",apples-oranges,true,Medium,243,23,Database,86.0%,1445,true,Database;,true,false,86.01850470079093,57641,67010
1542,"Consecutive Characters",consecutive-characters,false,Easy,1766,34,Algorithms,60.1%,1446,false,String;,true,false,60.101762305300035,183207,304828
1543,"Simplified Fractions",simplified-fractions,false,Medium,425,43,Algorithms,67.7%,1447,false,Math;String;Number Theory;,false,false,67.68187648891332,36934,54570
1544,"Count Good Nodes in Binary Tree",count-good-nodes-in-binary-tree,false,Medium,5980,186,Algorithms,73.2%,1448,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,true,73.20036404548466,626540,855926
1545,"Form Largest Integer With Digits That Add up to Target",form-largest-integer-with-digits-that-add-up-to-target,false,Hard,704,18,Algorithms,48.4%,1449,false,Array;Dynamic Programming;,false,false,48.4061565394996,19908,41127
1560,"Number of Students Doing Homework at a Given Time",number-of-students-doing-homework-at-a-given-time,false,Easy,894,154,Algorithms,75.7%,1450,false,Array;,false,false,75.67047627720608,132950,175696
1561,"Rearrange Words in a Sentence",rearrange-words-in-a-sentence,false,Medium,764,75,Algorithms,65.3%,1451,false,String;Sorting;,false,false,65.32546307615289,56110,85893
1562,"People Whose List of Favorite Companies Is Not a Subset of Another List",people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list,false,Medium,363,227,Algorithms,58.9%,1452,false,Array;Hash Table;String;,false,false,58.93709602467154,27902,47342
1563,"Maximum Number of Darts Inside of a Circular Dartboard",maximum-number-of-darts-inside-of-a-circular-dartboard,false,Hard,151,272,Algorithms,38.5%,1453,false,Array;Math;Geometry;,false,false,38.54533266297972,6900,17901
1579,"Active Users",active-users,true,Medium,409,40,Database,36.7%,1454,true,Database;,false,false,36.678215829352375,41921,114294
1566,"Check If a Word Occurs As a Prefix of Any Word in a Sentence",check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence,false,Easy,1272,57,Algorithms,68.9%,1455,false,Two Pointers;String;String Matching;,true,false,68.88497555998092,209276,303805
1567,"Maximum Number of Vowels in a Substring of Given Length",maximum-number-of-vowels-in-a-substring-of-given-length,false,Medium,3600,138,Algorithms,59.5%,1456,false,String;Sliding Window;,true,false,59.47100873923436,441161,741805
1568,"Pseudo-Palindromic Paths in a Binary Tree",pseudo-palindromic-paths-in-a-binary-tree,false,Medium,3278,130,Algorithms,68.3%,1457,false,Bit Manipulation;Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,68.33831584133424,224708,328817
1569,"Max Dot Product of Two Subsequences",max-dot-product-of-two-subsequences,false,Hard,1668,33,Algorithms,62.3%,1458,false,Array;Dynamic Programming;,true,false,62.32442001592492,80621,129357
1607,"Rectangles Area",rectangles-area,true,Medium,97,162,Database,68.6%,1459,true,Database;,false,false,68.59764089121887,18319,26705
1556,"Make Two Arrays Equal by Reversing Subarrays",make-two-arrays-equal-by-reversing-subarrays,false,Easy,1469,162,Algorithms,75.9%,1460,false,Array;Hash Table;Sorting;,true,false,75.90319754386223,309282,407469
1557,"Check If a String Contains All Binary Codes of Size K",check-if-a-string-contains-all-binary-codes-of-size-k,false,Medium,2265,100,Algorithms,56.6%,1461,false,Hash Table;String;Bit Manipulation;Rolling Hash;Hash Function;,true,false,56.56895973450546,128183,226596
1558,"Course Schedule IV",course-schedule-iv,false,Medium,1512,69,Algorithms,50.6%,1462,false,Depth-First Search;Breadth-First Search;Graph;Topological Sort;,false,false,50.56129932386506,70667,139765
1559,"Cherry Pickup II",cherry-pickup-ii,false,Hard,4176,48,Algorithms,71.8%,1463,false,Array;Dynamic Programming;Matrix;,true,false,71.83111722273368,184917,257433
1574,"Maximum Product of Two Elements in an Array",maximum-product-of-two-elements-in-an-array,false,Easy,2512,237,Algorithms,83.0%,1464,false,Array;Sorting;Heap (Priority Queue);,true,false,83.00955169318117,410542,494572
1575,"Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts",maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts,false,Medium,2626,352,Algorithms,41.2%,1465,false,Array;Greedy;Sorting;,true,false,41.15319115996439,170124,413392
1576,"Reorder Routes to Make All Paths Lead to the City Zero",reorder-routes-to-make-all-paths-lead-to-the-city-zero,false,Medium,4313,131,Algorithms,64.6%,1466,false,Depth-First Search;Breadth-First Search;Graph;,true,false,64.64618813373262,233784,361639
1577,"Probability of a Two Boxes Having The Same Number of Distinct Balls",probability-of-a-two-boxes-having-the-same-number-of-distinct-balls,false,Hard,286,174,Algorithms,59.9%,1467,false,Array;Math;Dynamic Programming;Backtracking;Combinatorics;Probability and Statistics;,false,false,59.926494293635955,9294,15509
1608,"Calculate Salaries",calculate-salaries,true,Medium,130,24,Database,78.2%,1468,true,Database;,false,false,78.23466221055145,26218,33512
1609,"Find All The Lonely Nodes",find-all-the-lonely-nodes,true,Easy,511,11,Algorithms,83.9%,1469,true,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,83.88795925791197,57652,68725
1580,"Shuffle the Array",shuffle-the-array,false,Easy,5870,315,Algorithms,88.7%,1470,false,Array;,true,false,88.71843666058056,758983,855497
1581,"The k Strongest Values in an Array",the-k-strongest-values-in-an-array,false,Medium,707,159,Algorithms,61.6%,1471,false,Array;Two Pointers;Sorting;,false,false,61.64742682654353,41387,67135
1582,"Design Browser History",design-browser-history,false,Medium,3934,247,Algorithms,77.8%,1472,false,Array;Linked List;Stack;Design;Doubly-Linked List;Data Stream;,true,false,77.80313695998787,266917,343068
1583,"Paint House III",paint-house-iii,false,Hard,2081,152,Algorithms,60.9%,1473,false,Array;Dynamic Programming;,true,false,60.93275670424719,65234,107058
1618,"Delete N Nodes After M Nodes of a Linked List",delete-n-nodes-after-m-nodes-of-a-linked-list,true,Easy,411,15,Algorithms,73.5%,1474,true,Linked List;,true,false,73.47274436090225,34397,46816
1570,"Final Prices With a Special Discount in a Shop",final-prices-with-a-special-discount-in-a-shop,false,Easy,2665,136,Algorithms,83.1%,1475,false,Array;Stack;Monotonic Stack;,true,false,83.10093288891268,294941,354919
1572,"Subrectangle Queries",subrectangle-queries,false,Medium,646,1448,Algorithms,88.3%,1476,false,Array;Design;Matrix;,false,false,88.2772001091339,116480,131948
1573,"Find Two Non-overlapping Sub-arrays Each With Target Sum",find-two-non-overlapping-sub-arrays-each-with-target-sum,false,Medium,1722,88,Algorithms,36.5%,1477,false,Array;Hash Table;Binary Search;Dynamic Programming;Sliding Window;,false,false,36.5497822550643,50104,137086
1571,"Allocate Mailboxes",allocate-mailboxes,false,Hard,1131,21,Algorithms,55.6%,1478,false,Array;Math;Dynamic Programming;Sorting;,false,false,55.5526368963427,27493,49490
1623,"Sales by Day of the Week",sales-by-day-of-the-week,true,Hard,155,39,Database,77.5%,1479,true,Database;,true,false,77.45572969672297,19027,24565
1603,"Running Sum of 1d Array",running-sum-of-1d-array,false,Easy,8053,354,Algorithms,86.9%,1480,false,Array;Prefix Sum;,true,true,86.91505939545732,1976657,2274239
1604,"Least Number of Unique Integers after K Removals",least-number-of-unique-integers-after-k-removals,false,Medium,2273,232,Algorithms,63.2%,1481,false,Array;Hash Table;Greedy;Sorting;Counting;,true,false,63.22219687660199,257753,407695
1605,"Minimum Number of Days to Make m Bouquets",minimum-number-of-days-to-make-m-bouquets,false,Medium,4844,260,Algorithms,55.4%,1482,false,Array;Binary Search;,true,false,55.39683081327374,308447,556791
1296,"Kth Ancestor of a Tree Node",kth-ancestor-of-a-tree-node,false,Hard,1971,121,Algorithms,35.3%,1483,false,Binary Search;Dynamic Programming;Tree;Depth-First Search;Breadth-First Search;Design;,false,false,35.253177854816684,40269,114228
1625,"Group Sold Products By The Date",group-sold-products-by-the-date,false,Easy,1484,115,Database,77.6%,1484,false,Database;,true,false,77.58325507890336,270988,349287
1624,"Clone Binary Tree With Random Pointer",clone-binary-tree-with-random-pointer,true,Medium,424,88,Algorithms,80.7%,1485,true,Hash Table;Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,80.71855653738294,30510,37798
1610,"XOR Operation in an Array",xor-operation-in-an-array,false,Easy,1414,334,Algorithms,86.4%,1486,false,Math;Bit Manipulation;,false,false,86.43126813338891,213595,247127
1611,"Making File Names Unique",making-file-names-unique,false,Medium,452,729,Algorithms,37.5%,1487,false,Array;Hash Table;String;,false,false,37.54250712852466,35549,94690
1612,"Avoid Flood in The City",avoid-flood-in-the-city,false,Medium,1553,294,Algorithms,27.1%,1488,false,Array;Hash Table;Binary Search;Greedy;Heap (Priority Queue);,false,false,27.123788960083,38691,142646
1613,"Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree",find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree,false,Hard,1885,160,Algorithms,67.0%,1489,false,Union Find;Graph;Sorting;Minimum Spanning Tree;Strongly Connected Component;,true,false,66.96987958656918,58897,87946
1634,"Clone N-ary Tree",clone-n-ary-tree,true,Medium,415,16,Algorithms,83.2%,1490,true,Hash Table;Tree;Depth-First Search;Breadth-First Search;,true,false,83.16712563163384,31107,37403
1584,"Average Salary Excluding the Minimum and Maximum Salary",average-salary-excluding-the-minimum-and-maximum-salary,false,Easy,2238,187,Algorithms,63.5%,1491,false,Array;Sorting;,true,false,63.45728143265763,357181,562869
1585,"The kth Factor of n",the-kth-factor-of-n,false,Medium,1835,303,Algorithms,68.9%,1492,false,Math;Number Theory;,false,false,68.87986625268688,288400,418700
1586,"Longest Subarray of 1's After Deleting One Element",longest-subarray-of-1s-after-deleting-one-element,false,Medium,4101,88,Algorithms,68.4%,1493,false,Array;Dynamic Programming;Sliding Window;,true,false,68.40526550341092,359179,525073
1587,"Parallel Courses II",parallel-courses-ii,false,Hard,1059,75,Algorithms,29.5%,1494,false,Dynamic Programming;Bit Manipulation;Graph;Bitmask;,false,false,29.496443731455585,20777,70439
1639,"Friendly Movies Streamed Last Month",friendly-movies-streamed-last-month,true,Easy,90,38,Database,49.0%,1495,true,Database;,true,false,49.007107170501726,34822,71055
1619,"Path Crossing",path-crossing,false,Easy,1498,46,Algorithms,62.5%,1496,false,Hash Table;String;,true,false,62.464950751312095,173765,278180
1620,"Check If Array Pairs Are Divisible by k",check-if-array-pairs-are-divisible-by-k,false,Medium,2495,153,Algorithms,46.2%,1497,false,Array;Hash Table;Counting;,true,false,46.23334931218315,190965,413046
1621,"Number of Subsequences That Satisfy the Given Sum Condition",number-of-subsequences-that-satisfy-the-given-sum-condition,false,Medium,3994,384,Algorithms,43.8%,1498,false,Array;Two Pointers;Binary Search;Sorting;,true,false,43.772628056829916,133958,306031
1622,"Max Value of Equation",max-value-of-equation,false,Hard,1354,61,Algorithms,44.2%,1499,false,Array;Queue;Sliding Window;Heap (Priority Queue);Monotonic Queue;,false,false,44.23467145435333,47304,106940
1640,"Design a File Sharing System",design-a-file-sharing-system,true,Medium,49,124,Algorithms,42.1%,1500,true,Hash Table;Design;Sorting;Heap (Priority Queue);Data Stream;,false,false,42.07500214537029,4903,11653
1641,"Countries You Can Safely Invest In",countries-you-can-safely-invest-in,true,Medium,304,147,Database,50.3%,1501,true,Database;,false,false,50.34587243238165,42868,85147
1626,"Can Make Arithmetic Progression From Sequence",can-make-arithmetic-progression-from-sequence,false,Easy,2188,112,Algorithms,69.4%,1502,false,Array;Sorting;,true,false,69.4467403996274,264663,381103
1627,"Last Moment Before All Ants Fall Out of a Plank",last-moment-before-all-ants-fall-out-of-a-plank,false,Medium,1514,421,Algorithms,68.3%,1503,false,Array;Brainteaser;Simulation;,true,false,68.34734934030668,92001,134608
1628,"Count Submatrices With All Ones",count-submatrices-with-all-ones,false,Medium,2140,173,Algorithms,57.2%,1504,false,Array;Dynamic Programming;Stack;Matrix;Monotonic Stack;,false,false,57.188429802766784,55932,97803
1629,"Minimum Possible Integer After at Most K Adjacent Swaps On Digits",minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits,false,Hard,490,27,Algorithms,40.1%,1505,false,String;Greedy;Binary Indexed Tree;Segment Tree;,false,false,40.09990588575979,11078,27626
1650,"Find Root of N-Ary Tree",find-root-of-n-ary-tree,true,Medium,480,204,Algorithms,78.4%,1506,true,Hash Table;Bit Manipulation;Tree;Depth-First Search;,true,false,78.36651178652116,36768,46918
1283,"Reformat Date",reformat-date,false,Easy,485,439,Algorithms,67.0%,1507,false,String;,false,false,67.00255555914987,82850,123652
1615,"Range Sum of Sorted Subarray Sums",range-sum-of-sorted-subarray-sums,false,Medium,1542,261,Algorithms,63.2%,1508,false,Array;Two Pointers;Binary Search;Sorting;,true,false,63.1740676673149,176394,279219
1616,"Minimum Difference Between Largest and Smallest Value in Three Moves",minimum-difference-between-largest-and-smallest-value-in-three-moves,false,Medium,2498,282,Algorithms,59.2%,1509,false,Array;Greedy;Sorting;,true,false,59.243603347210296,240641,406189
1617,"Stone Game IV",stone-game-iv,false,Hard,1615,71,Algorithms,59.5%,1510,false,Math;Dynamic Programming;Game Theory;,true,false,59.52658969818353,76978,129317
1654,"Customer Order Frequency",customer-order-frequency,true,Easy,323,57,Database,67.2%,1511,true,Database;,true,false,67.19271755858183,46281,68878
1635,"Number of Good Pairs",number-of-good-pairs,false,Easy,5554,269,Algorithms,89.4%,1512,false,Array;Hash Table;Math;Counting;,true,false,89.39578911205722,874319,978032
1636,"Number of Substrings With Only 1s",number-of-substrings-with-only-1s,false,Medium,889,33,Algorithms,47.3%,1513,false,Math;String;,false,false,47.2914214103976,49813,105332
1325,"Path with Maximum Probability",path-with-maximum-probability,false,Medium,3710,104,Algorithms,65.4%,1514,false,Array;Graph;Heap (Priority Queue);Shortest Path;,true,false,65.35764710561378,328660,502866
1638,"Best Position for a Service Centre",best-position-for-a-service-centre,false,Hard,240,267,Algorithms,34.6%,1515,false,Array;Math;Geometry;Randomized;,false,false,34.59222886421862,16203,46840
1655,"Move Sub-Tree of N-Ary Tree",move-sub-tree-of-n-ary-tree,true,Hard,34,65,Algorithms,60.8%,1516,true,Tree;Depth-First Search;,false,false,60.75853350189634,2403,3955
1664,"Find Users With Valid E-Mails",find-users-with-valid-e-mails,false,Easy,524,263,Database,44.0%,1517,false,Database;,true,false,44.041491146512364,169569,385033
1642,"Water Bottles",water-bottles,false,Easy,1720,138,Algorithms,70.9%,1518,false,Math;Simulation;,true,false,70.9237443996384,250275,352879
1643,"Number of Nodes in the Sub-Tree With the Same Label",number-of-nodes-in-the-sub-tree-with-the-same-label,false,Medium,2282,809,Algorithms,55.0%,1519,false,Hash Table;Tree;Depth-First Search;Breadth-First Search;Counting;,true,false,54.98953465578187,86961,158141
1644,"Maximum Number of Non-Overlapping Substrings",maximum-number-of-non-overlapping-substrings,false,Hard,838,79,Algorithms,39.8%,1520,false,String;Greedy;,false,false,39.783431455004205,18921,47560
1645,"Find a Value of a Mysterious Function Closest to Target",find-a-value-of-a-mysterious-function-closest-to-target,false,Hard,389,17,Algorithms,45.6%,1521,false,Array;Binary Search;Bit Manipulation;Segment Tree;,false,false,45.59947247973314,11756,25781
1665,"Diameter of N-Ary Tree",diameter-of-n-ary-tree,true,Medium,618,9,Algorithms,74.7%,1522,true,Tree;Depth-First Search;,true,false,74.66319420004224,53037,71035
1630,"Count Odd Numbers in an Interval Range",count-odd-numbers-in-an-interval-range,false,Easy,2771,160,Algorithms,50.2%,1523,false,Math;,true,false,50.212403109458315,358618,714203
1631,"Number of Sub-arrays With Odd Sum",number-of-sub-arrays-with-odd-sum,false,Medium,1377,60,Algorithms,43.9%,1524,false,Array;Math;Dynamic Programming;Prefix Sum;,false,false,43.86277157235792,42882,97764
1632,"Number of Good Ways to Split a String",number-of-good-ways-to-split-a-string,false,Medium,2075,50,Algorithms,68.3%,1525,false,Hash Table;String;Dynamic Programming;Bit Manipulation;,false,false,68.26206428108308,110547,161945
1633,"Minimum Number of Increments on Subarrays to Form a Target Array",minimum-number-of-increments-on-subarrays-to-form-a-target-array,false,Hard,1590,78,Algorithms,72.0%,1526,false,Array;Dynamic Programming;Stack;Greedy;Monotonic Stack;,false,false,72.00954146518532,55544,77135
1670,"Patients With a Condition",patients-with-a-condition,false,Easy,700,599,Database,39.9%,1527,false,Database;,true,false,39.85978012860402,288244,723134
1651,"Shuffle String",shuffle-string,false,Easy,2800,528,Algorithms,85.0%,1528,false,Array;String;,false,false,84.97146365768468,422080,496732
1652,"Minimum Suffix Flips",minimum-suffix-flips,false,Medium,1037,45,Algorithms,73.4%,1529,false,String;Greedy;,false,false,73.39466861328567,58315,79454
1653,"Number of Good Leaf Nodes Pairs",number-of-good-leaf-nodes-pairs,false,Medium,2429,109,Algorithms,71.9%,1530,false,Tree;Depth-First Search;Binary Tree;,true,false,71.86242846620206,152196,211788
1637,"String Compression II",string-compression-ii,false,Hard,2471,219,Algorithms,52.2%,1531,false,String;Dynamic Programming;,true,false,52.2202294443242,101325,194034
1671,"The Most Recent Three Orders",the-most-recent-three-orders,true,Medium,154,11,Database,68.7%,1532,true,Database;,false,false,68.69341046277665,32775,47712
1672,"Find the Index of the Large Integer",find-the-index-of-the-large-integer,true,Medium,256,33,Algorithms,56.0%,1533,true,Array;Binary Search;Interactive;,true,false,56.03355878330931,15160,27055
1656,"Count Good Triplets",count-good-triplets,false,Easy,787,1205,Algorithms,81.6%,1534,false,Array;Enumeration;,false,false,81.60287377678682,131754,161458
1657,"Find the Winner of an Array Game",find-the-winner-of-an-array-game,false,Medium,1583,82,Algorithms,56.8%,1535,false,Array;Simulation;,true,false,56.78240262268604,118125,208031
1658,"Minimum Swaps to Arrange a Binary Grid",minimum-swaps-to-arrange-a-binary-grid,false,Medium,569,72,Algorithms,47.6%,1536,false,Array;Greedy;Matrix;,false,false,47.63948497854077,16317,34251
1659,"Get the Maximum Score",get-the-maximum-score,false,Hard,1016,54,Algorithms,39.8%,1537,false,Array;Two Pointers;Dynamic Programming;Greedy;,false,false,39.771511130136986,29730,74752
1681,"Guess the Majority in a Hidden Array",guess-the-majority-in-a-hidden-array,true,Medium,140,118,Algorithms,69.7%,1538,true,Array;Math;Interactive;,true,false,69.73867326426473,4510,6467
1646,"Kth Missing Positive Number",kth-missing-positive-number,false,Easy,6995,489,Algorithms,61.4%,1539,false,Array;Binary Search;,true,false,61.41678352513791,548767,893516
1647,"Can Convert String in K Moves",can-convert-string-in-k-moves,false,Medium,398,320,Algorithms,35.6%,1540,false,Hash Table;String;,false,false,35.64853833060664,21572,60513
1648,"Minimum Insertions to Balance a Parentheses String",minimum-insertions-to-balance-a-parentheses-string,false,Medium,1163,277,Algorithms,52.8%,1541,false,String;Stack;Greedy;,false,false,52.7987248791417,70226,133007
1668,"Find Longest Awesome Substring",find-longest-awesome-substring,false,Hard,832,15,Algorithms,44.7%,1542,false,Hash Table;String;Bit Manipulation;,false,false,44.6852036284353,16601,37151
1686,"Fix Product Name Format",fix-product-name-format,true,Easy,91,44,Database,59.1%,1543,true,Database;,false,false,59.12611826314641,21678,36664
1666,"Make The String Great",make-the-string-great,false,Easy,3085,176,Algorithms,68.2%,1544,false,String;Stack;,true,false,68.19821025775245,341344,500517
1667,"Find Kth Bit in Nth Binary String",find-kth-bit-in-nth-binary-string,false,Medium,1446,94,Algorithms,70.2%,1545,false,String;Recursion;Simulation;,true,false,70.24994109437587,155035,220691
1649,"Maximum Number of Non-Overlapping Subarrays With Sum Equals Target",maximum-number-of-non-overlapping-subarrays-with-sum-equals-target,false,Medium,1087,28,Algorithms,48.1%,1546,false,Array;Hash Table;Greedy;Prefix Sum;,false,false,48.07764853819554,30587,63620
1669,"Minimum Cost to Cut a Stick",minimum-cost-to-cut-a-stick,false,Hard,4408,126,Algorithms,61.8%,1547,false,Array;Dynamic Programming;Sorting;,true,false,61.78587558438071,151852,245771
1687,"The Most Similar Path in a Graph",the-most-similar-path-in-a-graph,true,Hard,377,186,Algorithms,59.3%,1548,true,Dynamic Programming;Graph;,true,false,59.26686414433823,17607,29708
1688,"The Most Recent Orders for Each Product",the-most-recent-orders-for-each-product,true,Medium,138,12,Database,64.9%,1549,true,Database;,true,false,64.9363857535995,32563,50146
1293,"Three Consecutive Odds",three-consecutive-odds,false,Easy,1142,95,Algorithms,68.2%,1550,false,Array;,true,false,68.19671666938035,289002,423777
1674,"Minimum Operations to Make Array Equal",minimum-operations-to-make-array-equal,false,Medium,1452,184,Algorithms,82.3%,1551,false,Math;,true,false,82.2949910908731,103918,126275
1675,"Magnetic Force Between Two Balls",magnetic-force-between-two-balls,false,Medium,2966,263,Algorithms,71.1%,1552,false,Array;Binary Search;Sorting;,true,false,71.11191098699851,179783,252817
1676,"Minimum Number of Days to Eat N Oranges",minimum-number-of-days-to-eat-n-oranges,false,Hard,1006,60,Algorithms,35.5%,1553,false,Dynamic Programming;Memoization;,false,false,35.47398943761192,39026,110013
1697,"Strings Differ by One Character",strings-differ-by-one-character,true,Medium,379,100,Algorithms,41.4%,1554,true,Hash Table;String;Rolling Hash;Hash Function;,false,false,41.359439566115704,25623,61952
1702,"Bank Account Summary",bank-account-summary,true,Medium,143,28,Database,51.5%,1555,true,Database;,false,false,51.54822667190159,19694,38205
1660,"Thousand Separator",thousand-separator,false,Easy,497,41,Algorithms,53.7%,1556,false,String;,false,false,53.689550909866625,57887,107818
1661,"Minimum Number of Vertices to Reach All Nodes",minimum-number-of-vertices-to-reach-all-nodes,false,Medium,3731,130,Algorithms,81.1%,1557,false,Graph;,true,false,81.05889155034278,196276,242140
1662,"Minimum Numbers of Function Calls to Make Target Array",minimum-numbers-of-function-calls-to-make-target-array,false,Medium,631,37,Algorithms,63.4%,1558,false,Array;Greedy;Bit Manipulation;,false,false,63.36666300406548,23068,36404
1663,"Detect Cycles in 2D Grid",detect-cycles-in-2d-grid,false,Medium,1187,29,Algorithms,49.3%,1559,false,Array;Depth-First Search;Breadth-First Search;Union Find;Matrix;,false,false,49.261731077655334,47609,96645
1682,"Most Visited Sector in  a Circular Track",most-visited-sector-in-a-circular-track,false,Easy,320,646,Algorithms,59.0%,1560,false,Array;Simulation;,false,false,58.99311021955885,34849,59073
1683,"Maximum Number of Coins You Can Get",maximum-number-of-coins-you-can-get,false,Medium,1907,215,Algorithms,84.4%,1561,false,Array;Math;Greedy;Sorting;Game Theory;,true,false,84.40374947481274,174772,207067
1684,"Find Latest Group of Size M",find-latest-group-of-size-m,false,Medium,656,138,Algorithms,42.9%,1562,false,Array;Hash Table;Binary Search;Simulation;,false,false,42.94976764770967,19409,45190
1685,"Stone Game V",stone-game-v,false,Hard,668,89,Algorithms,41.0%,1563,false,Array;Math;Dynamic Programming;Game Theory;,false,false,40.983032737053485,22246,54281
1703,"Put Boxes Into the Warehouse I",put-boxes-into-the-warehouse-i,true,Medium,339,30,Algorithms,67.4%,1564,true,Array;Greedy;Sorting;,true,false,67.41092826330085,16877,25036
1712,"Unique Orders and Customers Per Month",unique-orders-and-customers-per-month,true,Easy,78,46,Database,82.2%,1565,true,Database;,false,false,82.16172430795238,23329,28394
1689,"Detect Pattern of Length M Repeated K or More Times",detect-pattern-of-length-m-repeated-k-or-more-times,false,Easy,669,138,Algorithms,43.4%,1566,false,Array;Enumeration;,false,false,43.392090293859745,38599,88954
1690,"Maximum Length of Subarray With Positive Product",maximum-length-of-subarray-with-positive-product,false,Medium,2432,73,Algorithms,44.3%,1567,false,Array;Dynamic Programming;Greedy;,false,false,44.32462582504416,100128,225897
1691,"Minimum Number of Days to Disconnect Island",minimum-number-of-days-to-disconnect-island,false,Hard,1248,219,Algorithms,59.5%,1568,false,Array;Depth-First Search;Breadth-First Search;Matrix;Strongly Connected Component;,true,false,59.51441889053937,92952,156184
1692,"Number of Ways to Reorder Array to Get Same BST",number-of-ways-to-reorder-array-to-get-same-bst,false,Hard,1805,209,Algorithms,53.5%,1569,false,Array;Math;Divide and Conquer;Dynamic Programming;Tree;Union Find;Binary Search Tree;Memoization;Combinatorics;Binary Tree;,true,false,53.46608011113684,57730,107974
1713,"Dot Product of Two Sparse Vectors",dot-product-of-two-sparse-vectors,true,Medium,1246,155,Algorithms,89.9%,1570,true,Array;Hash Table;Two Pointers;Design;,true,false,89.8887100986529,320086,356092
1718,"Warehouse Manager",warehouse-manager,true,Easy,160,11,Database,87.5%,1571,true,Database;,true,false,87.51316066540325,45716,52239
1677,"Matrix Diagonal Sum",matrix-diagonal-sum,false,Easy,3543,58,Algorithms,83.4%,1572,false,Array;Matrix;,true,false,83.39325666449264,404042,484503
1678,"Number of Ways to Split a String",number-of-ways-to-split-a-string,false,Medium,750,85,Algorithms,33.6%,1573,false,Math;String;,false,false,33.607976908947784,32020,95275
1679,"Shortest Subarray to be Removed to Make Array Sorted",shortest-subarray-to-be-removed-to-make-array-sorted,false,Medium,2339,142,Algorithms,51.8%,1574,false,Array;Two Pointers;Binary Search;Stack;Monotonic Stack;,true,false,51.775517286448924,114876,221868
1680,"Count All Possible Routes",count-all-possible-routes,false,Hard,1639,60,Algorithms,65.1%,1575,false,Array;Dynamic Programming;Memoization;,true,false,65.08037338903304,60445,92878
1698,"Replace All ?'s to Avoid Consecutive Repeating Characters",replace-all-s-to-avoid-consecutive-repeating-characters,false,Easy,573,179,Algorithms,45.7%,1576,false,String;,false,false,45.660774410774415,65093,142558
1699,"Number of Ways Where Square of Number Is Equal to Product of Two Numbers",number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers,false,Medium,385,56,Algorithms,41.7%,1577,false,Array;Hash Table;Math;Two Pointers;,false,false,41.68339995947166,22627,54283
1700,"Minimum Time to Make Rope Colorful",minimum-time-to-make-rope-colorful,false,Medium,3851,136,Algorithms,63.6%,1578,false,Array;String;Dynamic Programming;Greedy;,true,false,63.56952203526872,268887,422981
1701,"Remove Max Number of Edges to Keep Graph Fully Traversable",remove-max-number-of-edges-to-keep-graph-fully-traversable,false,Hard,2577,46,Algorithms,70.6%,1579,false,Union Find;Graph;,true,false,70.6012588164595,133932,189701
1719,"Put Boxes Into the Warehouse II",put-boxes-into-the-warehouse-ii,true,Medium,222,12,Algorithms,66.1%,1580,true,Array;Greedy;Sorting;,true,false,66.08650951017111,8999,13617
1724,"Customer Who Visited but Did Not Make Any Transactions",customer-who-visited-but-did-not-make-any-transactions,false,Easy,2483,347,Database,67.7%,1581,false,Database;,true,false,67.68840912985057,675516,997978
1704,"Special Positions in a Binary Matrix",special-positions-in-a-binary-matrix,false,Easy,1461,70,Algorithms,68.6%,1582,false,Array;Matrix;,true,false,68.63613961198979,153189,223190
1705,"Count Unhappy Friends",count-unhappy-friends,false,Medium,287,867,Algorithms,61.8%,1583,false,Array;Simulation;,false,false,61.79315099045032,30477,49321
1706,"Min Cost to Connect All Points",min-cost-to-connect-all-points,false,Medium,5197,134,Algorithms,68.0%,1584,false,Array;Union Find;Graph;Minimum Spanning Tree;,true,false,68.02828043903004,340518,500555
1707,"Check If String Is Transformable With Substring Sort Operations",check-if-string-is-transformable-with-substring-sort-operations,false,Hard,447,9,Algorithms,48.8%,1585,false,String;Greedy;Sorting;,false,false,48.821117375704766,9525,19510
1729,"Binary Search Tree Iterator II",binary-search-tree-iterator-ii,true,Medium,267,52,Algorithms,62.8%,1586,true,Stack;Tree;Design;Binary Search Tree;Binary Tree;Iterator;,true,false,62.84716582751339,15478,24628
1734,"Bank Account Summary II",bank-account-summary-ii,false,Easy,497,6,Database,83.4%,1587,false,Database;,true,false,83.43623619164295,119845,143641
1693,"Sum of All Odd Length Subarrays",sum-of-all-odd-length-subarrays,false,Easy,3752,312,Algorithms,83.3%,1588,false,Array;Math;Prefix Sum;,true,false,83.33610279200077,215653,258775
1695,"Maximum Sum Obtained of Any Permutation",maximum-sum-obtained-of-any-permutation,false,Medium,791,40,Algorithms,38.7%,1589,false,Array;Greedy;Sorting;Prefix Sum;,false,false,38.670143860366814,22687,58668
1694,"Make Sum Divisible by P",make-sum-divisible-by-p,false,Medium,2375,165,Algorithms,39.6%,1590,false,Array;Hash Table;Prefix Sum;,true,false,39.62469737183278,136009,343243
1696,"Strange Printer II",strange-printer-ii,false,Hard,645,22,Algorithms,59.6%,1591,false,Array;Graph;Topological Sort;Matrix;,false,false,59.57565346580621,12832,21539
1714,"Rearrange Spaces Between Words",rearrange-spaces-between-words,false,Easy,467,350,Algorithms,43.9%,1592,false,String;,false,false,43.87477849970466,63138,143905
1715,"Split a String Into the Max Number of Unique Substrings",split-a-string-into-the-max-number-of-unique-substrings,false,Medium,1459,71,Algorithms,68.3%,1593,false,Hash Table;String;Backtracking;,true,false,68.25782549373064,137074,200818
1716,"Maximum Non Negative Product in a Matrix",maximum-non-negative-product-in-a-matrix,false,Medium,857,45,Algorithms,34.2%,1594,false,Array;Dynamic Programming;Matrix;,false,false,34.24057663988426,26507,77414
1717,"Minimum Cost to Connect Two Groups of Points",minimum-cost-to-connect-two-groups-of-points,false,Hard,476,15,Algorithms,49.0%,1595,false,Array;Dynamic Programming;Bit Manipulation;Matrix;Bitmask;,false,false,48.98765908214423,10161,20743
1735,"The Most Frequently Ordered Products for Each Customer",the-most-frequently-ordered-products-for-each-customer,true,Medium,248,17,Database,78.3%,1596,true,Database;,false,false,78.32390530064949,37384,47730
1736,"Build Binary Expression Tree From Infix Expression",build-binary-expression-tree-from-infix-expression,true,Hard,268,47,Algorithms,62.5%,1597,true,String;Stack;Tree;Binary Tree;,false,false,62.50228895806629,13653,21844
1720,"Crawler Log Folder",crawler-log-folder,false,Easy,1466,98,Algorithms,71.7%,1598,false,Array;String;Stack;,true,false,71.6540773262822,260962,364197
1721,"Maximum Profit of Operating a Centennial Wheel",maximum-profit-of-operating-a-centennial-wheel,false,Medium,110,253,Algorithms,44.1%,1599,false,Array;Simulation;,false,false,44.08633751306165,13501,30624
1722,"Throne Inheritance",throne-inheritance,false,Medium,301,312,Algorithms,65.9%,1600,false,Hash Table;Tree;Depth-First Search;Design;,false,false,65.8784123262435,19668,29853
1723,"Maximum Number of Achievable Transfer Requests",maximum-number-of-achievable-transfer-requests,false,Hard,1433,72,Algorithms,64.5%,1601,false,Array;Backtracking;Bit Manipulation;Enumeration;,true,false,64.46946577500633,58516,90765
1745,"Find Nearest Right Node in Binary Tree",find-nearest-right-node-in-binary-tree,true,Medium,331,10,Algorithms,75.3%,1602,true,Tree;Breadth-First Search;Binary Tree;,true,true,75.26844475233807,23903,31757
1708,"Design Parking System",design-parking-system,false,Easy,1978,450,Algorithms,88.0%,1603,false,Design;Simulation;Counting;,true,false,88.04047143056395,302982,344140
1709,"Alert Using Same Key-Card Three or More Times in a One Hour Period",alert-using-same-key-card-three-or-more-times-in-a-one-hour-period,false,Medium,317,426,Algorithms,46.0%,1604,false,Array;Hash Table;String;Sorting;,false,false,46.04585651943014,39884,86618
1711,"Find Valid Matrix Given Row and Column Sums",find-valid-matrix-given-row-and-column-sums,false,Medium,2146,93,Algorithms,83.0%,1605,false,Array;Greedy;Matrix;,true,false,82.95137678633671,152312,183616
1710,"Find Servers That Handled Most Number of Requests",find-servers-that-handled-most-number-of-requests,false,Hard,622,27,Algorithms,43.6%,1606,false,Array;Greedy;Heap (Priority Queue);Ordered Set;,true,false,43.589386447524205,18777,43077
1749,"Sellers With No Sales",sellers-with-no-sales,true,Easy,136,14,Database,54.4%,1607,true,Database;,true,false,54.42987055899551,37887,69607
1730,"Special Array With X Elements Greater Than or Equal X",special-array-with-x-elements-greater-than-or-equal-x,false,Easy,2249,451,Algorithms,66.8%,1608,false,Array;Binary Search;Sorting;,true,false,66.77230813333122,209635,313955
1731,"Even Odd Tree",even-odd-tree,false,Medium,1819,96,Algorithms,66.3%,1609,false,Tree;Breadth-First Search;Binary Tree;,true,false,66.30917926317164,172750,260522
1733,"Maximum Number of Visible Points",maximum-number-of-visible-points,false,Hard,591,755,Algorithms,37.4%,1610,false,Array;Math;Geometry;Sliding Window;Sorting;,false,false,37.41778339797503,44089,117829
1732,"Minimum One Bit Operations to Make Integers Zero",minimum-one-bit-operations-to-make-integers-zero,false,Hard,946,1045,Algorithms,73.6%,1611,false,Dynamic Programming;Bit Manipulation;Memoization;,true,false,73.57155640398497,61664,83815
1750,"Check If Two Expression Trees are Equivalent",check-if-two-expression-trees-are-equivalent,true,Medium,143,22,Algorithms,70.9%,1612,true,Hash Table;Tree;Depth-First Search;Binary Tree;Counting;,false,false,70.85942463018424,7808,11019
1759,"Find the Missing IDs",find-the-missing-ids,true,Medium,232,29,Database,73.0%,1613,true,Database;,false,false,73.03535642714,20409,27944
1737,"Maximum Nesting Depth of the Parentheses",maximum-nesting-depth-of-the-parentheses,false,Easy,2531,510,Algorithms,84.1%,1614,false,String;Stack;,true,false,84.0715208870519,397453,472756
1738,"Maximal Network Rank",maximal-network-rank,false,Medium,2379,377,Algorithms,65.3%,1615,false,Graph;,true,false,65.26173697784141,151325,231874
1739,"Split Two Strings to Make Palindrome",split-two-strings-to-make-palindrome,false,Medium,745,252,Algorithms,31.2%,1616,false,Two Pointers;String;,false,false,31.153524881855528,27225,87392
1740,"Count Subtrees With Max Distance Between Cities",count-subtrees-with-max-distance-between-cities,false,Hard,553,42,Algorithms,66.7%,1617,false,Dynamic Programming;Bit Manipulation;Tree;Enumeration;Bitmask;,false,false,66.7296891508647,12000,17983
1384,"Maximum Font to Fit a Sentence in a Screen",maximum-font-to-fit-a-sentence-in-a-screen,true,Medium,109,22,Algorithms,61.1%,1618,true,Array;String;Binary Search;Interactive;,false,false,61.07981627524048,7048,11539
1210,"Mean of Array After Removing Some Elements",mean-of-array-after-removing-some-elements,false,Easy,514,130,Algorithms,69.7%,1619,false,Array;Sorting;,false,false,69.67426477343487,68255,97963
1726,"Coordinate With Maximum Network Quality",coordinate-with-maximum-network-quality,false,Medium,82,269,Algorithms,38.3%,1620,false,Array;Enumeration;,false,false,38.26059505958488,9696,25342
1725,"Number of Sets of K Non-Overlapping Line Segments",number-of-sets-of-k-non-overlapping-line-segments,false,Medium,469,49,Algorithms,44.1%,1621,false,Math;Dynamic Programming;Combinatorics;,false,false,44.085720008011215,11006,24965
1728,"Fancy Sequence",fancy-sequence,false,Hard,374,139,Algorithms,17.8%,1622,false,Math;Design;Segment Tree;,false,false,17.84006685572589,13022,72993
1763,"All Valid Triplets That Can Represent a Country",all-valid-triplets-that-can-represent-a-country,true,Easy,75,139,Database,81.7%,1623,true,Database;,false,false,81.69495475200993,21034,25747
1746,"Largest Substring Between Two Equal Characters",largest-substring-between-two-equal-characters,false,Easy,1356,66,Algorithms,68.4%,1624,false,Hash Table;String;,true,false,68.44358756071911,164010,239628
1747,"Lexicographically Smallest String After Applying Operations",lexicographically-smallest-string-after-applying-operations,false,Medium,359,276,Algorithms,65.9%,1625,false,String;Depth-First Search;Breadth-First Search;Enumeration;,false,false,65.8700838913261,17117,25986
1748,"Best Team With No Conflicts",best-team-with-no-conflicts,false,Medium,2973,95,Algorithms,50.4%,1626,false,Array;Dynamic Programming;Sorting;,true,false,50.365401084784466,88215,175150
1223,"Graph Connectivity With Threshold",graph-connectivity-with-threshold,false,Hard,585,34,Algorithms,47.7%,1627,false,Array;Math;Union Find;Number Theory;,false,false,47.68251147638087,19320,40518
1768,"Design an Expression Tree With Evaluate Function",design-an-expression-tree-with-evaluate-function,true,Medium,538,73,Algorithms,82.4%,1628,true,Array;Math;Stack;Tree;Design;Binary Tree;,false,false,82.40244377227397,27515,33391
1751,"Slowest Key",slowest-key,false,Easy,773,111,Algorithms,59.2%,1629,false,Array;String;,true,false,59.23046051971505,106263,179406
1752,"Arithmetic Subarrays",arithmetic-subarrays,false,Medium,1841,205,Algorithms,83.7%,1630,false,Array;Hash Table;Sorting;,true,false,83.71495477187388,143356,171243
1753,"Path With Minimum Effort",path-with-minimum-effort,false,Medium,6115,211,Algorithms,60.7%,1631,false,Array;Binary Search;Depth-First Search;Breadth-First Search;Union Find;Heap (Priority Queue);Matrix;,true,false,60.68138489652788,307152,506171
1257,"Rank Transform of a Matrix",rank-transform-of-a-matrix,false,Hard,897,57,Algorithms,41.1%,1632,false,Array;Union Find;Graph;Topological Sort;Sorting;Matrix;,true,false,41.140837960625944,23635,57449
1773,"Percentage of Users Attended a Contest",percentage-of-users-attended-a-contest,false,Easy,819,87,Database,58.7%,1633,false,Database;,true,false,58.65673172097499,297480,507157
1774,"Add Two Polynomials Represented as Linked Lists",add-two-polynomials-represented-as-linked-lists,true,Medium,169,14,Algorithms,60.6%,1634,true,Linked List;Math;Two Pointers;,true,false,60.55572924808504,15495,25588
1779,"Hopper Company Queries I",hopper-company-queries-i,true,Hard,114,35,Database,47.8%,1635,true,Database;,true,false,47.814291564291565,9341,19536
1741,"Sort Array by Increasing Frequency",sort-array-by-increasing-frequency,false,Easy,3480,161,Algorithms,80.0%,1636,false,Array;Hash Table;Sorting;,true,false,79.98640395601022,291799,364811
1742,"Widest Vertical Area Between Two Points Containing No Points",widest-vertical-area-between-two-points-containing-no-points,false,Easy,946,1746,Algorithms,87.3%,1637,false,Array;Sorting;,true,false,87.31670779838097,181858,208274
1743,"Count Substrings That Differ by One Character",count-substrings-that-differ-by-one-character,false,Medium,1168,352,Algorithms,71.4%,1638,false,Hash Table;String;Dynamic Programming;Enumeration;,false,false,71.41772426510468,32920,46095
1744,"Number of Ways to Form a Target String Given a Dictionary",number-of-ways-to-form-a-target-string-given-a-dictionary,false,Hard,1980,115,Algorithms,57.5%,1639,false,Array;String;Dynamic Programming;,true,false,57.46921317112491,123341,214616
1760,"Check Array Formation Through Concatenation",check-array-formation-through-concatenation,false,Easy,915,141,Algorithms,56.8%,1640,false,Array;Hash Table;,true,false,56.81773007354403,85754,150929
1761,"Count Sorted Vowel Strings",count-sorted-vowel-strings,false,Medium,3878,91,Algorithms,78.7%,1641,false,Math;Dynamic Programming;Combinatorics;,true,false,78.69871292303672,192730,244896
1762,"Furthest Building You Can Reach",furthest-building-you-can-reach,false,Medium,5989,143,Algorithms,50.0%,1642,false,Array;Greedy;Heap (Priority Queue);,true,false,50.039685267703696,240204,480027
489,"Kth Smallest Instructions",kth-smallest-instructions,false,Hard,557,16,Algorithms,47.5%,1643,false,Array;Math;Dynamic Programming;Combinatorics;,false,false,47.473800515619246,14179,29867
1780,"Lowest Common Ancestor of a Binary Tree II",lowest-common-ancestor-of-a-binary-tree-ii,true,Medium,673,40,Algorithms,67.4%,1644,true,Tree;Depth-First Search;Binary Tree;,true,false,67.43608356586772,101259,150156
1785,"Hopper Company Queries II",hopper-company-queries-ii,true,Hard,63,17,Database,39.3%,1645,true,Database;,false,false,39.273262148616254,7209,18356
1769,"Get Maximum in Generated Array",get-maximum-in-generated-array,false,Easy,761,949,Algorithms,50.7%,1646,false,Array;Simulation;,true,false,50.737634303008115,113666,224027
1770,"Minimum Deletions to Make Character Frequencies Unique",minimum-deletions-to-make-character-frequencies-unique,false,Medium,4961,73,Algorithms,61.3%,1647,false,Hash Table;String;Greedy;Sorting;,true,false,61.29536200520596,282106,460240
1771,"Sell Diminishing-Valued Colored Balls",sell-diminishing-valued-colored-balls,false,Medium,1097,392,Algorithms,29.9%,1648,false,Array;Math;Binary Search;Greedy;Sorting;Heap (Priority Queue);,false,false,29.911343173883754,39069,130616
1772,"Create Sorted Array through Instructions",create-sorted-array-through-instructions,false,Hard,661,82,Algorithms,39.5%,1649,false,Array;Binary Search;Divide and Conquer;Binary Indexed Tree;Segment Tree;Merge Sort;Ordered Set;,true,false,39.53910854265606,27641,69908
1790,"Lowest Common Ancestor of a Binary Tree III",lowest-common-ancestor-of-a-binary-tree-iii,true,Medium,1450,56,Algorithms,81.4%,1650,true,Hash Table;Two Pointers;Tree;Binary Tree;,false,false,81.44811810750974,310488,381210
1795,"Hopper Company Queries III",hopper-company-queries-iii,true,Hard,35,62,Database,65.6%,1651,true,Database;,false,false,65.62472406181016,7432,11325
1755,"Defuse the Bomb",defuse-the-bomb,false,Easy,1401,155,Algorithms,79.2%,1652,false,Array;Sliding Window;,true,false,79.22411800064734,171336,216268
1756,"Minimum Deletions to Make String Balanced",minimum-deletions-to-make-string-balanced,false,Medium,2116,67,Algorithms,65.7%,1653,false,String;Dynamic Programming;Stack;,true,false,65.69136940364363,167490,254965
1757,"Minimum Jumps to Reach Home",minimum-jumps-to-reach-home,false,Medium,1511,281,Algorithms,29.8%,1654,false,Array;Dynamic Programming;Breadth-First Search;,false,false,29.811860420771623,46903,157330
1758,"Distribute Repeating Integers",distribute-repeating-integers,false,Hard,442,28,Algorithms,39.8%,1655,false,Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,false,false,39.810709609243986,17330,43531
1775,"Design an Ordered Stream",design-an-ordered-stream,false,Easy,540,3535,Algorithms,84.5%,1656,false,Array;Hash Table;Design;Data Stream;,false,false,84.47761460678171,94571,111948
1777,"Determine if Two Strings Are Close",determine-if-two-strings-are-close,false,Medium,3815,314,Algorithms,54.2%,1657,false,Hash Table;String;Sorting;Counting;,true,false,54.156617522279525,421241,777828
1776,"Minimum Operations to Reduce X to Zero",minimum-operations-to-reduce-x-to-zero,false,Medium,5529,121,Algorithms,39.9%,1658,false,Array;Hash Table;Binary Search;Sliding Window;Prefix Sum;,true,false,39.859661233671105,203248,509909
1778,"Maximize Grid Happiness",maximize-grid-happiness,false,Hard,334,54,Algorithms,40.1%,1659,false,Dynamic Programming;Bit Manipulation;Memoization;Bitmask;,false,false,40.06270796007166,6261,15628
1796,"Correct a Binary Tree",correct-a-binary-tree,true,Medium,270,46,Algorithms,74.3%,1660,true,Hash Table;Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,74.30221711989667,20711,27874
1801,"Average Time of Process per Machine",average-time-of-process-per-machine,false,Easy,1685,165,Database,68.8%,1661,false,Database;,true,false,68.78404991098577,436584,634719
1781,"Check If Two String Arrays are Equivalent",check-if-two-string-arrays-are-equivalent,false,Easy,3041,203,Algorithms,85.7%,1662,false,Array;String;,true,false,85.65943673380175,532996,622226
1782,"Smallest String With A Given Numeric Value",smallest-string-with-a-given-numeric-value,false,Medium,1886,63,Algorithms,67.0%,1663,false,String;Greedy;,true,false,66.96169422305995,98050,146427
1783,"Ways to Make a Fair Array",ways-to-make-a-fair-array,false,Medium,1336,41,Algorithms,63.9%,1664,false,Array;Prefix Sum;,false,false,63.900734960529896,42255,66126
1784,"Minimum Initial Energy to Finish Tasks",minimum-initial-energy-to-finish-tasks,false,Hard,596,37,Algorithms,58.6%,1665,false,Array;Greedy;Sorting;,false,false,58.56799293738013,19239,32849
1810,"Change the Root of a Binary Tree",change-the-root-of-a-binary-tree,true,Medium,65,194,Algorithms,74.0%,1666,true,Tree;Depth-First Search;Binary Tree;,false,false,74.00843881856541,5262,7110
1811,"Fix Names in a Table",fix-names-in-a-table,false,Easy,922,117,Database,61.2%,1667,false,Database;,true,false,61.237418798517176,296845,484740
1764,"Maximum Repeating Substring",maximum-repeating-substring,false,Easy,746,275,Algorithms,39.1%,1668,false,String;Dynamic Programming;String Matching;,false,false,39.10590080465518,68817,175976
1765,"Merge In Between Linked Lists",merge-in-between-linked-lists,false,Medium,2135,223,Algorithms,82.0%,1669,false,Linked List;,true,false,82.00704584727897,233013,284138
1767,"Design Front Middle Back Queue",design-front-middle-back-queue,false,Medium,768,106,Algorithms,56.9%,1670,false,Array;Linked List;Design;Queue;Data Stream;,false,false,56.924806351325245,32408,56932
1766,"Minimum Number of Removals to Make Mountain Array",minimum-number-of-removals-to-make-mountain-array,false,Hard,2173,38,Algorithms,55.0%,1671,false,Array;Binary Search;Dynamic Programming;Greedy;,true,false,55.01825585946209,111056,201853
1791,"Richest Customer Wealth",richest-customer-wealth,false,Easy,4482,367,Algorithms,88.4%,1672,false,Array;Matrix;,true,true,88.37188119519209,989599,1119813
1792,"Find the Most Competitive Subsequence",find-the-most-competitive-subsequence,false,Medium,2092,100,Algorithms,51.2%,1673,false,Array;Stack;Greedy;Monotonic Stack;,true,false,51.24571830078754,70016,136628
1793,"Minimum Moves to Make Array Complementary",minimum-moves-to-make-array-complementary,false,Medium,685,79,Algorithms,41.0%,1674,false,Array;Hash Table;Prefix Sum;,false,false,40.96714595549844,10200,24898
1794,"Minimize Deviation in Array",minimize-deviation-in-array,false,Hard,3051,173,Algorithms,54.0%,1675,false,Array;Greedy;Heap (Priority Queue);Ordered Set;,true,false,53.983920371806526,96757,179233
1816,"Lowest Common Ancestor of a Binary Tree IV",lowest-common-ancestor-of-a-binary-tree-iv,true,Medium,481,15,Algorithms,78.8%,1676,true,Hash Table;Tree;Depth-First Search;Binary Tree;,false,false,78.7695512920178,50663,64318
1821,"Product's Worth Over Invoices",products-worth-over-invoices,true,Easy,38,134,Database,38.3%,1677,true,Database;,false,false,38.306663031396155,18265,47681
1797,"Goal Parser Interpretation",goal-parser-interpretation,false,Easy,1603,90,Algorithms,87.5%,1678,false,String;,false,false,87.52022091347976,277005,316504
1798,"Max Number of K-Sum Pairs",max-number-of-k-sum-pairs,false,Medium,3270,98,Algorithms,55.6%,1679,false,Array;Hash Table;Two Pointers;Sorting;,true,false,55.58717768391672,405467,729430
1800,"Concatenation of Consecutive Binary Numbers",concatenation-of-consecutive-binary-numbers,false,Medium,1425,436,Algorithms,57.1%,1680,false,Math;Bit Manipulation;Simulation;,true,false,57.12925464494389,92398,161735
1799,"Minimum Incompatibility",minimum-incompatibility,false,Hard,278,98,Algorithms,39.5%,1681,false,Array;Dynamic Programming;Bit Manipulation;Bitmask;,false,false,39.52879581151832,9362,23684
1822,"Longest Palindromic Subsequence II",longest-palindromic-subsequence-ii,true,Medium,153,28,Algorithms,50.1%,1682,true,String;Dynamic Programming;,false,false,50.086685159500696,5778,11536
1827,"Invalid Tweets",invalid-tweets,false,Easy,1132,375,Database,85.7%,1683,false,Database;,true,false,85.65983752601598,829318,968152
1786,"Count the Number of Consistent Strings",count-the-number-of-consistent-strings,false,Easy,2143,86,Algorithms,88.1%,1684,false,Array;Hash Table;String;Bit Manipulation;Counting;,true,false,88.13971841132991,371915,421961
1787,"Sum of Absolute Differences in a Sorted Array",sum-of-absolute-differences-in-a-sorted-array,false,Medium,2090,76,Algorithms,68.3%,1685,false,Array;Math;Prefix Sum;,true,false,68.25320966676107,115680,169487
1788,"Stone Game VI",stone-game-vi,false,Medium,855,75,Algorithms,58.0%,1686,false,Array;Math;Greedy;Sorting;Heap (Priority Queue);Game Theory;,false,false,58.044624123637476,22685,39082
1789,"Delivering Boxes from Storage to Ports",delivering-boxes-from-storage-to-ports,false,Hard,387,32,Algorithms,39.0%,1687,false,Array;Dynamic Programming;Segment Tree;Queue;Heap (Priority Queue);Prefix Sum;Monotonic Queue;,false,false,38.95531112173867,7331,18819
1806,"Count of Matches in Tournament",count-of-matches-in-tournament,false,Easy,1782,240,Algorithms,85.8%,1688,false,Math;Simulation;,true,false,85.79492706108431,264305,308066
1807,"Partitioning Into Minimum Number Of Deci-Binary Numbers",partitioning-into-minimum-number-of-deci-binary-numbers,false,Medium,2449,1502,Algorithms,88.8%,1689,false,String;Greedy;,true,false,88.75258033735416,233461,263047
1808,"Stone Game VII",stone-game-vii,false,Medium,1016,173,Algorithms,58.2%,1690,false,Array;Math;Dynamic Programming;Game Theory;,true,false,58.218678815489746,38337,65850
1367,"Maximum Height by Stacking Cuboids ",maximum-height-by-stacking-cuboids,false,Hard,1192,33,Algorithms,59.0%,1691,false,Array;Dynamic Programming;Sorting;,false,false,59.02994927385171,33980,57564
1828,"Count Ways to Distribute Candies",count-ways-to-distribute-candies,true,Hard,74,9,Algorithms,62.8%,1692,true,Dynamic Programming;,false,false,62.82342260553791,2768,4406
1837,"Daily Leads and Partners",daily-leads-and-partners,false,Easy,574,33,Database,86.6%,1693,false,Database;,true,false,86.5901104787018,147114,169897
1812,"Reformat Phone Number",reformat-phone-number,false,Easy,371,204,Algorithms,66.6%,1694,false,String;,false,false,66.56934534497026,42637,64049
1813,"Maximum Erasure Value",maximum-erasure-value,false,Medium,2829,52,Algorithms,58.8%,1695,false,Array;Hash Table;Sliding Window;,true,false,58.84043515379999,139218,236604
1814,"Jump Game VI",jump-game-vi,false,Medium,3455,116,Algorithms,45.8%,1696,false,Array;Dynamic Programming;Queue;Heap (Priority Queue);Monotonic Queue;,true,false,45.77394495116244,113269,247453
1815,"Checking Existence of Edge Length Limited Paths",checking-existence-of-edge-length-limited-paths,false,Hard,1997,47,Algorithms,62.6%,1697,false,Array;Two Pointers;Union Find;Graph;Sorting;,true,false,62.613992423888135,53555,85532
1838,"Number of Distinct Substrings in a String",number-of-distinct-substrings-in-a-string,true,Medium,197,43,Algorithms,64.4%,1698,true,String;Trie;Rolling Hash;Suffix Array;Hash Function;,false,false,64.43127084105225,12173,18893
1842,"Number of Calls Between Two Persons",number-of-calls-between-two-persons,true,Medium,299,16,Database,81.1%,1699,true,Database;,false,false,81.0527790424824,46286,57106
1802,"Number of Students Unable to Eat Lunch",number-of-students-unable-to-eat-lunch,false,Easy,2470,255,Algorithms,78.4%,1700,false,Array;Stack;Queue;Simulation;,true,false,78.44609483391822,278744,355332
1803,"Average Waiting Time",average-waiting-time,false,Medium,1230,99,Algorithms,73.1%,1701,false,Array;Simulation;,true,false,73.08748416182398,203621,278599
1804,"Maximum Binary String After Change",maximum-binary-string-after-change,false,Medium,504,58,Algorithms,46.9%,1702,false,String;Greedy;,false,false,46.89740179700931,14458,30829
1805,"Minimum Adjacent Swaps for K Consecutive Ones",minimum-adjacent-swaps-for-k-consecutive-ones,false,Hard,724,27,Algorithms,42.3%,1703,false,Array;Greedy;Sliding Window;Prefix Sum;,false,false,42.28426574657607,12010,28403
1823,"Determine if String Halves Are Alike",determine-if-string-halves-are-alike,false,Easy,2273,124,Algorithms,78.6%,1704,false,String;Counting;,true,false,78.64842006193841,371031,471759
1824,"Maximum Number of Eaten Apples",maximum-number-of-eaten-apples,false,Medium,847,190,Algorithms,40.0%,1705,false,Array;Greedy;Heap (Priority Queue);,true,false,39.96334797307971,25296,63298
1324,"Where Will the Ball Fall",where-will-the-ball-fall,false,Medium,3118,180,Algorithms,71.9%,1706,false,Array;Matrix;Simulation;,true,false,71.94539043730785,143444,199379
1826,"Maximum XOR With an Element From Array",maximum-xor-with-an-element-from-array,false,Hard,1273,40,Algorithms,52.9%,1707,false,Array;Bit Manipulation;Trie;,false,false,52.91282853789523,29755,56234
1847,"Largest Subarray Length K",largest-subarray-length-k,true,Easy,106,112,Algorithms,64.7%,1708,true,Array;Greedy;,false,false,64.74132557656347,9348,14439
1852,"Biggest Window Between Visits",biggest-window-between-visits,true,Medium,214,15,Database,70.4%,1709,true,Database;,true,false,70.36108986363516,26676,37913
1829,"Maximum Units on a Truck",maximum-units-on-a-truck,false,Easy,3882,226,Algorithms,73.9%,1710,false,Array;Greedy;Sorting;,true,false,73.94190367364565,328724,444571
1830,"Count Good Meals",count-good-meals,false,Medium,1058,240,Algorithms,30.9%,1711,false,Array;Hash Table;,false,false,30.92119850937364,43230,139807
1831,"Ways to Split Array Into Three Subarrays",ways-to-split-array-into-three-subarrays,false,Medium,1443,106,Algorithms,33.2%,1712,false,Array;Two Pointers;Binary Search;Prefix Sum;,false,false,33.21946654188114,35495,106838
1832,"Minimum Operations to Make a Subsequence",minimum-operations-to-make-a-subsequence,false,Hard,735,13,Algorithms,47.8%,1713,false,Array;Hash Table;Binary Search;Greedy;,false,false,47.82981459650627,13389,27993
1809,"Sum Of Special Evenly-Spaced Elements In Array",sum-of-special-evenly-spaced-elements-in-array,true,Hard,33,24,Algorithms,49.0%,1714,true,Array;Dynamic Programming;,false,false,49.02088772845953,1501,3063
1862,"Count Apples and Oranges",count-apples-and-oranges,true,Medium,85,22,Database,75.7%,1715,true,Database;,false,false,75.73446455164944,16782,22159
1817,"Calculate Money in Leetcode Bank",calculate-money-in-leetcode-bank,false,Easy,1454,53,Algorithms,78.4%,1716,false,Math;,true,false,78.39667885478396,167881,214143
1818,"Maximum Score From Removing Substrings",maximum-score-from-removing-substrings,false,Medium,1418,120,Algorithms,62.8%,1717,false,String;Stack;Greedy;,true,false,62.842239543847064,138427,220277
1819,"Construct the Lexicographically Largest Valid Sequence",construct-the-lexicographically-largest-valid-sequence,false,Medium,580,57,Algorithms,54.6%,1718,false,Array;Backtracking;,false,false,54.61557426126158,15507,28393
1820,"Number Of Ways To Reconstruct A Tree",number-of-ways-to-reconstruct-a-tree,false,Hard,223,156,Algorithms,44.4%,1719,false,Tree;Graph;,false,false,44.364174427713465,5097,11489
1839,"Decode XORed Array",decode-xored-array,false,Easy,1617,216,Algorithms,86.7%,1720,false,Array;Bit Manipulation;,false,false,86.72289534155003,166057,191480
528,"Swapping Nodes in a Linked List",swapping-nodes-in-a-linked-list,false,Medium,5455,189,Algorithms,68.2%,1721,false,Linked List;Two Pointers;,true,false,68.1658645027405,373473,547890
1840,"Minimize Hamming Distance After Swap Operations",minimize-hamming-distance-after-swap-operations,false,Medium,855,27,Algorithms,49.0%,1722,false,Array;Depth-First Search;Union Find;,false,false,49.03007652607225,19285,39333
1825,"Find Minimum Time to Finish All Jobs",find-minimum-time-to-finish-all-jobs,false,Hard,1073,32,Algorithms,42.9%,1723,false,Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,false,false,42.88901514626609,30950,72163
1865,"Checking Existence of Edge Length Limited Paths II",checking-existence-of-edge-length-limited-paths-ii,true,Hard,111,10,Algorithms,51.0%,1724,true,Union Find;Graph;Minimum Spanning Tree;,false,false,51.02964118564742,3271,6410
1843,"Number Of Rectangles That Can Form The Largest Square",number-of-rectangles-that-can-form-the-largest-square,false,Easy,605,73,Algorithms,78.9%,1725,false,Array;,false,false,78.88649425287356,76867,97438
1364,"Tuple with Same Product",tuple-with-same-product,false,Medium,632,27,Algorithms,61.4%,1726,false,Array;Hash Table;Counting;,false,false,61.355504960156125,30182,49192
1845,"Largest Submatrix With Rearrangements",largest-submatrix-with-rearrangements,false,Medium,1935,103,Algorithms,75.3%,1727,false,Array;Greedy;Sorting;Matrix;,true,false,75.27321990031643,74455,98913
1727,"Cat and Mouse II",cat-and-mouse-ii,false,Hard,276,45,Algorithms,39.6%,1728,false,Array;Math;Dynamic Programming;Graph;Topological Sort;Memoization;Matrix;Game Theory;,false,false,39.55915885482645,7807,19735
1877,"Find Followers Count",find-followers-count,false,Easy,616,32,Database,69.4%,1729,false,Database;,true,false,69.36418177207835,281758,406201
550,"Shortest Path to Get Food",shortest-path-to-get-food,true,Medium,688,40,Algorithms,55.5%,1730,true,Array;Breadth-First Search;Matrix;,false,false,55.45340808311162,70027,126284
1882,"The Number of Employees Which Report to Each Employee",the-number-of-employees-which-report-to-each-employee,false,Easy,625,85,Database,51.0%,1731,false,Database;,true,false,50.98138444700573,210542,412975
1833,"Find the Highest Altitude",find-the-highest-altitude,false,Easy,2976,371,Algorithms,83.7%,1732,false,Array;Prefix Sum;,true,false,83.67330856507742,509663,609111
1834,"Minimum Number of People to Teach",minimum-number-of-people-to-teach,false,Medium,220,402,Algorithms,43.4%,1733,false,Array;Hash Table;Greedy;,false,false,43.39260167586348,10616,24465
1835,"Decode XORed Permutation",decode-xored-permutation,false,Medium,777,32,Algorithms,65.7%,1734,false,Array;Bit Manipulation;,false,false,65.7073227341302,16986,25851
1836,"Count Ways to Make Array With Product",count-ways-to-make-array-with-product,false,Hard,297,34,Algorithms,52.0%,1735,false,Array;Math;Dynamic Programming;Combinatorics;Number Theory;,false,false,51.97809824940233,6740,12967
1858,"Latest Time by Replacing Hidden Digits",latest-time-by-replacing-hidden-digits,false,Easy,381,184,Algorithms,43.1%,1736,false,String;Greedy;,false,false,43.06726495635399,40407,93823
1859,"Change Minimum Characters to Satisfy One of Three Conditions",change-minimum-characters-to-satisfy-one-of-three-conditions,false,Medium,325,346,Algorithms,37.0%,1737,false,Hash Table;String;Counting;Prefix Sum;,false,false,37.04952366357623,14506,39153
1860,"Find Kth Largest XOR Coordinate Value",find-kth-largest-xor-coordinate-value,false,Medium,514,81,Algorithms,62.5%,1738,false,Array;Divide and Conquer;Bit Manipulation;Sorting;Heap (Priority Queue);Matrix;Prefix Sum;Quickselect;,false,false,62.54814591042973,24846,39723
1861,"Building Boxes",building-boxes,false,Hard,308,46,Algorithms,51.7%,1739,false,Math;Binary Search;Greedy;,false,false,51.68617526099336,8169,15805
1883,"Find Distance in a Binary Tree",find-distance-in-a-binary-tree,true,Medium,466,19,Algorithms,73.7%,1740,true,Hash Table;Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,73.67527942440834,32563,44198
1892,"Find Total Time Spent by Each Employee",find-total-time-spent-by-each-employee,false,Easy,733,20,Database,86.9%,1741,false,Database;,true,false,86.92978184384901,158871,182757
1844,"Maximum Number of Balls in a Box",maximum-number-of-balls-in-a-box,false,Easy,619,163,Algorithms,73.7%,1742,false,Hash Table;Math;Counting;,false,false,73.73124297760182,70215,95231
1866,"Restore the Array From Adjacent Pairs",restore-the-array-from-adjacent-pairs,false,Medium,1978,69,Algorithms,74.8%,1743,false,Array;Hash Table;Depth-First Search;,true,false,74.75630858448525,111893,149677
1872,"Can You Eat Your Favorite Candy on Your Favorite Day?",can-you-eat-your-favorite-candy-on-your-favorite-day,false,Medium,136,334,Algorithms,34.7%,1744,false,Array;Prefix Sum;,false,false,34.74594075452445,11577,33319
1871,"Palindrome Partitioning IV",palindrome-partitioning-iv,false,Hard,925,29,Algorithms,44.5%,1745,false,String;Dynamic Programming;,false,false,44.5071335927367,27452,61680
1893,"Maximum Subarray Sum After One Operation",maximum-subarray-sum-after-one-operation,true,Medium,303,10,Algorithms,65.6%,1746,true,Array;Dynamic Programming;,true,false,65.58130039808104,12850,19594
1898,"Leetflex Banned Accounts",leetflex-banned-accounts,true,Medium,191,16,Database,62.7%,1747,true,Database;,true,false,62.66539695268645,25006,39904
1848,"Sum of Unique Elements",sum-of-unique-elements,false,Easy,1586,33,Algorithms,78.5%,1748,false,Array;Hash Table;Counting;,false,false,78.51525423728813,196876,250749
1849,"Maximum Absolute Sum of Any Subarray",maximum-absolute-sum-of-any-subarray,false,Medium,1295,21,Algorithms,60.6%,1749,false,Array;Dynamic Programming;,false,false,60.586152526901046,43805,72302
1850,"Minimum Length of String After Deleting Similar Ends",minimum-length-of-string-after-deleting-similar-ends,false,Medium,1247,107,Algorithms,55.9%,1750,false,Two Pointers;String;,true,false,55.89723335639958,171249,306364
1851,"Maximum Number of Events That Can Be Attended II",maximum-number-of-events-that-can-be-attended-ii,false,Hard,2109,41,Algorithms,61.1%,1751,false,Array;Binary Search;Dynamic Programming;Sorting;,true,false,61.145149582822754,78341,128123
1878,"Check if Array Is Sorted and Rotated",check-if-array-is-sorted-and-rotated,false,Easy,3480,211,Algorithms,52.0%,1752,false,Array;,false,false,52.028793258163944,373392,717666
1879,"Maximum Score From Removing Stones",maximum-score-from-removing-stones,false,Medium,954,57,Algorithms,67.6%,1753,false,Math;Greedy;Heap (Priority Queue);,false,false,67.58865037067913,45402,67174
1880,"Largest Merge Of Two Strings",largest-merge-of-two-strings,false,Medium,566,81,Algorithms,49.9%,1754,false,Two Pointers;String;Greedy;,false,false,49.940923123832754,26206,52474
1881,"Closest Subsequence Sum",closest-subsequence-sum,false,Hard,931,69,Algorithms,40.6%,1755,false,Array;Two Pointers;Dynamic Programming;Bit Manipulation;Bitmask;,false,false,40.62078272604588,20769,51129
1903,"Design Most Recently Used Queue",design-most-recently-used-queue,true,Medium,292,25,Algorithms,75.9%,1756,true,Array;Hash Table;Stack;Design;Binary Indexed Tree;Ordered Set;,false,false,75.9195565087201,18762,24713
1908,"Recyclable and Low Fat Products",recyclable-and-low-fat-products,false,Easy,2622,117,Database,89.4%,1757,false,Database;,true,false,89.38167036881333,1528661,1710259
1884,"Minimum Changes To Make Alternating Binary String",minimum-changes-to-make-alternating-binary-string,false,Easy,1451,42,Algorithms,63.7%,1758,false,String;,true,false,63.715777799847714,153973,241656
1885,"Count Number of Homogenous Substrings",count-number-of-homogenous-substrings,false,Medium,1500,100,Algorithms,57.6%,1759,false,Math;String;,true,false,57.55629716187043,116243,201964
1886,"Minimum Limit of Balls in a Bag",minimum-limit-of-balls-in-a-bag,false,Medium,2725,99,Algorithms,68.0%,1760,false,Array;Binary Search;,true,false,67.98465504292935,133975,197067
1887,"Minimum Degree of a Connected Trio in a Graph",minimum-degree-of-a-connected-trio-in-a-graph,false,Hard,331,286,Algorithms,43.1%,1761,false,Graph;,false,false,43.14670663782385,25330,58708
1909,"Buildings With an Ocean View",buildings-with-an-ocean-view,true,Medium,1258,147,Algorithms,80.3%,1762,true,Array;Stack;Monotonic Stack;,true,false,80.34469756862936,264228,328868
1873,"Longest Nice Substring",longest-nice-substring,false,Easy,1376,904,Algorithms,61.3%,1763,false,Hash Table;String;Divide and Conquer;Bit Manipulation;Sliding Window;,false,false,61.32227207313976,65195,106316
1874,"Form Array by Concatenating Subarrays of Another Array",form-array-by-concatenating-subarrays-of-another-array,false,Medium,337,44,Algorithms,54.1%,1764,false,Array;Two Pointers;Greedy;String Matching;,false,false,54.08053945046635,17163,31736
1876,"Map of Highest Peak",map-of-highest-peak,false,Medium,842,50,Algorithms,63.3%,1765,false,Array;Breadth-First Search;Matrix;,false,false,63.283619292925096,30466,48142
1875,"Tree of Coprimes",tree-of-coprimes,false,Hard,408,35,Algorithms,41.5%,1766,false,Array;Math;Tree;Depth-First Search;Number Theory;,false,false,41.47699111670289,10879,26229
1914,"Find the Subtasks That Did Not Execute",find-the-subtasks-that-did-not-execute,true,Hard,178,13,Database,78.0%,1767,true,Database;,false,false,77.9523516122407,15182,19476
1894,"Merge Strings Alternately",merge-strings-alternately,false,Easy,4201,114,Algorithms,81.4%,1768,false,Two Pointers;String;,true,true,81.4052659638074,1307064,1605627
1895,"Minimum Number of Operations to Move All Balls to Each Box",minimum-number-of-operations-to-move-all-balls-to-each-box,false,Medium,2281,95,Algorithms,86.0%,1769,false,Array;String;Prefix Sum;,true,false,86.0436755886901,136880,159082
1896,"Maximum Score from Performing Multiplication Operations",maximum-score-from-performing-multiplication-operations,false,Hard,2543,514,Algorithms,41.4%,1770,false,Array;Dynamic Programming;,true,false,41.44610272758986,119996,289523
1897,"Maximize Palindrome Length From Subsequences",maximize-palindrome-length-from-subsequences,false,Hard,546,17,Algorithms,36.9%,1771,false,String;Dynamic Programming;,false,false,36.87411979744105,12306,33373
1919,"Sort Features by Popularity",sort-features-by-popularity,true,Medium,91,42,Algorithms,65.8%,1772,true,Array;Hash Table;String;Sorting;,false,false,65.79317269076306,6553,9960
1899,"Count Items Matching a Rule",count-items-matching-a-rule,false,Easy,1925,245,Algorithms,84.7%,1773,false,Array;String;,false,false,84.73695076213743,246270,290629
1900,"Closest Dessert Cost",closest-dessert-cost,false,Medium,718,90,Algorithms,48.0%,1774,false,Array;Dynamic Programming;Backtracking;,false,false,47.95147233401859,33121,69073
1901,"Equal Sum Arrays With Minimum Number of Operations",equal-sum-arrays-with-minimum-number-of-operations,false,Medium,938,45,Algorithms,53.8%,1775,false,Array;Hash Table;Greedy;Counting;,false,false,53.845628065139,31511,58521
1902,"Car Fleet II",car-fleet-ii,false,Hard,912,38,Algorithms,55.9%,1776,false,Array;Math;Stack;Heap (Priority Queue);Monotonic Stack;,false,false,55.938330038144315,28010,50073
1926,"Product's Price for Each Store",products-price-for-each-store,true,Easy,137,13,Database,82.3%,1777,true,Database;,true,false,82.3079506025445,22061,26803
1931,"Shortest Path in a Hidden Grid",shortest-path-in-a-hidden-grid,true,Medium,177,79,Algorithms,42.8%,1778,true,Depth-First Search;Breadth-First Search;Graph;Interactive;,false,false,42.804701563658185,12127,28331
1888,"Find Nearest Point That Has the Same X or Y Coordinate",find-nearest-point-that-has-the-same-x-or-y-coordinate,false,Easy,855,188,Algorithms,69.1%,1779,false,Array;,false,false,69.06918317463379,121789,176329
1889,"Check if Number is a Sum of Powers of Three",check-if-number-is-a-sum-of-powers-of-three,false,Medium,992,33,Algorithms,68.3%,1780,false,Math;,false,false,68.2952688077042,46380,67911
1890,"Sum of Beauty of All Substrings",sum-of-beauty-of-all-substrings,false,Medium,1219,188,Algorithms,68.8%,1781,false,Hash Table;String;Counting;,false,false,68.8320938167724,83112,120744
1891,"Count Pairs Of Nodes",count-pairs-of-nodes,false,Hard,321,168,Algorithms,40.5%,1782,false,Array;Two Pointers;Binary Search;Graph;Sorting;,false,false,40.4972788389713,7590,18742
1932,"Grand Slam Titles",grand-slam-titles,true,Medium,237,9,Database,83.2%,1783,true,Database;,false,false,83.20796136396898,28428,34165
1910,"Check if Binary String Has at Most One Segment of Ones",check-if-binary-string-has-at-most-one-segment-of-ones,false,Easy,351,982,Algorithms,39.2%,1784,false,String;,false,false,39.18222871247053,49369,126000
1911,"Minimum Elements to Add to Form a Given Sum",minimum-elements-to-add-to-form-a-given-sum,false,Medium,272,195,Algorithms,44.1%,1785,false,Array;Greedy;,false,false,44.05284697176387,23574,53513
1912,"Number of Restricted Paths From First to Last Node",number-of-restricted-paths-from-first-to-last-node,false,Medium,1124,216,Algorithms,39.6%,1786,false,Dynamic Programming;Graph;Topological Sort;Heap (Priority Queue);Shortest Path;,false,false,39.55363216627347,27327,69090
1913,"Make the XOR of All Segments Equal to Zero",make-the-xor-of-all-segments-equal-to-zero,false,Hard,406,25,Algorithms,39.7%,1787,false,Array;Dynamic Programming;Bit Manipulation;,false,false,39.6664844177146,5804,14632
1937,"Maximize the Beauty of the Garden",maximize-the-beauty-of-the-garden,true,Hard,79,6,Algorithms,65.0%,1788,true,Array;Hash Table;Greedy;Prefix Sum;,false,false,64.97991967871486,2427,3735
1942,"Primary Department for Each Employee",primary-department-for-each-employee,false,Easy,593,233,Database,68.8%,1789,false,Database;,true,false,68.77722027456034,191079,277824
1915,"Check if One String Swap Can Make Strings Equal",check-if-one-string-swap-can-make-strings-equal,false,Easy,1120,61,Algorithms,46.0%,1790,false,Hash Table;String;Counting;,false,false,46.036126920075375,120930,262685
1916,"Find Center of Star Graph",find-center-of-star-graph,false,Easy,1834,178,Algorithms,86.6%,1791,false,Graph;,true,false,86.61194667172748,365103,421539
1917,"Maximum Average Pass Ratio",maximum-average-pass-ratio,false,Medium,1352,115,Algorithms,71.7%,1792,false,Array;Greedy;Heap (Priority Queue);,true,false,71.68544345325348,102698,143262
1918,"Maximum Score of a Good Subarray",maximum-score-of-a-good-subarray,false,Hard,1902,49,Algorithms,64.3%,1793,false,Array;Two Pointers;Binary Search;Stack;Monotonic Stack;,true,false,64.32014722407699,78989,122806
1943,"Count Pairs of Equal Substrings With Minimum Difference",count-pairs-of-equal-substrings-with-minimum-difference,true,Medium,44,61,Algorithms,64.9%,1794,true,Hash Table;String;Greedy;,false,false,64.90066225165563,2156,3322
1948,"Rearrange Products Table",rearrange-products-table,false,Easy,882,57,Database,85.5%,1795,false,Database;,true,false,85.50765285679942,149385,174704
1904,"Second Largest Digit in a String",second-largest-digit-in-a-string,false,Easy,544,130,Algorithms,51.2%,1796,false,Hash Table;String;,false,false,51.158680282796546,67730,132392
1905,"Design Authentication Manager",design-authentication-manager,false,Medium,383,50,Algorithms,58.0%,1797,false,Hash Table;Linked List;Design;Doubly-Linked List;,false,false,58.036986709972496,35023,60346
1930,"Maximum Number of Consecutive Values You Can Make",maximum-number-of-consecutive-values-you-can-make,false,Medium,828,60,Algorithms,61.4%,1798,false,Array;Greedy;Sorting;,false,false,61.41074053789167,21304,34691
1906,"Maximize Score After N Operations",maximize-score-after-n-operations,false,Hard,1651,113,Algorithms,57.8%,1799,false,Array;Math;Dynamic Programming;Backtracking;Bit Manipulation;Number Theory;Bitmask;,true,false,57.80874188473154,63933,110594
1927,"Maximum Ascending Subarray Sum",maximum-ascending-subarray-sum,false,Easy,742,26,Algorithms,62.0%,1800,false,Array;,false,false,61.97693574958814,63953,103189
1928,"Number of Orders in the Backlog",number-of-orders-in-the-backlog,false,Medium,306,240,Algorithms,51.0%,1801,false,Array;Heap (Priority Queue);Simulation;,false,false,50.97750900882243,24615,48286
1929,"Maximum Value at a Given Index in a Bounded Array",maximum-value-at-a-given-index-in-a-bounded-array,false,Medium,2589,464,Algorithms,39.0%,1802,false,Binary Search;Greedy;,true,false,38.98280788128639,78862,202300
1907,"Count Pairs With XOR in a Range",count-pairs-with-xor-in-a-range,false,Hard,535,23,Algorithms,48.2%,1803,false,Array;Bit Manipulation;Trie;,false,false,48.17876883828601,10198,21167
1949,"Implement Trie II (Prefix Tree)",implement-trie-ii-prefix-tree,true,Medium,341,18,Algorithms,63.0%,1804,true,Hash Table;String;Design;Trie;,true,false,63.030068324527676,22786,36151
1933,"Number of Different Integers in a String",number-of-different-integers-in-a-string,false,Easy,631,103,Algorithms,38.7%,1805,false,Hash Table;String;,false,false,38.71448526129343,53769,138886
1935,"Minimum Number of Operations to Reinitialize a Permutation",minimum-number-of-operations-to-reinitialize-a-permutation,false,Medium,321,174,Algorithms,73.0%,1806,false,Array;Math;Simulation;,false,false,73.04110180157502,20312,27809
1934,"Evaluate the Bracket Pairs of a String",evaluate-the-bracket-pairs-of-a-string,false,Medium,488,42,Algorithms,67.4%,1807,false,Array;Hash Table;String;,false,false,67.39364184130977,33218,49290
1936,"Maximize Number of Nice Divisors",maximize-number-of-nice-divisors,false,Hard,228,169,Algorithms,34.0%,1808,false,Math;Recursion;Number Theory;,false,false,33.96349413298566,7815,23010
1958,"Ad-Free Sessions",ad-free-sessions,true,Easy,92,61,Database,58.6%,1809,true,Database;,false,false,58.57656116338751,17119,29225
1959,"Minimum Path Cost in a Hidden Grid",minimum-path-cost-in-a-hidden-grid,true,Medium,88,30,Algorithms,58.2%,1810,true,Depth-First Search;Breadth-First Search;Graph;Heap (Priority Queue);Interactive;,false,false,58.21193944587261,4076,7002
1964,"Find Interview Candidates",find-interview-candidates,true,Medium,201,27,Database,60.8%,1811,true,Database;,false,false,60.80968431734986,16778,27591
1920,"Determine Color of a Chessboard Square",determine-color-of-a-chessboard-square,false,Easy,839,22,Algorithms,79.0%,1812,false,Math;String;,false,false,79.01809384941676,95378,120704
1923,"Sentence Similarity III",sentence-similarity-iii,false,Medium,1005,157,Algorithms,48.8%,1813,false,Array;Two Pointers;String;,true,false,48.765770059436825,123808,253883
1925,"Count Nice Pairs in an Array",count-nice-pairs-in-an-array,false,Medium,1867,86,Algorithms,48.5%,1814,false,Array;Hash Table;Math;Counting;,true,false,48.530987997949524,114554,236043
1924,"Maximum Number of Groups Getting Fresh Donuts",maximum-number-of-groups-getting-fresh-donuts,false,Hard,345,31,Algorithms,40.0%,1815,false,Array;Dynamic Programming;Bit Manipulation;Memoization;Bitmask;,false,false,39.97208263539922,7159,17910
1944,"Truncate Sentence",truncate-sentence,false,Easy,1155,33,Algorithms,85.8%,1816,false,Array;String;,false,false,85.79959712640604,192523,224387
1945,"Finding the Users Active Minutes",finding-the-users-active-minutes,false,Medium,833,310,Algorithms,80.5%,1817,false,Array;Hash Table;,false,false,80.46273159237153,62147,77237
1946,"Minimum Absolute Sum Difference",minimum-absolute-sum-difference,false,Medium,1047,78,Algorithms,31.0%,1818,false,Array;Binary Search;Sorting;Ordered Set;,false,false,31.03895070638646,27309,87983
1947,"Number of Different Subsequences GCDs",number-of-different-subsequences-gcds,false,Hard,420,45,Algorithms,41.4%,1819,false,Array;Math;Counting;Number Theory;,false,false,41.411900065746224,10078,24336
1969,"Maximum Number of Accepted Invitations",maximum-number-of-accepted-invitations,true,Medium,225,67,Algorithms,51.4%,1820,true,Array;Depth-First Search;Graph;Matrix;,false,false,51.419726729291206,9634,18736
1974,"Find Customers With Positive Revenue this Year",find-customers-with-positive-revenue-this-year,true,Easy,61,25,Database,87.7%,1821,true,Database;,false,false,87.70887035633055,28920,32973
1950,"Sign of the Product of an Array",sign-of-the-product-of-an-array,false,Easy,2200,222,Algorithms,65.3%,1822,false,Array;Math;,true,false,65.29792123122962,366575,561389
1951,"Find the Winner of the Circular Game",find-the-winner-of-the-circular-game,false,Medium,3860,114,Algorithms,81.9%,1823,false,Array;Math;Recursion;Queue;Simulation;,true,false,81.92123994618584,309940,378339
1952,"Minimum Sideway Jumps",minimum-sideway-jumps,false,Medium,1214,49,Algorithms,50.4%,1824,false,Array;Dynamic Programming;Greedy;,false,false,50.422398206790085,47689,94579
1953,"Finding MK Average",finding-mk-average,false,Hard,482,135,Algorithms,37.7%,1825,false,Design;Queue;Heap (Priority Queue);Data Stream;Ordered Set;,false,false,37.67983822846914,22733,60332
1980,"Faulty Sensor",faulty-sensor,true,Easy,69,81,Algorithms,50.1%,1826,true,Array;Two Pointers;,false,false,50.089285714285715,6171,12320
1938,"Minimum Operations to Make the Array Increasing",minimum-operations-to-make-the-array-increasing,false,Easy,1252,65,Algorithms,80.5%,1827,false,Array;Greedy;,false,false,80.51981835343783,108337,134547
1939,"Queries on Number of Points Inside a Circle",queries-on-number-of-points-inside-a-circle,false,Medium,1155,85,Algorithms,86.3%,1828,false,Array;Math;Geometry;,false,false,86.34113364534582,83017,96150
1940,"Maximum XOR for Each Query",maximum-xor-for-each-query,false,Medium,1235,190,Algorithms,85.2%,1829,false,Array;Bit Manipulation;Prefix Sum;,true,false,85.20307837286006,135621,159174
1941,"Minimum Number of Operations to Make String Sorted",minimum-number-of-operations-to-make-string-sorted,false,Hard,180,129,Algorithms,50.2%,1830,false,Math;String;Combinatorics;,false,false,50.19907100199072,4539,9042
1981,"Maximum Transaction Each Day",maximum-transaction-each-day,true,Medium,88,3,Database,82.0%,1831,true,Database;,false,false,82.0386746413239,22358,27253
1960,"Check if the Sentence Is Pangram",check-if-the-sentence-is-pangram,false,Easy,2820,59,Algorithms,83.6%,1832,false,Hash Table;String;,true,false,83.60267833605737,396423,474175
1961,"Maximum Ice Cream Bars",maximum-ice-cream-bars,false,Medium,2198,675,Algorithms,73.8%,1833,false,Array;Greedy;Sorting;Counting Sort;,true,false,73.83664186190298,167190,226433
1962,"Single-Threaded CPU",single-threaded-cpu,false,Medium,3234,273,Algorithms,46.0%,1834,false,Array;Sorting;Heap (Priority Queue);,true,false,45.99626695167948,118777,258232
1963,"Find XOR Sum of All Pairs Bitwise AND",find-xor-sum-of-all-pairs-bitwise-and,false,Hard,614,50,Algorithms,61.4%,1835,false,Array;Math;Bit Manipulation;,false,false,61.35737188501997,21815,35554
1982,"Remove Duplicates From an Unsorted Linked List",remove-duplicates-from-an-unsorted-linked-list,true,Medium,399,12,Algorithms,75.0%,1836,true,Hash Table;Linked List;,true,false,74.99489816742174,36749,49002
1965,"Sum of Digits in Base K",sum-of-digits-in-base-k,false,Easy,519,48,Algorithms,77.7%,1837,false,Math;,false,false,77.67481573561356,61861,79641
1966,"Frequency of the Most Frequent Element",frequency-of-the-most-frequent-element,false,Medium,4878,237,Algorithms,44.0%,1838,false,Array;Binary Search;Greedy;Sliding Window;Sorting;Prefix Sum;,true,false,44.017470916803155,178170,404770
1967,"Longest Substring Of All Vowels in Order",longest-substring-of-all-vowels-in-order,false,Medium,772,26,Algorithms,49.8%,1839,false,String;Sliding Window;,false,false,49.795175238962216,35008,70304
1968,"Maximum Building Height",maximum-building-height,false,Hard,380,21,Algorithms,36.9%,1840,false,Array;Math;Sorting;,false,false,36.88585149612117,7988,21656
1991,"League Statistics",league-statistics,true,Medium,108,97,Database,53.4%,1841,true,Database;,true,false,53.40108599941298,14555,27256
1997,"Next Palindrome Using Same Digits",next-palindrome-using-same-digits,true,Hard,123,18,Algorithms,53.6%,1842,true,Two Pointers;String;,false,false,53.56132909155179,6061,11316
1998,"Suspicious Bank Accounts",suspicious-bank-accounts,true,Medium,98,58,Database,45.0%,1843,true,Database;,true,false,45.04623513870541,12617,28009
1954,"Replace All Digits with Characters",replace-all-digits-with-characters,false,Easy,852,111,Algorithms,81.8%,1844,false,String;,false,false,81.79613291417368,96790,118331
1955,"Seat Reservation Manager",seat-reservation-manager,false,Medium,1432,89,Algorithms,69.9%,1845,false,Design;Heap (Priority Queue);,true,false,69.85609041218875,132275,189354
1956,"Maximum Element After Decreasing and Rearranging",maximum-element-after-decreasing-and-rearranging,false,Medium,1094,274,Algorithms,65.8%,1846,false,Array;Greedy;Sorting;,true,false,65.79146572248337,107773,163810
1957,"Closest Room",closest-room,false,Hard,525,21,Algorithms,39.4%,1847,false,Array;Binary Search;Sorting;Ordered Set;,false,false,39.39244725578577,10400,26401
1975,"Minimum Distance to the Target Element",minimum-distance-to-the-target-element,false,Easy,370,68,Algorithms,54.4%,1848,false,Array;,false,false,54.3555507698934,50480,92870
1976,"Splitting a String Into Descending Consecutive Values",splitting-a-string-into-descending-consecutive-values,false,Medium,537,123,Algorithms,36.7%,1849,false,String;Backtracking;,false,false,36.67640091744269,29263,79787
1978,"Minimum Adjacent Swaps to Reach the Kth Smallest Number",minimum-adjacent-swaps-to-reach-the-kth-smallest-number,false,Medium,786,111,Algorithms,71.5%,1850,false,Two Pointers;String;Greedy;,false,false,71.49631509000845,23671,33108
1977,"Minimum Interval to Include Each Query",minimum-interval-to-include-each-query,false,Hard,1022,39,Algorithms,51.3%,1851,false,Array;Binary Search;Line Sweep;Sorting;Heap (Priority Queue);,false,false,51.27816118177152,44953,87664
2003,"Distinct Numbers in Each Subarray",distinct-numbers-in-each-subarray,true,Medium,136,9,Algorithms,71.9%,1852,true,Array;Hash Table;Sliding Window;,false,false,71.88618468146028,8034,11176
2004,"Convert Date Format",convert-date-format,true,Easy,66,42,Database,85.6%,1853,true,Database;,false,false,85.64910573062417,14079,16438
1983,"Maximum Population Year",maximum-population-year,false,Easy,1382,253,Algorithms,61.9%,1854,false,Array;Counting;Prefix Sum;,false,false,61.856863684967365,83874,135597
1984,"Maximum Distance Between a Pair of Values",maximum-distance-between-a-pair-of-values,false,Medium,1216,28,Algorithms,53.5%,1855,false,Array;Two Pointers;Binary Search;,true,false,53.53152034604294,53462,99871
1985,"Maximum Subarray Min-Product",maximum-subarray-min-product,false,Medium,1476,135,Algorithms,38.5%,1856,false,Array;Stack;Monotonic Stack;Prefix Sum;,false,false,38.52512374565508,31366,81417
1986,"Largest Color Value in a Directed Graph",largest-color-value-in-a-directed-graph,false,Hard,2159,71,Algorithms,49.6%,1857,false,Hash Table;Dynamic Programming;Graph;Topological Sort;Memoization;Counting;,true,false,49.64793700965175,70369,141736
2009,"Longest Word With All Prefixes",longest-word-with-all-prefixes,true,Medium,199,7,Algorithms,71.3%,1858,true,Depth-First Search;Trie;,true,false,71.25288239815526,12978,18214
1970,"Sorting the Sentence",sorting-the-sentence,false,Easy,2258,79,Algorithms,83.5%,1859,false,String;Sorting;,false,false,83.49931955956946,188979,226324
1971,"Incremental Memory Leak",incremental-memory-leak,false,Medium,225,87,Algorithms,72.3%,1860,false,Math;Simulation;,false,false,72.34848484848484,22347,30888
1972,"Rotating the Box",rotating-the-box,false,Medium,1522,75,Algorithms,79.2%,1861,false,Array;Two Pointers;Matrix;,true,false,79.20288295447648,143518,181203
1326,"Sum of Floored Pairs",sum-of-floored-pairs,false,Hard,450,37,Algorithms,29.3%,1862,false,Array;Math;Binary Search;Prefix Sum;,false,false,29.261903391099086,10165,34738
1993,"Sum of All Subset XOR Totals",sum-of-all-subset-xor-totals,false,Easy,2195,258,Algorithms,87.8%,1863,false,Array;Math;Backtracking;Bit Manipulation;Combinatorics;Enumeration;,true,false,87.78444305710124,194040,221042
1994,"Minimum Number of Swaps to Make the Binary String Alternating",minimum-number-of-swaps-to-make-the-binary-string-alternating,false,Medium,593,36,Algorithms,43.6%,1864,false,String;Greedy;,false,false,43.600017742817855,29488,67633
1995,"Finding Pairs With a Certain Sum",finding-pairs-with-a-certain-sum,false,Medium,633,111,Algorithms,51.5%,1865,false,Array;Hash Table;Design;,false,false,51.46570066998435,29267,56865
1996,"Number of Ways to Rearrange Sticks With K Sticks Visible",number-of-ways-to-rearrange-sticks-with-k-sticks-visible,false,Hard,718,23,Algorithms,58.2%,1866,false,Math;Dynamic Programming;Combinatorics;,false,false,58.24191633996332,16193,27803
2014,"Orders With Maximum Quantity Above Average",orders-with-maximum-quantity-above-average,true,Medium,73,270,Database,70.9%,1867,true,Database;,false,false,70.94017094017094,17347,24453
2019,"Product of Two Run-Length Encoded Arrays",product-of-two-run-length-encoded-arrays,true,Medium,389,73,Algorithms,59.1%,1868,true,Array;Two Pointers;,false,false,59.13728317385415,54139,91548
1999,"Longer Contiguous Segments of Ones than Zeros",longer-contiguous-segments-of-ones-than-zeros,false,Easy,533,13,Algorithms,61.5%,1869,false,String;,false,false,61.4510438619983,52775,85882
2000,"Minimum Speed to Arrive on Time",minimum-speed-to-arrive-on-time,false,Medium,2345,283,Algorithms,47.0%,1870,false,Array;Binary Search;,true,false,46.98598835202573,107542,228881
2001,"Jump Game VII",jump-game-vii,false,Medium,1724,111,Algorithms,25.2%,1871,false,String;Dynamic Programming;Sliding Window;Prefix Sum;,false,false,25.24833124288165,52539,208089
2002,"Stone Game VIII",stone-game-viii,false,Hard,455,25,Algorithms,53.3%,1872,false,Array;Math;Dynamic Programming;Prefix Sum;Game Theory;,false,false,53.279424977538184,10674,20034
2024,"Calculate Special Bonus",calculate-special-bonus,false,Easy,1098,78,Database,57.5%,1873,false,Database;,true,false,57.506622858322444,267438,465056
2029,"Minimize Product Sum of Two Arrays",minimize-product-sum-of-two-arrays,true,Medium,247,27,Algorithms,89.5%,1874,true,Array;Greedy;Sorting;,true,false,89.49635948472707,20773,23211
2030,"Group Employees of the Same Salary",group-employees-of-the-same-salary,true,Medium,75,6,Database,66.9%,1875,true,Database;,false,false,66.92292027288464,13145,19642
1987,"Substrings of Size Three with Distinct Characters",substrings-of-size-three-with-distinct-characters,false,Easy,1552,47,Algorithms,74.7%,1876,false,Hash Table;String;Sliding Window;Counting;,false,false,74.68108693542042,146181,195740
1988,"Minimize Maximum Pair Sum in Array",minimize-maximum-pair-sum-in-array,false,Medium,1983,452,Algorithms,81.5%,1877,false,Array;Two Pointers;Greedy;Sorting;,true,false,81.4643684568084,187064,229627
1990,"Get Biggest Three Rhombus Sums in a Grid",get-biggest-three-rhombus-sums-in-a-grid,false,Medium,221,526,Algorithms,48.7%,1878,false,Array;Math;Sorting;Heap (Priority Queue);Matrix;Prefix Sum;,false,false,48.74996516067895,17490,35878
1989,"Minimum XOR Sum of Two Arrays",minimum-xor-sum-of-two-arrays,false,Hard,688,13,Algorithms,48.5%,1879,false,Array;Dynamic Programming;Bit Manipulation;Bitmask;,false,false,48.49451045269965,16122,33245
2010,"Check if Word Equals Summation of Two Words",check-if-word-equals-summation-of-two-words,false,Easy,585,40,Algorithms,74.6%,1880,false,String;,false,false,74.5720769286059,72625,97389
2011,"Maximum Value after Insertion",maximum-value-after-insertion,false,Medium,390,64,Algorithms,38.3%,1881,false,String;Greedy;,false,false,38.32729878072184,29957,78161
2012,"Process Tasks Using Servers",process-tasks-using-servers,false,Medium,961,276,Algorithms,40.7%,1882,false,Array;Heap (Priority Queue);,false,false,40.72163272384379,37571,92263
2013,"Minimum Skips to Arrive at Meeting On Time",minimum-skips-to-arrive-at-meeting-on-time,false,Hard,339,52,Algorithms,38.1%,1883,false,Array;Dynamic Programming;,false,false,38.05672109600121,7528,19781
2031,"Egg Drop With 2 Eggs and N Floors",egg-drop-with-2-eggs-and-n-floors,false,Medium,1479,152,Algorithms,73.4%,1884,false,Math;Dynamic Programming;,false,false,73.3561446180484,53380,72769
2036,"Count Pairs in Two Arrays",count-pairs-in-two-arrays,true,Medium,238,22,Algorithms,60.4%,1885,true,Array;Two Pointers;Binary Search;Sorting;,true,false,60.44087305896406,11132,18418
2015,"Determine Whether Matrix Can Be Obtained By Rotation",determine-whether-matrix-can-be-obtained-by-rotation,false,Easy,1473,130,Algorithms,57.7%,1886,false,Array;Matrix;,false,false,57.69276279785236,78009,135215
2016,"Reduction Operations to Make the Array Elements Equal",reduction-operations-to-make-the-array-elements-equal,false,Medium,1232,49,Algorithms,72.7%,1887,false,Array;Sorting;,true,false,72.6768885564697,97169,133700
2017,"Minimum Number of Flips to Make the Binary String Alternating",minimum-number-of-flips-to-make-the-binary-string-alternating,false,Medium,1241,78,Algorithms,40.3%,1888,false,String;Dynamic Programming;Greedy;Sliding Window;,false,false,40.327429367134734,30988,76841
2018,"Minimum Space Wasted From Packaging",minimum-space-wasted-from-packaging,false,Hard,410,38,Algorithms,32.1%,1889,false,Array;Binary Search;Sorting;Prefix Sum;,false,false,32.059965682290255,14200,44292
2041,"The Latest Login in 2020",the-latest-login-in-2020,false,Easy,419,14,Database,77.4%,1890,false,Database;,true,false,77.37542509600163,102157,132028
2045,"Cutting Ribbons",cutting-ribbons,true,Medium,602,53,Algorithms,51.3%,1891,true,Array;Binary Search;,true,false,51.297029214022174,72712,141747
2046,"Page Recommendations II",page-recommendations-ii,true,Hard,89,22,Database,44.3%,1892,true,Database;,false,false,44.27681735208848,8247,18626
2005,"Check if All the Integers in a Range Are Covered",check-if-all-the-integers-in-a-range-are-covered,false,Easy,621,116,Algorithms,50.1%,1893,false,Array;Hash Table;Prefix Sum;,false,false,50.11027357649065,51120,102013
2006,"Find the Student that Will Replace the Chalk",find-the-student-that-will-replace-the-chalk,false,Medium,1182,132,Algorithms,53.2%,1894,false,Array;Binary Search;Simulation;Prefix Sum;,true,false,53.185941259335756,195194,367002
1311,"Largest Magic Square",largest-magic-square,false,Medium,314,261,Algorithms,53.0%,1895,false,Array;Matrix;Prefix Sum;,false,false,52.95451733949116,12842,24251
2008,"Minimum Cost to Change the Final Value of Expression",minimum-cost-to-change-the-final-value-of-expression,false,Hard,239,41,Algorithms,53.4%,1896,false,Math;String;Dynamic Programming;Stack;,false,false,53.39144972534034,4471,8374
2025,"Redistribute Characters to Make All Strings Equal",redistribute-characters-to-make-all-strings-equal,false,Easy,1125,82,Algorithms,67.0%,1897,false,Hash Table;String;Counting;,true,false,67.00125872525462,146381,218475
2027,"Maximum Number of Removable Characters",maximum-number-of-removable-characters,false,Medium,1002,134,Algorithms,44.8%,1898,false,Array;Two Pointers;String;Binary Search;,false,false,44.84243110018598,34478,76887
2026,"Merge Triplets to Form Target Triplet",merge-triplets-to-form-target-triplet,false,Medium,834,69,Algorithms,66.8%,1899,false,Array;Greedy;,false,false,66.80410063954139,77609,116173
2028,"The Earliest and Latest Rounds Where Players Compete",the-earliest-and-latest-rounds-where-players-compete,false,Hard,229,21,Algorithms,49.9%,1900,false,Dynamic Programming;Memoization;,false,false,49.89814971991173,5879,11782
2047,"Find a Peak Element II",find-a-peak-element-ii,false,Medium,2214,141,Algorithms,52.5%,1901,false,Array;Binary Search;Matrix;,false,false,52.5408192802084,98008,186537
2052,"Depth of BST Given Insertion Order",depth-of-bst-given-insertion-order,true,Medium,103,11,Algorithms,42.7%,1902,true,Array;Tree;Binary Search Tree;Binary Tree;Ordered Set;,false,false,42.738659444820584,2525,5908
2032,"Largest Odd Number in String",largest-odd-number-in-string,false,Easy,2186,135,Algorithms,64.1%,1903,false,Math;String;Greedy;,true,false,64.13939345442905,336650,524872
2033,"The Number of Full Rounds You Have Played",the-number-of-full-rounds-you-have-played,false,Medium,219,263,Algorithms,43.8%,1904,false,Math;String;,false,false,43.804596408353014,23367,53345
2035,"Count Sub Islands",count-sub-islands,false,Medium,2540,89,Algorithms,72.8%,1905,false,Array;Depth-First Search;Breadth-First Search;Union Find;Matrix;,true,false,72.81533039517927,197931,271826
2034,"Minimum Absolute Difference Queries",minimum-absolute-difference-queries,false,Medium,539,43,Algorithms,44.6%,1906,false,Array;Hash Table;,false,false,44.60855618962366,11960,26811
2057,"Count Salary Categories",count-salary-categories,false,Medium,513,91,Database,62.4%,1907,false,Database;,true,false,62.356049052258086,160275,257032
2062,"Game of Nim",game-of-nim,true,Medium,102,39,Algorithms,62.9%,1908,true,Array;Math;Dynamic Programming;Bit Manipulation;Brainteaser;Game Theory;,true,false,62.940069873689865,4684,7442
2020,"Remove One Element to Make the Array Strictly Increasing",remove-one-element-to-make-the-array-strictly-increasing,false,Easy,1273,341,Algorithms,28.3%,1909,false,Array;,false,false,28.294078243260934,73495,259754
2021,"Remove All Occurrences of a Substring",remove-all-occurrences-of-a-substring,false,Medium,1846,64,Algorithms,78.3%,1910,false,String;Stack;Simulation;,false,false,78.28565686694485,148027,189086
2022,"Maximum Alternating Subsequence Sum",maximum-alternating-subsequence-sum,false,Medium,1278,28,Algorithms,58.9%,1911,false,Array;Dynamic Programming;,false,false,58.85139213267904,44852,76213
2023,"Design Movie Rental System",design-movie-rental-system,false,Hard,248,48,Algorithms,36.8%,1912,false,Array;Hash Table;Design;Heap (Priority Queue);Ordered Set;,false,false,36.79945323179067,7538,20484
2042,"Maximum Product Difference Between Two Pairs",maximum-product-difference-between-two-pairs,false,Easy,1542,68,Algorithms,82.9%,1913,false,Array;Sorting;,true,false,82.86740125508723,264494,319178
2043,"Cyclically Rotating a Grid",cyclically-rotating-a-grid,false,Medium,246,275,Algorithms,50.0%,1914,false,Array;Matrix;Simulation;,false,false,50.02219099045787,13525,27038
2044,"Number of Wonderful Substrings",number-of-wonderful-substrings,false,Medium,1755,280,Algorithms,66.8%,1915,false,Hash Table;String;Bit Manipulation;Prefix Sum;,true,false,66.79933379727733,85429,127889
1313,"Count Ways to Build Rooms in an Ant Colony",count-ways-to-build-rooms-in-an-ant-colony,false,Hard,497,53,Algorithms,49.0%,1916,false,Math;Dynamic Programming;Tree;Graph;Topological Sort;Combinatorics;,false,false,48.98951438111417,8363,17071
2063,"Leetcodify Friends Recommendations",leetcodify-friends-recommendations,true,Hard,68,60,Database,27.5%,1917,true,Database;,false,false,27.515759094706464,7246,26334
2069,"Kth Smallest Subarray Sum",kth-smallest-subarray-sum,true,Medium,214,13,Algorithms,52.8%,1918,true,Array;Binary Search;Sliding Window;,false,false,52.7682993946065,4794,9085
2064,"Leetcodify Similar Friends",leetcodify-similar-friends,true,Hard,59,6,Database,42.5%,1919,true,Database;,false,false,42.51702974303635,6304,14827
2048,"Build Array from Permutation",build-array-from-permutation,false,Easy,3444,412,Algorithms,90.1%,1920,false,Array;Simulation;,false,false,90.11287400410865,594371,659585
2049,"Eliminate Maximum Number of Monsters",eliminate-maximum-number-of-monsters,false,Medium,1525,235,Algorithms,50.9%,1921,false,Array;Greedy;Sorting;,true,false,50.932769034877445,112402,220687
2050,"Count Good Numbers",count-good-numbers,false,Medium,1574,466,Algorithms,47.5%,1922,false,Math;Recursion;,false,false,47.47816286277825,92673,195190
2051,"Longest Common Subpath",longest-common-subpath,false,Hard,490,35,Algorithms,28.7%,1923,false,Array;Binary Search;Rolling Hash;Suffix Array;Hash Function;,false,false,28.667755726252132,8248,28771
2074,"Erect the Fence II",erect-the-fence-ii,true,Hard,13,43,Algorithms,50.6%,1924,true,Array;Math;Geometry;,false,false,50.617283950617285,779,1539
2037,"Count Square Sum Triples",count-square-sum-triples,false,Easy,432,42,Algorithms,68.3%,1925,false,Math;Enumeration;,false,false,68.34729381443299,50916,74496
2038,"Nearest Exit from Entrance in Maze",nearest-exit-from-entrance-in-maze,false,Medium,2406,115,Algorithms,47.0%,1926,false,Array;Breadth-First Search;Matrix;,true,false,47.01693860399244,191884,408113
2039,"Sum Game",sum-game,false,Medium,514,90,Algorithms,47.9%,1927,false,Math;String;Greedy;Game Theory;,false,false,47.936751387671634,13127,27384
2040,"Minimum Cost to Reach Destination in Time",minimum-cost-to-reach-destination-in-time,false,Hard,818,20,Algorithms,39.1%,1928,false,Array;Dynamic Programming;Graph;,false,false,39.12755191066132,22424,57310
2058,"Concatenation of Array",concatenation-of-array,false,Easy,3457,407,Algorithms,90.3%,1929,false,Array;Simulation;,false,false,90.25193704874869,915891,1014816
2059,"Unique Length-3 Palindromic Subsequences",unique-length-3-palindromic-subsequences,false,Medium,2404,100,Algorithms,70.6%,1930,false,Hash Table;String;Bit Manipulation;Prefix Sum;,true,false,70.61722433236443,228120,323037
2061,"Painting a Grid With Three Different Colors",painting-a-grid-with-three-different-colors,false,Hard,485,22,Algorithms,58.1%,1931,false,Dynamic Programming;,false,false,58.09251792114696,10373,17856
2060,"Merge BSTs to Create Single BST",merge-bsts-to-create-single-bst,false,Hard,593,43,Algorithms,36.7%,1932,false,Hash Table;Binary Search;Tree;Depth-First Search;Binary Tree;,false,false,36.72108446906202,10077,27442
2070,"Check if String Is Decomposable Into Value-Equal Substrings",check-if-string-is-decomposable-into-value-equal-substrings,true,Easy,58,13,Algorithms,51.3%,1933,true,String;,false,false,51.25965312064819,4049,7899
2087,"Confirmation Rate",confirmation-rate,false,Medium,1071,94,Database,60.3%,1934,false,Database;,false,false,60.30264176905261,327805,543601
1264,"Maximum Number of Words You Can Type",maximum-number-of-words-you-can-type,false,Easy,606,31,Algorithms,74.1%,1935,false,Hash Table;String;,false,false,74.09852605720302,67566,91184
2066,"Add Minimum Number of Rungs",add-minimum-number-of-rungs,false,Medium,383,27,Algorithms,43.1%,1936,false,Array;Greedy;,false,false,43.11783327470982,30646,71075
2067,"Maximum Number of Points with Cost",maximum-number-of-points-with-cost,false,Medium,3141,231,Algorithms,42.8%,1937,false,Array;Dynamic Programming;Matrix;,true,false,42.8001413770239,146525,342347
2068,"Maximum Genetic Difference Query",maximum-genetic-difference-query,false,Hard,391,21,Algorithms,43.3%,1938,false,Array;Hash Table;Bit Manipulation;Depth-First Search;Trie;,false,false,43.27855035819638,6162,14238
2092,"Users That Actively Request Confirmation Messages",users-that-actively-request-confirmation-messages,true,Easy,63,48,Database,56.5%,1939,true,Database;,false,false,56.47611157138912,12270,21726
2071,"Longest Common Subsequence Between Sorted Arrays",longest-common-subsequence-between-sorted-arrays,true,Medium,188,7,Algorithms,81.4%,1940,true,Array;Hash Table;Counting;,true,false,81.35367126783436,14027,17242
2053,"Check if All Characters Have Equal Number of Occurrences",check-if-all-characters-have-equal-number-of-occurrences,false,Easy,922,22,Algorithms,78.3%,1941,false,Hash Table;String;Counting;,false,false,78.30091003215084,114948,146804
2054,"The Number of the Smallest Unoccupied Chair",the-number-of-the-smallest-unoccupied-chair,false,Medium,1379,76,Algorithms,60.8%,1942,false,Array;Hash Table;Heap (Priority Queue);,true,false,60.76579145703054,119327,196372
2055,"Describe the Painting",describe-the-painting,false,Medium,495,43,Algorithms,50.8%,1943,false,Array;Hash Table;Sorting;Prefix Sum;,false,false,50.766098419490646,14711,28978
1305,"Number of Visible People in a Queue",number-of-visible-people-in-a-queue,false,Hard,1835,54,Algorithms,70.3%,1944,false,Array;Stack;Monotonic Stack;,false,false,70.3367210758649,68513,97407
2076,"Sum of Digits of String After Convert",sum-of-digits-of-string-after-convert,false,Easy,1141,96,Algorithms,74.9%,1945,false,String;Simulation;,true,false,74.87776163253184,211791,282848
2077,"Largest Number After Mutating Substring",largest-number-after-mutating-substring,false,Medium,221,226,Algorithms,36.5%,1946,false,Array;String;Greedy;,false,false,36.45093808166829,22129,60709
2078,"Maximum Compatibility Score Sum",maximum-compatibility-score-sum,false,Medium,800,29,Algorithms,63.0%,1947,false,Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,false,false,62.99750397095529,27763,44070
2079,"Delete Duplicate Folders in System",delete-duplicate-folders-in-system,false,Hard,326,77,Algorithms,54.8%,1948,false,Array;Hash Table;String;Trie;Hash Function;,false,false,54.816950129720375,9508,17345
2097,"Strong Friendship",strong-friendship,true,Medium,149,84,Database,54.7%,1949,true,Database;,false,false,54.6593166065421,13485,24671
2072,"Maximum of Minimum Values in All Subarrays",maximum-of-minimum-values-in-all-subarrays,true,Medium,142,54,Algorithms,49.3%,1950,true,Array;Stack;Monotonic Stack;,false,false,49.274033318049824,3224,6543
2098,"All the Pairs With the Maximum Number of Common Followers",all-the-pairs-with-the-maximum-number-of-common-followers,true,Medium,96,7,Database,69.0%,1951,true,Database;,false,false,68.98239823982398,12541,18180
2083,"Three Divisors",three-divisors,false,Easy,554,33,Algorithms,61.8%,1952,false,Math;Enumeration;Number Theory;,false,false,61.78496577277702,86376,139801
2084,"Maximum Number of Weeks for Which You Can Work",maximum-number-of-weeks-for-which-you-can-work,false,Medium,661,151,Algorithms,41.0%,1953,false,Array;Greedy;,false,false,41.03108246106714,25715,62672
1295,"Minimum Garden Perimeter to Collect Enough Apples",minimum-garden-perimeter-to-collect-enough-apples,false,Medium,392,95,Algorithms,54.5%,1954,false,Math;Binary Search;,false,false,54.457112476370504,18437,33856
2086,"Count Number of Special Subsequences",count-number-of-special-subsequences,false,Hard,522,10,Algorithms,51.6%,1955,false,Array;Dynamic Programming;,false,false,51.59429578593174,12880,24964
2073,"Minimum Time For K Virus Variants to Spread",minimum-time-for-k-virus-variants-to-spread,true,Hard,31,7,Algorithms,48.1%,1956,true,Array;Math;Binary Search;Geometry;Enumeration;,false,false,48.114493412085416,1059,2201
1302,"Delete Characters to Make Fancy String",delete-characters-to-make-fancy-string,false,Easy,905,40,Algorithms,71.9%,1957,false,String;,true,false,71.85067157569874,185785,258571
2080,"Check if Move is Legal",check-if-move-is-legal,false,Medium,167,279,Algorithms,49.1%,1958,false,Array;Matrix;Enumeration;,false,false,49.119892662045174,15376,31303
2081,"Minimum Total Space Wasted With K Resizing Operations",minimum-total-space-wasted-with-k-resizing-operations,false,Medium,574,59,Algorithms,43.1%,1959,false,Array;Dynamic Programming;,false,false,43.132530120481924,9129,21165
1336,"Maximum Product of the Length of Two Palindromic Substrings",maximum-product-of-the-length-of-two-palindromic-substrings,false,Hard,246,42,Algorithms,31.5%,1960,false,String;Rolling Hash;Hash Function;,false,false,31.49146110056926,4149,13175
2093,"Check If String Is a Prefix of Array",check-if-string-is-a-prefix-of-array,false,Easy,503,97,Algorithms,52.7%,1961,false,Array;Two Pointers;String;,false,false,52.65496877257084,61967,117685
2094,"Remove Stones to Minimize the Total",remove-stones-to-minimize-the-total,false,Medium,1877,166,Algorithms,63.8%,1962,false,Array;Greedy;Heap (Priority Queue);,true,false,63.77262026360493,116752,183075
2095,"Minimum Number of Swaps to Make the String Balanced",minimum-number-of-swaps-to-make-the-string-balanced,false,Medium,2454,142,Algorithms,78.0%,1963,false,Two Pointers;String;Stack;Greedy;,true,false,78.01749944097004,216315,277265
2096,"Find the Longest Valid Obstacle Course at Each Position",find-the-longest-valid-obstacle-course-at-each-position,false,Hard,1826,74,Algorithms,62.8%,1964,false,Array;Binary Search;Binary Indexed Tree;,true,false,62.7967556082213,61473,97892
2110,"Employees With Missing Information",employees-with-missing-information,false,Easy,718,37,Database,72.6%,1965,false,Database;,true,false,72.5925413850498,136511,188051
2111,"Binary Searchable Numbers in an Unsorted Array",binary-searchable-numbers-in-an-unsorted-array,true,Medium,74,12,Algorithms,63.7%,1966,true,Array;Binary Search;,false,false,63.739074824131315,2990,4691
2099,"Number of Strings That Appear as Substrings in Word",number-of-strings-that-appear-as-substrings-in-word,false,Easy,717,37,Algorithms,81.5%,1967,false,Array;String;,false,false,81.51898226584194,81316,99751
2085,"Array With Elements Not Equal to Average of Neighbors",array-with-elements-not-equal-to-average-of-neighbors,false,Medium,632,54,Algorithms,50.4%,1968,false,Array;Greedy;Sorting;,false,false,50.43757008434498,41381,82044
2100,"Minimum Non-Zero Product of the Array Elements",minimum-non-zero-product-of-the-array-elements,false,Medium,250,372,Algorithms,35.9%,1969,false,Math;Greedy;Recursion;,false,false,35.918240416148365,12705,35372
2101,"Last Day Where You Can Still Cross",last-day-where-you-can-still-cross,false,Hard,1924,35,Algorithms,62.0%,1970,false,Array;Binary Search;Depth-First Search;Breadth-First Search;Union Find;Matrix;,true,false,61.963556393339616,59169,95487
2121,"Find if Path Exists in Graph",find-if-path-exists-in-graph,false,Easy,3973,231,Algorithms,53.8%,1971,false,Depth-First Search;Breadth-First Search;Union Find;Graph;,true,false,53.80155688839532,505292,939178
2120,"First and Last Call On the Same Day",first-and-last-call-on-the-same-day,true,Hard,137,43,Database,50.8%,1972,true,Database;,true,false,50.79678326508461,10296,20269
2126,"Count Nodes Equal to Sum of Descendants",count-nodes-equal-to-sum-of-descendants,true,Medium,179,9,Algorithms,76.9%,1973,true,Tree;Depth-First Search;Binary Tree;,true,false,76.9222582876603,14456,18793
2088,"Minimum Time to Type Word Using Special Typewriter",minimum-time-to-type-word-using-special-typewriter,false,Easy,710,31,Algorithms,76.1%,1974,false,String;Greedy;,false,false,76.0731222273214,49729,65370
2089,"Maximum Matrix Sum",maximum-matrix-sum,false,Medium,1121,54,Algorithms,66.1%,1975,false,Array;Greedy;Matrix;,true,false,66.06045177393918,106393,161054
2090,"Number of Ways to Arrive at Destination",number-of-ways-to-arrive-at-destination,false,Medium,2957,146,Algorithms,27.9%,1976,false,Dynamic Programming;Graph;Topological Sort;Shortest Path;,false,false,27.934661544044953,89284,319605
2091,"Number of Ways to Separate Numbers",number-of-ways-to-separate-numbers,false,Hard,520,56,Algorithms,21.0%,1977,false,String;Dynamic Programming;Suffix Array;,false,false,21.049955130122644,7037,33430
2127,"Employees Whose Manager Left the Company",employees-whose-manager-left-the-company,false,Easy,432,38,Database,48.9%,1978,false,Database;,false,false,48.885423781234294,189672,387993
2106,"Find Greatest Common Divisor of Array",find-greatest-common-divisor-of-array,false,Easy,1161,51,Algorithms,78.3%,1979,false,Array;Math;Number Theory;,false,false,78.33416225108556,163803,209108
2107,"Find Unique Binary String",find-unique-binary-string,false,Medium,2017,77,Algorithms,74.8%,1980,false,Array;Hash Table;String;Backtracking;,true,false,74.76172743833094,148568,198722
2108,"Minimize the Difference Between Target and Chosen Elements",minimize-the-difference-between-target-and-chosen-elements,false,Medium,987,144,Algorithms,35.5%,1981,false,Array;Dynamic Programming;Matrix;,false,false,35.47499887280761,31472,88716
2109,"Find Array Given Subset Sums",find-array-given-subset-sums,false,Hard,595,40,Algorithms,48.7%,1982,false,Array;Divide and Conquer;,false,false,48.66917175512761,6217,12774
519,"Widest Pair of Indices With Equal Range Sum",widest-pair-of-indices-with-equal-range-sum,true,Medium,98,2,Algorithms,53.6%,1983,true,Array;Hash Table;Prefix Sum;,false,false,53.56461405030356,3088,5765
2112,"Minimum Difference Between Highest and Lowest of K Scores",minimum-difference-between-highest-and-lowest-of-k-scores,false,Easy,1035,302,Algorithms,57.9%,1984,false,Array;Sliding Window;Sorting;,false,false,57.85144504361224,93119,160963
2113,"Find the Kth Largest Integer in the Array",find-the-kth-largest-integer-in-the-array,false,Medium,1282,149,Algorithms,46.2%,1985,false,Array;String;Divide and Conquer;Sorting;Heap (Priority Queue);Quickselect;,false,false,46.155472719473664,76397,165521
2114,"Minimum Number of Work Sessions to Finish the Tasks",minimum-number-of-work-sessions-to-finish-the-tasks,false,Medium,1136,68,Algorithms,33.5%,1986,false,Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,false,false,33.452753093791344,28572,85410
2115,"Number of Unique Good Subsequences",number-of-unique-good-subsequences,false,Hard,709,16,Algorithms,52.0%,1987,false,String;Dynamic Programming;,false,false,52.02582368655387,14022,26952
2136,"Find Cutoff Score for Each School",find-cutoff-score-for-each-school,true,Medium,79,156,Database,66.9%,1988,true,Database;,true,false,66.87173853336995,12174,18205
1979,"Maximum Number of People That Can Be Caught in Tag",maximum-number-of-people-that-can-be-caught-in-tag,true,Medium,73,10,Algorithms,50.6%,1989,true,Array;Greedy;,false,false,50.55508112724168,2368,4684
2143,"Count the Number of Experiments",count-the-number-of-experiments,true,Medium,24,195,Database,49.1%,1990,true,Database;,false,false,49.14900153609831,7999,16275
2102,"Find the Middle Index in Array",find-the-middle-index-in-array,false,Easy,1421,68,Algorithms,67.7%,1991,false,Array;Prefix Sum;,false,false,67.7502284855096,114897,169591
2103,"Find All Groups of Farmland",find-all-groups-of-farmland,false,Medium,1400,90,Algorithms,75.6%,1992,false,Array;Depth-First Search;Breadth-First Search;Matrix;,true,false,75.62642626998193,133554,176597
2104,"Operations on Tree",operations-on-tree,false,Medium,471,80,Algorithms,46.6%,1993,false,Array;Hash Table;Tree;Depth-First Search;Breadth-First Search;Design;,false,false,46.5609529314201,18528,39792
2105,"The Number of Good Subsets",the-number-of-good-subsets,false,Hard,477,15,Algorithms,35.4%,1994,false,Array;Math;Dynamic Programming;Bit Manipulation;Bitmask;,false,false,35.424102666934026,8833,24935
2122,"Count Special Quadruplets",count-special-quadruplets,false,Easy,652,236,Algorithms,62.1%,1995,false,Array;Hash Table;Enumeration;,false,false,62.13571580514784,46736,75216
2123,"The Number of Weak Characters in the Game",the-number-of-weak-characters-in-the-game,false,Medium,3036,94,Algorithms,44.1%,1996,false,Array;Stack;Greedy;Sorting;Monotonic Stack;,true,false,44.147360270595186,108331,245385
2124,"First Day Where You Have Been in All the Rooms",first-day-where-you-have-been-in-all-the-rooms,false,Medium,494,101,Algorithms,37.6%,1997,false,Array;Dynamic Programming;,false,false,37.64595646533083,10446,27748
2125,"GCD Sort of an Array",gcd-sort-of-an-array,false,Hard,507,14,Algorithms,46.3%,1998,false,Array;Math;Union Find;Sorting;Number Theory;,false,false,46.30180800497535,10423,22511
2141,"Smallest Greater Multiple Made of Two Digits",smallest-greater-multiple-made-of-two-digits,true,Medium,29,10,Algorithms,48.4%,1999,true,Math;Enumeration;,false,false,48.351893095768375,2171,4490
2128,"Reverse Prefix of Word",reverse-prefix-of-word,false,Easy,1365,40,Algorithms,86.3%,2000,false,Two Pointers;String;Stack;,true,false,86.32560870677426,296966,344007
2129,"Number of Pairs of Interchangeable Rectangles",number-of-pairs-of-interchangeable-rectangles,false,Medium,539,49,Algorithms,50.9%,2001,false,Array;Hash Table;Math;Counting;Number Theory;,false,false,50.881243063263035,45844,90100
2130,"Maximum Product of the Length of Two Palindromic Subsequences",maximum-product-of-the-length-of-two-palindromic-subsequences,false,Medium,972,82,Algorithms,61.1%,2002,false,String;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,false,false,61.10568326359061,33147,54241
2131,"Smallest Missing Genetic Value in Each Subtree",smallest-missing-genetic-value-in-each-subtree,false,Hard,462,21,Algorithms,46.6%,2003,false,Dynamic Programming;Tree;Depth-First Search;Union Find;,false,false,46.58609963795829,9136,19611
2152,"The Number of Seniors and Juniors to Join the Company",the-number-of-seniors-and-juniors-to-join-the-company,true,Hard,118,14,Database,44.3%,2004,true,Database;,true,false,44.31231345051405,9353,21107
2153,"Subtree Removal Game with Fibonacci Tree",subtree-removal-game-with-fibonacci-tree,true,Hard,16,46,Algorithms,57.8%,2005,true,Math;Dynamic Programming;Tree;Binary Tree;Game Theory;,false,false,57.83521809369952,716,1238
2116,"Count Number of Pairs With Absolute Difference K",count-number-of-pairs-with-absolute-difference-k,false,Easy,1680,45,Algorithms,84.4%,2006,false,Array;Hash Table;Counting;,false,false,84.42328062524453,176932,209578
2117,"Find Original Array From Doubled Array",find-original-array-from-doubled-array,false,Medium,2486,116,Algorithms,40.5%,2007,false,Array;Hash Table;Greedy;Sorting;,true,false,40.49113422429156,140187,346218
2118,"Maximum Earnings From Taxi",maximum-earnings-from-taxi,false,Medium,1316,22,Algorithms,44.5%,2008,false,Array;Hash Table;Binary Search;Dynamic Programming;Sorting;,false,false,44.54627384775517,35093,78779
2119,"Minimum Number of Operations to Make Array Continuous",minimum-number-of-operations-to-make-array-continuous,false,Hard,1918,50,Algorithms,52.5%,2009,false,Array;Hash Table;Binary Search;Sliding Window;,true,false,52.53500756469984,78823,150039
2158,"The Number of Seniors and Juniors to Join the Company II",the-number-of-seniors-and-juniors-to-join-the-company-ii,true,Hard,40,10,Database,63.5%,2010,true,Database;,false,false,63.53794300888571,6221,9791
2137,"Final Value of Variable After Performing Operations",final-value-of-variable-after-performing-operations,false,Easy,1653,195,Algorithms,89.5%,2011,false,Array;String;Simulation;,false,false,89.48212071416329,443796,495961
2138,"Sum of Beauty in the Array",sum-of-beauty-in-the-array,false,Medium,624,69,Algorithms,48.8%,2012,false,Array;,false,false,48.755009401530835,25670,52651
2139,"Detect Squares",detect-squares,false,Medium,929,241,Algorithms,51.6%,2013,false,Array;Hash Table;Design;Counting;,false,false,51.57833842198296,80243,155575
2140,"Longest Subsequence Repeated k Times",longest-subsequence-repeated-k-times,false,Hard,467,81,Algorithms,55.0%,2014,false,String;Backtracking;Greedy;Counting;Enumeration;,false,false,54.9651670799386,9310,16938
2142,"Average Height of Buildings in Each Segment",average-height-of-buildings-in-each-segment,true,Medium,55,28,Algorithms,59.9%,2015,true,Array;Greedy;Sorting;Heap (Priority Queue);,false,false,59.91177996886352,2309,3854
2144,"Maximum Difference Between Increasing Elements",maximum-difference-between-increasing-elements,false,Easy,1049,34,Algorithms,58.0%,2016,false,Array;,false,false,58.04564503341262,102494,176573
2145,"Grid Game",grid-game,false,Medium,937,42,Algorithms,46.3%,2017,false,Array;Matrix;Prefix Sum;,false,false,46.34351453175458,27554,59456
2146,"Check if Word Can Be Placed In Crossword",check-if-word-can-be-placed-in-crossword,false,Medium,309,304,Algorithms,49.8%,2018,false,Array;Matrix;Enumeration;,false,false,49.83980572618003,24423,49003
2147,"The Score of Students Solving Math Expression",the-score-of-students-solving-math-expression,false,Hard,277,82,Algorithms,33.4%,2019,false,Array;Math;String;Dynamic Programming;Stack;Memoization;,false,false,33.37596998379807,7828,23454
2167,"Number of Accounts That Did Not Stream",number-of-accounts-that-did-not-stream,true,Medium,27,218,Database,72.2%,2020,true,Database;,false,false,72.1530744937767,11652,16149
2075,"Brightest Position on Street",brightest-position-on-street,true,Medium,158,3,Algorithms,61.6%,2021,true,Array;Prefix Sum;Ordered Set;,false,false,61.623332192952454,7205,11692
2132,"Convert 1D Array Into 2D Array",convert-1d-array-into-2d-array,false,Easy,1225,100,Algorithms,71.7%,2022,false,Array;Matrix;Simulation;,true,false,71.67758920069456,255931,357059
2133,"Number of Pairs of Strings With Concatenation Equal to Target",number-of-pairs-of-strings-with-concatenation-equal-to-target,false,Medium,721,55,Algorithms,75.1%,2023,false,Array;Hash Table;String;Counting;,false,false,75.13542403975327,52014,69227
2134,"Maximize the Confusion of an Exam",maximize-the-confusion-of-an-exam,false,Medium,2924,49,Algorithms,67.9%,2024,false,String;Binary Search;Sliding Window;Prefix Sum;,true,false,67.88437047504405,116733,171960
2135,"Maximum Number of Ways to Partition an Array",maximum-number-of-ways-to-partition-an-array,false,Hard,501,58,Algorithms,34.6%,2025,false,Array;Hash Table;Counting;Enumeration;Prefix Sum;,false,false,34.5518903001279,11616,33618
2172,"Low-Quality Problems",low-quality-problems,true,Easy,52,11,Database,84.4%,2026,true,Database;,false,false,84.41616008105369,13331,15792
2154,"Minimum Moves to Convert String",minimum-moves-to-convert-string,false,Easy,490,75,Algorithms,55.8%,2027,false,String;Greedy;,false,false,55.782804283089405,44021,78915
2155,"Find Missing Observations",find-missing-observations,false,Medium,1101,107,Algorithms,57.5%,2028,false,Array;Math;Simulation;,true,false,57.45250794235777,168364,293049
2156,"Stone Game IX",stone-game-ix,false,Medium,246,277,Algorithms,29.0%,2029,false,Array;Math;Greedy;Counting;Game Theory;,false,false,29.033852236224362,9400,32376
2157,"Smallest K-Length Subsequence With Occurrences of a Letter",smallest-k-length-subsequence-with-occurrences-of-a-letter,false,Hard,492,12,Algorithms,39.5%,2030,false,String;Stack;Greedy;Monotonic Stack;,false,false,39.468080664690405,9453,23951
510,"Count Subarrays With More Ones Than Zeros",count-subarrays-with-more-ones-than-zeros,true,Medium,177,17,Algorithms,51.3%,2031,true,Array;Binary Search;Divide and Conquer;Binary Indexed Tree;Segment Tree;Merge Sort;Ordered Set;,false,false,51.30306134061682,4508,8787
2159,"Two Out of Three",two-out-of-three,false,Easy,780,51,Algorithms,75.9%,2032,false,Array;Hash Table;Bit Manipulation;,false,false,75.8884072638393,79484,104738
2160,"Minimum Operations to Make a Uni-Value Grid",minimum-operations-to-make-a-uni-value-grid,false,Medium,555,40,Algorithms,53.6%,2033,false,Array;Math;Sorting;Matrix;,false,false,53.647452762497004,24673,45991
2161,"Stock Price Fluctuation ",stock-price-fluctuation,false,Medium,1190,68,Algorithms,48.6%,2034,false,Hash Table;Design;Heap (Priority Queue);Data Stream;Ordered Set;,true,false,48.60588138656152,73966,152172
2162,"Partition Array Into Two Arrays to Minimize Sum Difference",partition-array-into-two-arrays-to-minimize-sum-difference,false,Hard,3252,214,Algorithms,21.1%,2035,false,Array;Two Pointers;Binary Search;Dynamic Programming;Bit Manipulation;Ordered Set;Bitmask;,false,false,21.06572281719606,34638,164431
512,"Maximum Alternating Subarray Sum",maximum-alternating-subarray-sum,true,Medium,99,6,Algorithms,39.8%,2036,true,Array;Dynamic Programming;,false,false,39.77530640036314,3505,8812
2148,"Minimum Number of Moves to Seat Everyone",minimum-number-of-moves-to-seat-everyone,false,Easy,1348,335,Algorithms,87.4%,2037,false,Array;Greedy;Sorting;Counting Sort;,true,false,87.39961981611513,247817,283545
2149,"Remove Colored Pieces if Both Neighbors are the Same Color",remove-colored-pieces-if-both-neighbors-are-the-same-color,false,Medium,1590,126,Algorithms,62.8%,2038,false,Math;String;Greedy;Game Theory;,true,false,62.82931596640071,149147,237385
2151,"The Time When the Network Becomes Idle",the-time-when-the-network-becomes-idle,false,Medium,688,65,Algorithms,52.9%,2039,false,Array;Breadth-First Search;Graph;,false,false,52.88377603192418,16963,32075
2150,"Kth Smallest Product of Two Sorted Arrays",kth-smallest-product-of-two-sorted-arrays,false,Hard,707,39,Algorithms,29.5%,2040,false,Array;Binary Search;,false,false,29.47504595901137,12987,44061
2185,"Accepted Candidates From the Interviews",accepted-candidates-from-the-interviews,true,Medium,54,28,Database,78.6%,2041,true,Database;,true,false,78.5851226993865,12297,15648
2168,"Check if Numbers Are Ascending in a Sentence",check-if-numbers-are-ascending-in-a-sentence,false,Easy,631,22,Algorithms,70.7%,2042,false,String;,false,false,70.69218033622006,66609,94224
2169,"Simple Bank System",simple-bank-system,false,Medium,284,226,Algorithms,63.6%,2043,false,Array;Hash Table;Design;Simulation;,false,false,63.6257567046569,37627,59138
2170,"Count Number of Maximum Bitwise-OR Subsets",count-number-of-maximum-bitwise-or-subsets,false,Medium,1109,71,Algorithms,88.1%,2044,false,Array;Backtracking;Bit Manipulation;Enumeration;,true,false,88.09867245340823,138033,156680
2171,"Second Minimum Time to Reach Destination",second-minimum-time-to-reach-destination,false,Hard,1238,67,Algorithms,62.9%,2045,false,Breadth-First Search;Graph;Shortest Path;,true,false,62.86141169683208,84988,135199
1992,"Sort Linked List Already Sorted Using Absolute Values",sort-linked-list-already-sorted-using-absolute-values,true,Medium,168,3,Algorithms,66.6%,2046,true,Linked List;Two Pointers;Sorting;,false,false,66.58476658476658,9485,14245
2173,"Number of Valid Words in a Sentence",number-of-valid-words-in-a-sentence,false,Easy,318,807,Algorithms,29.6%,2047,false,String;,false,false,29.58173173742875,33784,114207
2174,"Next Greater Numerically Balanced Number",next-greater-numerically-balanced-number,false,Medium,201,282,Algorithms,48.9%,2048,false,Math;Backtracking;Enumeration;,false,false,48.86311513007011,14914,30522
2175,"Count Nodes With the Highest Score",count-nodes-with-the-highest-score,false,Medium,1105,85,Algorithms,50.6%,2049,false,Array;Tree;Depth-First Search;Binary Tree;,false,false,50.64478501765869,31261,61726
2176,"Parallel Courses III",parallel-courses-iii,false,Hard,1568,42,Algorithms,67.0%,2050,false,Array;Dynamic Programming;Graph;Topological Sort;,true,false,67.01459285697767,86930,129719
2194,"The Category of Each Member in the Store",the-category-of-each-member-in-the-store,true,Medium,59,8,Database,70.4%,2051,true,Database;,false,false,70.42709402384148,8921,12667
2082,"Minimum Cost to Separate Sentence Into Rows",minimum-cost-to-separate-sentence-into-rows,true,Medium,43,14,Algorithms,50.1%,2052,true,Array;Dynamic Programming;,false,false,50.108303249097474,2082,4155
2163,"Kth Distinct String in an Array",kth-distinct-string-in-an-array,false,Easy,1254,48,Algorithms,82.0%,2053,false,Array;Hash Table;String;Counting;,true,false,82.01355070929493,240157,292826
2164,"Two Best Non-Overlapping Events",two-best-non-overlapping-events,false,Medium,1466,57,Algorithms,61.4%,2054,false,Array;Binary Search;Dynamic Programming;Sorting;Heap (Priority Queue);,true,false,61.379613356766264,100583,163871
2165,"Plates Between Candles",plates-between-candles,false,Medium,1258,65,Algorithms,45.8%,2055,false,Array;String;Binary Search;Prefix Sum;,false,false,45.78300692531089,61482,134290
2166,"Number of Valid Move Combinations On Chessboard",number-of-valid-move-combinations-on-chessboard,false,Hard,62,292,Algorithms,50.9%,2056,false,Array;String;Backtracking;Simulation;,false,false,50.916230366492144,4668,9168
2181,"Smallest Index With Equal Value",smallest-index-with-equal-value,false,Easy,434,140,Algorithms,72.7%,2057,false,Array;,false,false,72.69223729434016,71487,98342
2182,"Find the Minimum and Maximum Number of Nodes Between Critical Points",find-the-minimum-and-maximum-number-of-nodes-between-critical-points,false,Medium,1287,68,Algorithms,69.6%,2058,false,Linked List;,true,false,69.61970580581959,181933,261324
2183,"Minimum Operations to Convert Number",minimum-operations-to-convert-number,false,Medium,647,33,Algorithms,50.0%,2059,false,Array;Breadth-First Search;,false,false,49.961807071147966,18314,36656
2184,"Check if an Original String Exists Given Two Encoded Strings",check-if-an-original-string-exists-given-two-encoded-strings,false,Hard,314,154,Algorithms,43.7%,2060,false,String;Dynamic Programming;,false,false,43.679547132660595,17747,40630
2203,"Number of Spaces Cleaning Robot Cleaned",number-of-spaces-cleaning-robot-cleaned,true,Medium,125,26,Algorithms,62.5%,2061,true,Array;Matrix;Simulation;,true,false,62.53197769760577,9533,15245
2186,"Count Vowel Substrings of a String",count-vowel-substrings-of-a-string,false,Easy,979,274,Algorithms,69.3%,2062,false,Hash Table;String;,false,false,69.260329343448,48663,70261
2187,"Vowels of All Substrings",vowels-of-all-substrings,false,Medium,850,29,Algorithms,54.3%,2063,false,Math;String;Dynamic Programming;Combinatorics;,false,false,54.349378185863486,32733,60227
2188,"Minimized Maximum of Products Distributed to Any Store",minimized-maximum-of-products-distributed-to-any-store,false,Medium,1679,97,Algorithms,62.6%,2064,false,Array;Binary Search;Greedy;,true,false,62.61528278296683,127707,203955
2189,"Maximum Path Quality of a Graph",maximum-path-quality-of-a-graph,false,Hard,661,50,Algorithms,59.3%,2065,false,Array;Backtracking;Graph;,false,false,59.25601750547046,24372,41130
2208,"Account Balance",account-balance,true,Medium,71,2,Database,82.2%,2066,true,Database;,false,false,82.22719555486958,10655,12958
2209,"Number of Equal Count Substrings",number-of-equal-count-substrings,true,Medium,107,9,Algorithms,45.4%,2067,true,String;Counting;Prefix Sum;,false,false,45.35002183088343,3116,6871
2177,"Check Whether Two Strings are Almost Equivalent",check-whether-two-strings-are-almost-equivalent,false,Easy,539,22,Algorithms,63.9%,2068,false,Hash Table;String;Counting;,true,false,63.9360423919406,62259,97377
2178,"Walking Robot Simulation II",walking-robot-simulation-ii,false,Medium,180,316,Algorithms,26.6%,2069,false,Design;Simulation;,false,false,26.628450272880755,13564,50938
2179,"Most Beautiful Item for Each Query",most-beautiful-item-for-each-query,false,Medium,1217,44,Algorithms,62.2%,2070,false,Array;Binary Search;Sorting;,true,false,62.166981005678714,120640,194058
2180,"Maximum Number of Tasks You Can Assign",maximum-number-of-tasks-you-can-assign,false,Hard,555,23,Algorithms,33.7%,2071,false,Array;Binary Search;Greedy;Queue;Sorting;Monotonic Queue;,false,false,33.708009919804184,10466,31049
2214,"The Winner University",the-winner-university,true,Easy,67,2,Database,74.8%,2072,true,Database;,true,false,74.77325965523455,12449,16649
2195,"Time Needed to Buy Tickets",time-needed-to-buy-tickets,false,Easy,1702,153,Algorithms,70.1%,2073,false,Array;Queue;Simulation;,true,false,70.14656063475752,234810,334742
2196,"Reverse Nodes in Even Length Groups",reverse-nodes-in-even-length-groups,false,Medium,761,349,Algorithms,59.7%,2074,false,Linked List;,false,false,59.723879325038354,31536,52803
2197,"Decode the Slanted Ciphertext",decode-the-slanted-ciphertext,false,Medium,252,65,Algorithms,49.2%,2075,false,String;Simulation;,false,false,49.1614020459866,15330,31183
2198,"Process Restricted Friend Requests",process-restricted-friend-requests,false,Hard,620,15,Algorithms,56.2%,2076,false,Union Find;Graph;,false,false,56.24944294245224,18933,33659
2218,"Paths in Maze That Lead to Same Room",paths-in-maze-that-lead-to-same-room,true,Medium,132,12,Algorithms,55.9%,2077,true,Graph;,false,false,55.85692673438513,5169,9254
2199,"Two Furthest Houses With Different Colors",two-furthest-houses-with-different-colors,false,Easy,928,28,Algorithms,65.6%,2078,false,Array;Greedy;,false,false,65.59381880938685,66132,100821
1310,"Watering Plants",watering-plants,false,Medium,931,70,Algorithms,79.8%,2079,false,Array;Simulation;,false,false,79.84311961426543,56798,71137
1294,"Range Frequency Queries",range-frequency-queries,false,Medium,680,28,Algorithms,40.9%,2080,false,Array;Hash Table;Binary Search;Design;Segment Tree;,false,false,40.87334754797441,23962,58624
2202,"Sum of k-Mirror Numbers",sum-of-k-mirror-numbers,false,Hard,127,151,Algorithms,42.3%,2081,false,Math;Enumeration;,false,false,42.278203723986856,7720,18260
2223,"The Number of Rich Customers",the-number-of-rich-customers,true,Easy,97,25,Database,77.4%,2082,true,Database;,true,false,77.3983690174399,25341,32741
2225,"Substrings That Begin and End With the Same Letter",substrings-that-begin-and-end-with-the-same-letter,true,Medium,136,12,Algorithms,74.1%,2083,true,Hash Table;Math;String;Counting;Prefix Sum;,true,false,74.1252821670429,13135,17720
2224,"Drop Type 1 Orders for Customers With Type 0 Orders",drop-type-1-orders-for-customers-with-type-0-orders,true,Medium,88,19,Database,87.0%,2084,true,Database;,false,false,87.01926494632829,12241,14067
2190,"Count Common Words With One Occurrence",count-common-words-with-one-occurrence,false,Easy,848,19,Algorithms,71.7%,2085,false,Array;Hash Table;String;Counting;,false,false,71.66416663825726,84083,117330
2191,"Minimum Number of Food Buckets to Feed the Hamsters",minimum-number-of-food-buckets-to-feed-the-hamsters,false,Medium,547,30,Algorithms,46.9%,2086,false,String;Dynamic Programming;Greedy;,false,false,46.9291152222792,23794,50702
2192,"Minimum Cost Homecoming of a Robot in a Grid",minimum-cost-homecoming-of-a-robot-in-a-grid,false,Medium,695,93,Algorithms,51.1%,2087,false,Array;Greedy;,false,false,51.115945926125114,20910,40907
2193,"Count Fertile Pyramids in a Land",count-fertile-pyramids-in-a-land,false,Hard,380,19,Algorithms,65.2%,2088,false,Array;Dynamic Programming;Matrix;,false,false,65.1976591424818,10918,16746
2210,"Find Target Indices After Sorting Array",find-target-indices-after-sorting-array,false,Easy,1844,96,Algorithms,76.9%,2089,false,Array;Binary Search;Sorting;,false,false,76.9367025342506,209353,272111
2211,"K Radius Subarray Averages",k-radius-subarray-averages,false,Medium,1935,99,Algorithms,46.1%,2090,false,Array;Sliding Window;,true,false,46.094891084132996,146749,318364
2212,"Removing Minimum and Maximum From Array",removing-minimum-and-maximum-from-array,false,Medium,975,54,Algorithms,54.9%,2091,false,Array;Greedy;,false,false,54.860770188037314,48051,87588
2213,"Find All People With Secret",find-all-people-with-secret,false,Hard,1610,82,Algorithms,45.4%,2092,false,Depth-First Search;Breadth-First Search;Union Find;Graph;Sorting;,true,false,45.42931436347224,101157,222669
2230,"Minimum Cost to Reach City With Discounts",minimum-cost-to-reach-city-with-discounts,true,Medium,231,21,Algorithms,59.8%,2093,true,Graph;Heap (Priority Queue);Shortest Path;,true,false,59.78743744025192,10632,17783
2215,"Finding 3-Digit Even Numbers",finding-3-digit-even-numbers,false,Easy,807,271,Algorithms,62.5%,2094,false,Array;Hash Table;Sorting;Enumeration;,false,false,62.451936564516394,37844,60597
2216,"Delete the Middle Node of a Linked List",delete-the-middle-node-of-a-linked-list,false,Medium,4380,87,Algorithms,59.6%,2095,false,Linked List;Two Pointers;,true,false,59.593787013267416,574088,963336
2217,"Step-By-Step Directions From a Binary Tree Node to Another",step-by-step-directions-from-a-binary-tree-node-to-another,false,Medium,3123,163,Algorithms,56.3%,2096,false,String;Tree;Depth-First Search;Binary Tree;,true,false,56.347140526383576,209979,372653
2201,"Valid Arrangement of Pairs",valid-arrangement-of-pairs,false,Hard,1007,54,Algorithms,66.8%,2097,false,Depth-First Search;Graph;Eulerian Circuit;,true,false,66.78826682549136,71768,107456
2242,"Subsequence of Size K With the Largest Even Sum",subsequence-of-size-k-with-the-largest-even-sum,true,Medium,91,8,Algorithms,36.1%,2098,true,Array;Greedy;Sorting;,false,false,36.14675411082597,3803,10521
2204,"Find Subsequence of Length K With the Largest Sum",find-subsequence-of-length-k-with-the-largest-sum,false,Easy,1300,143,Algorithms,44.6%,2099,false,Array;Hash Table;Sorting;Heap (Priority Queue);,false,false,44.63629988765147,59194,132615
2205,"Find Good Days to Rob the Bank",find-good-days-to-rob-the-bank,false,Medium,912,47,Algorithms,49.7%,2100,false,Array;Dynamic Programming;Prefix Sum;,false,false,49.71451268556675,30039,60423
2206,"Detonate the Maximum Bombs",detonate-the-maximum-bombs,false,Medium,3160,156,Algorithms,48.9%,2101,false,Array;Math;Depth-First Search;Breadth-First Search;Graph;Geometry;,true,false,48.904209661218154,139243,284726
2207,"Sequentially Ordinal Rank Tracker",sequentially-ordinal-rank-tracker,false,Hard,387,43,Algorithms,64.6%,2102,false,Design;Heap (Priority Queue);Data Stream;Ordered Set;,false,false,64.58122715607746,16609,25718
2226,"Rings and Rods",rings-and-rods,false,Easy,978,19,Algorithms,80.9%,2103,false,Hash Table;String;,false,false,80.94137486360479,81594,100807
2227,"Sum of Subarray Ranges",sum-of-subarray-ranges,false,Medium,2525,122,Algorithms,60.4%,2104,false,Array;Stack;Monotonic Stack;,true,false,60.42806987457067,126849,209917
2228,"Watering Plants II",watering-plants-ii,false,Medium,287,162,Algorithms,48.2%,2105,false,Array;Two Pointers;Simulation;,false,false,48.22986920640393,22382,46408
2229,"Maximum Fruits Harvested After at Most K Steps",maximum-fruits-harvested-after-at-most-k-steps,false,Hard,567,19,Algorithms,36.3%,2106,false,Array;Binary Search;Sliding Window;Prefix Sum;,false,false,36.28964440172994,12083,33296
2247,"Number of Unique Flavors After Sharing K Candies",number-of-unique-flavors-after-sharing-k-candies,true,Medium,111,7,Algorithms,59.9%,2107,true,Array;Hash Table;Sliding Window;,true,false,59.93306061732986,8058,13445
2231,"Find First Palindromic String in the Array",find-first-palindromic-string-in-the-array,false,Easy,1561,56,Algorithms,83.9%,2108,false,Array;Two Pointers;String;,true,false,83.86856198347108,317126,378123
2232,"Adding Spaces to a String",adding-spaces-to-a-string,false,Medium,1046,109,Algorithms,71.8%,2109,false,Array;Two Pointers;String;Simulation;,true,false,71.787426589528,197045,274484
2233,"Number of Smooth Descent Periods of a Stock",number-of-smooth-descent-periods-of-a-stock,false,Medium,721,34,Algorithms,59.1%,2110,false,Array;Math;Dynamic Programming;,false,false,59.06465327664565,40288,68210
2234,"Minimum Operations to Make the Array K-Increasing",minimum-operations-to-make-the-array-k-increasing,false,Hard,703,14,Algorithms,38.7%,2111,false,Array;Binary Search;,false,false,38.737498595347795,13789,35596
2252,"The Airport With the Most Traffic",the-airport-with-the-most-traffic,true,Medium,66,8,Database,70.7%,2112,true,Database;,false,false,70.74710113019228,9640,13626
2258,"Elements in Array After Removing and Replacing Elements",elements-in-array-after-removing-and-replacing-elements,true,Medium,63,8,Algorithms,72.5%,2113,true,Array;,false,false,72.45346869712353,2141,2955
2219,"Maximum Number of Words Found in Sentences",maximum-number-of-words-found-in-sentences,false,Easy,1773,61,Algorithms,86.6%,2114,false,Array;String;,false,false,86.59303439800179,326228,376737
2220,"Find All Possible Recipes from Given Supplies",find-all-possible-recipes-from-given-supplies,false,Medium,1924,95,Algorithms,50.5%,2115,false,Array;Hash Table;String;Graph;Topological Sort;,false,false,50.49807158773423,103567,205091
2221,"Check if a Parentheses String Can Be Valid",check-if-a-parentheses-string-can-be-valid,false,Medium,1187,49,Algorithms,32.4%,2116,false,String;Stack;Greedy;,false,false,32.4456077212498,29751,91695
2222,"Abbreviating the Product of a Range",abbreviating-the-product-of-a-range,false,Hard,90,157,Algorithms,25.6%,2117,false,Math;,false,false,25.643617738239655,3805,14838
2253,"Build the Equation",build-the-equation,true,Hard,23,38,Database,55.9%,2118,true,Database;,false,false,55.89374654122855,3030,5421
2238,"A Number After a Double Reversal",a-number-after-a-double-reversal,false,Easy,710,42,Algorithms,80.8%,2119,false,Math;,false,false,80.8141439224857,106092,131279
2239,"Execution of All Suffix Instructions Staying in a Grid",execution-of-all-suffix-instructions-staying-in-a-grid,false,Medium,547,53,Algorithms,82.4%,2120,false,String;Simulation;,false,false,82.43014498442214,33601,40763
2240,"Intervals Between Identical Elements",intervals-between-identical-elements,false,Medium,924,41,Algorithms,44.7%,2121,false,Array;Hash Table;Prefix Sum;,false,false,44.66784459473182,21994,49239
2241,"Recover the Original Array",recover-the-original-array,false,Hard,379,33,Algorithms,40.0%,2122,false,Array;Hash Table;Two Pointers;Sorting;Enumeration;,false,false,39.9755043717892,11750,29393
2259,"Minimum Operations to Remove Adjacent Ones in Matrix",minimum-operations-to-remove-adjacent-ones-in-matrix,true,Hard,53,13,Algorithms,40.2%,2123,true,Array;Graph;Matrix;,false,false,40.21695460024106,1001,2489
2243,"Check if All A's Appears Before All B's",check-if-all-as-appears-before-all-bs,false,Easy,754,20,Algorithms,72.2%,2124,false,String;,false,false,72.20369646375212,94189,130448
2244,"Number of Laser Beams in a Bank",number-of-laser-beams-in-a-bank,false,Medium,1887,191,Algorithms,85.5%,2125,false,Array;Math;String;Matrix;,true,false,85.49917678170765,217585,254488
2245,"Destroying Asteroids",destroying-asteroids,false,Medium,566,193,Algorithms,52.1%,2126,false,Array;Greedy;Sorting;,false,false,52.11210888736761,51764,99332
2246,"Maximum Employees to Be Invited to a Meeting",maximum-employees-to-be-invited-to-a-meeting,false,Hard,1059,38,Algorithms,37.7%,2127,false,Depth-First Search;Graph;Topological Sort;,false,false,37.651294622337986,14745,39162
2268,"Remove All Ones With Row and Column Flips",remove-all-ones-with-row-and-column-flips,true,Medium,476,185,Algorithms,76.2%,2128,true,Array;Math;Bit Manipulation;Matrix;,false,false,76.21593575166938,33785,44328
2235,"Capitalize the Title",capitalize-the-title,false,Easy,754,52,Algorithms,65.5%,2129,false,String;,false,false,65.51836439297992,72423,110539
2236,"Maximum Twin Sum of a Linked List",maximum-twin-sum-of-a-linked-list,false,Medium,3641,109,Algorithms,81.2%,2130,false,Linked List;Two Pointers;Stack;,true,false,81.15202423886132,358906,442264
2237,"Longest Palindrome by Concatenating Two Letter Words",longest-palindrome-by-concatenating-two-letter-words,false,Medium,2469,63,Algorithms,47.9%,2131,false,Array;Hash Table;String;Greedy;Counting;,true,false,47.87204853436581,125622,262412
2200,"Stamping the Grid",stamping-the-grid,false,Hard,396,45,Algorithms,32.8%,2132,false,Array;Greedy;Matrix;Prefix Sum;,false,false,32.751362060425954,7935,24227
2254,"Check if Every Row and Column Contains All Numbers",check-if-every-row-and-column-contains-all-numbers,false,Easy,989,53,Algorithms,52.3%,2133,false,Array;Hash Table;Matrix;,false,false,52.27263061322446,86031,164585
2255,"Minimum Swaps to Group All 1's Together II",minimum-swaps-to-group-all-1s-together-ii,false,Medium,1994,41,Algorithms,65.5%,2134,false,Array;Sliding Window;,true,false,65.54306509000429,161737,246765
2256,"Count Words Obtained After Adding a Letter",count-words-obtained-after-adding-a-letter,false,Medium,701,163,Algorithms,43.2%,2135,false,Array;Hash Table;String;Bit Manipulation;Sorting;,false,false,43.19319140843229,36338,84129
2257,"Earliest Possible Day of Full Bloom",earliest-possible-day-of-full-bloom,false,Hard,1604,83,Algorithms,71.3%,2136,false,Array;Greedy;Sorting;,true,false,71.33057096002904,56981,79883
2273,"Pour Water Between Buckets to Make Water Levels Equal",pour-water-between-buckets-to-make-water-levels-equal,true,Medium,109,10,Algorithms,67.0%,2137,true,Array;Binary Search;,false,false,67.00328792860498,2853,4258
2260,"Divide a String Into Groups of Size k",divide-a-string-into-groups-of-size-k,false,Easy,473,22,Algorithms,67.2%,2138,false,String;Simulation;,false,false,67.19100250074504,51855,77176
1303,"Minimum Moves to Reach Target Score",minimum-moves-to-reach-target-score,false,Medium,1017,25,Algorithms,51.2%,2139,false,Math;Greedy;,false,false,51.16687605135958,48059,93926
2262,"Solving Questions With Brainpower",solving-questions-with-brainpower,false,Medium,2373,60,Algorithms,55.2%,2140,false,Array;Dynamic Programming;,true,false,55.163990763312356,111561,202235
2263,"Maximum Running Time of N Computers",maximum-running-time-of-n-computers,false,Hard,2019,57,Algorithms,49.9%,2141,false,Array;Binary Search;Greedy;Sorting;,true,false,49.94582277674204,62689,125514
2281,"The Number of Passengers in Each Bus I",the-number-of-passengers-in-each-bus-i,true,Medium,112,12,Database,49.0%,2142,true,Database;,false,false,48.95468689225982,10069,20568
2282,"Choose Numbers From Two Arrays in Range",choose-numbers-from-two-arrays-in-range,true,Hard,38,5,Algorithms,52.2%,2143,true,Array;Dynamic Programming;,false,false,52.16035634743875,1171,2245
2248,"Minimum Cost of Buying Candies With Discount",minimum-cost-of-buying-candies-with-discount,false,Easy,612,20,Algorithms,61.7%,2144,false,Array;Greedy;Sorting;,false,false,61.680514120125316,57683,93519
2249,"Count the Hidden Sequences",count-the-hidden-sequences,false,Medium,528,46,Algorithms,39.3%,2145,false,Array;Prefix Sum;,false,false,39.316571206678965,20250,51505
2250,"K Highest Ranked Items Within a Price Range",k-highest-ranked-items-within-a-price-range,false,Medium,515,161,Algorithms,43.9%,2146,false,Array;Breadth-First Search;Sorting;Heap (Priority Queue);Matrix;,false,false,43.852324198486805,17329,39518
2251,"Number of Ways to Divide a Long Corridor",number-of-ways-to-divide-a-long-corridor,false,Hard,1067,108,Algorithms,49.1%,2147,false,Math;String;Dynamic Programming;,true,false,49.09535245688046,69710,141989
2269,"Count Elements With Strictly Smaller and Greater Elements ",count-elements-with-strictly-smaller-and-greater-elements,false,Easy,663,42,Algorithms,59.4%,2148,false,Array;Sorting;Counting;,false,false,59.384152031115754,64278,108241
2271,"Rearrange Array Elements by Sign",rearrange-array-elements-by-sign,false,Medium,3453,197,Algorithms,84.1%,2149,false,Array;Two Pointers;Simulation;,true,false,84.1091492776886,481543,572524
2270,"Find All Lonely Numbers in the Array",find-all-lonely-numbers-in-the-array,false,Medium,665,63,Algorithms,61.0%,2150,false,Array;Hash Table;Counting;,false,false,61.026886579304104,54020,88519
2272,"Maximum Good People Based on Statements",maximum-good-people-based-on-statements,false,Hard,515,82,Algorithms,51.0%,2151,false,Array;Backtracking;Bit Manipulation;Enumeration;,false,false,51.04522995058913,14772,28940
2287,"Minimum Number of Lines to Cover Points",minimum-number-of-lines-to-cover-points,true,Medium,71,14,Algorithms,42.6%,2152,true,Array;Hash Table;Math;Dynamic Programming;Backtracking;Bit Manipulation;Geometry;Bitmask;,false,false,42.57990867579909,2238,5256
2296,"The Number of Passengers in Each Bus II",the-number-of-passengers-in-each-bus-ii,true,Hard,80,28,Database,39.4%,2153,true,Database;,true,false,39.35772063262103,3260,8283
2274,"Keep Multiplying Found Values by Two",keep-multiplying-found-values-by-two,false,Easy,733,39,Algorithms,71.2%,2154,false,Array;Hash Table;Sorting;Simulation;,false,false,71.23450688655075,109541,153776
2261,"All Divisions With the Highest Score of a Binary Array",all-divisions-with-the-highest-score-of-a-binary-array,false,Medium,512,16,Algorithms,64.6%,2155,false,Array;,false,false,64.56545989250583,31834,49305
2275,"Find Substring With Given Hash Value",find-substring-with-given-hash-value,false,Hard,429,384,Algorithms,24.2%,2156,false,String;Sliding Window;Rolling Hash;Hash Function;,false,false,24.167276564600957,14199,58753
2276,"Groups of Strings",groups-of-strings,false,Hard,482,57,Algorithms,26.2%,2157,false,String;Bit Manipulation;Union Find;,false,false,26.224410469033426,10120,38590
2297,"Amount of New Area Painted Each Day",amount-of-new-area-painted-each-day,true,Hard,429,42,Algorithms,55.4%,2158,true,Array;Segment Tree;Ordered Set;,false,false,55.37191559311737,30990,55967
2302,"Order Two Columns Independently",order-two-columns-independently,true,Medium,74,18,Database,60.6%,2159,true,Database;,false,false,60.636003061721524,8714,14371
2264,"Minimum Sum of Four Digit Number After Splitting Digits",minimum-sum-of-four-digit-number-after-splitting-digits,false,Easy,1437,140,Algorithms,86.3%,2160,false,Math;Greedy;Sorting;,false,false,86.25366458580397,143282,166117
2265,"Partition Array According to Given Pivot",partition-array-according-to-given-pivot,false,Medium,1134,89,Algorithms,85.3%,2161,false,Array;Two Pointers;Simulation;,false,false,85.29877651769142,87775,102903
2266,"Minimum Cost to Set Cooking Time",minimum-cost-to-set-cooking-time,false,Medium,223,632,Algorithms,41.0%,2162,false,Math;Enumeration;,false,false,41.04829778013194,17049,41534
2267,"Minimum Difference in Sums After Removal of Elements",minimum-difference-in-sums-after-removal-of-elements,false,Hard,685,18,Algorithms,48.5%,2163,false,Array;Dynamic Programming;Heap (Priority Queue);,false,false,48.45482713633398,11885,24528
2283,"Sort Even and Odd Indices Independently",sort-even-and-odd-indices-independently,false,Easy,752,63,Algorithms,62.4%,2164,false,Array;Sorting;,false,false,62.416633628474514,70846,113505
2284,"Smallest Value of the Rearranged Number",smallest-value-of-the-rearranged-number,false,Medium,658,25,Algorithms,52.5%,2165,false,Math;Sorting;,false,false,52.46712024040276,40332,76871
2285,"Design Bitset",design-bitset,false,Medium,592,49,Algorithms,32.8%,2166,false,Array;Hash Table;String;Design;,false,false,32.75660886009737,24423,74559
2286,"Minimum Time to Remove All Cars Containing Illegal Goods",minimum-time-to-remove-all-cars-containing-illegal-goods,false,Hard,681,14,Algorithms,41.7%,2167,false,String;Dynamic Programming;,false,false,41.68962635049376,13467,32303
2303,"Unique Substrings With Equal Digit Frequency",unique-substrings-with-equal-digit-frequency,true,Medium,75,8,Algorithms,61.4%,2168,true,Hash Table;String;Rolling Hash;Counting;Hash Function;,true,false,61.36877828054299,3255,5304
2288,"Count Operations to Obtain Zero",count-operations-to-obtain-zero,false,Easy,620,24,Algorithms,74.6%,2169,false,Math;Simulation;,false,false,74.56975023541546,83149,111505
2289,"Minimum Operations to Make the Array Alternating",minimum-operations-to-make-the-array-alternating,false,Medium,583,335,Algorithms,33.5%,2170,false,Array;Hash Table;Greedy;Counting;,false,false,33.48963613833502,23783,71016
2290,"Removing Minimum Number of Magic Beans",removing-minimum-number-of-magic-beans,false,Medium,892,48,Algorithms,43.2%,2171,false,Array;Greedy;Sorting;Enumeration;Prefix Sum;,false,false,43.19077724060989,29035,67225
2291,"Maximum AND Sum of Array",maximum-and-sum-of-array,false,Hard,519,31,Algorithms,49.5%,2172,false,Array;Dynamic Programming;Bit Manipulation;Bitmask;,false,false,49.490835030549896,15066,30442
2313,"Longest Winning Streak",longest-winning-streak,true,Hard,102,4,Database,53.0%,2173,true,Database;,true,false,52.98915562146631,5717,10789
2314,"Remove All Ones With Row and Column Flips II",remove-all-ones-with-row-and-column-flips-ii,true,Medium,92,23,Algorithms,67.1%,2174,true,Array;Bit Manipulation;Breadth-First Search;Matrix;,false,false,67.11122620743234,5183,7723
2315,"The Change in Global Rankings",the-change-in-global-rankings,true,Medium,42,18,Database,60.3%,2175,true,Database;,false,false,60.32836320991791,7202,11938
2277,"Count Equal and Divisible Pairs in an Array",count-equal-and-divisible-pairs-in-an-array,false,Easy,657,31,Algorithms,79.5%,2176,false,Array;,false,false,79.46429396383661,86005,108231
2278,"Find Three Consecutive Integers That Sum to a Given Number",find-three-consecutive-integers-that-sum-to-a-given-number,false,Medium,685,227,Algorithms,64.7%,2177,false,Math;Simulation;,false,false,64.68959036561692,52319,80877
2279,"Maximum Split of Positive Even Integers",maximum-split-of-positive-even-integers,false,Medium,800,74,Algorithms,59.3%,2178,false,Math;Backtracking;Greedy;,false,false,59.34756849563514,49084,82706
2280,"Count Good Triplets in an Array",count-good-triplets-in-an-array,false,Hard,624,25,Algorithms,41.6%,2179,false,Array;Binary Search;Divide and Conquer;Binary Indexed Tree;Segment Tree;Merge Sort;Ordered Set;,false,false,41.56322466239258,9141,21993
2298,"Count Integers With Even Digit Sum",count-integers-with-even-digit-sum,false,Easy,651,32,Algorithms,67.9%,2180,false,Math;Simulation;,false,false,67.90245666803095,71339,105061
2299,"Merge Nodes in Between Zeros",merge-nodes-in-between-zeros,false,Medium,2355,50,Algorithms,89.7%,2181,false,Linked List;Simulation;,true,false,89.70178225901175,290203,323520
2300,"Construct String With Repeat Limit",construct-string-with-repeat-limit,false,Medium,1164,94,Algorithms,71.1%,2182,false,Hash Table;String;Greedy;Heap (Priority Queue);Counting;,true,false,71.06477131512744,117231,164964
2301,"Count Array Pairs Divisible by K",count-array-pairs-divisible-by-k,false,Hard,881,37,Algorithms,29.7%,2183,false,Array;Math;Number Theory;,false,false,29.71729845585819,18995,63919
2322,"Number of Ways to Build Sturdy Brick Wall",number-of-ways-to-build-sturdy-brick-wall,true,Medium,183,126,Algorithms,49.3%,2184,true,Array;Dynamic Programming;Bit Manipulation;Bitmask;,false,false,49.33281656608161,8910,18060
2292,"Counting Words With a Given Prefix",counting-words-with-a-given-prefix,false,Easy,713,20,Algorithms,78.7%,2185,false,Array;String;String Matching;,true,false,78.74399598537529,109840,139490
2293,"Minimum Number of Steps to Make Two Strings Anagram II",minimum-number-of-steps-to-make-two-strings-anagram-ii,false,Medium,583,26,Algorithms,72.8%,2186,false,Hash Table;String;Counting;,false,false,72.78372557342514,46297,63609
2294,"Minimum Time to Complete Trips",minimum-time-to-complete-trips,false,Medium,2878,186,Algorithms,38.9%,2187,false,Array;Binary Search;,true,false,38.89058517830771,124824,320962
2295,"Minimum Time to Finish the Race",minimum-time-to-finish-the-race,false,Hard,573,25,Algorithms,41.9%,2188,false,Array;Dynamic Programming;,false,false,41.86885571480586,12649,30211
1385,"Number of Ways to Build House of Cards",number-of-ways-to-build-house-of-cards,true,Medium,66,18,Algorithms,62.9%,2189,true,Math;Dynamic Programming;,false,false,62.94427883512955,2745,4361
2312,"Most Frequent Number Following Key In an Array",most-frequent-number-following-key-in-an-array,false,Easy,380,240,Algorithms,59.1%,2190,false,Array;Hash Table;Counting;,false,false,59.12260187952016,40955,69268
1333,"Sort the Jumbled Numbers",sort-the-jumbled-numbers,false,Medium,935,139,Algorithms,60.1%,2191,false,Array;Sorting;,true,false,60.063927270683,149579,249033
1431,"All Ancestors of a Node in a Directed Acyclic Graph",all-ancestors-of-a-node-in-a-directed-acyclic-graph,false,Medium,1642,43,Algorithms,62.1%,2192,false,Depth-First Search;Breadth-First Search;Graph;Topological Sort;,true,false,62.08036032821976,139208,224239
1356,"Minimum Number of Moves to Make Palindrome",minimum-number-of-moves-to-make-palindrome,false,Hard,998,72,Algorithms,51.3%,2193,false,Two Pointers;String;Greedy;Binary Indexed Tree;,false,false,51.307675529910966,25876,50432
2304,"Cells in a Range on an Excel Sheet",cells-in-a-range-on-an-excel-sheet,false,Easy,621,98,Algorithms,84.0%,2194,false,String;,false,false,83.95691983400303,76473,91086
2305,"Append K Integers With Minimal Sum",append-k-integers-with-minimal-sum,false,Medium,787,311,Algorithms,25.8%,2195,false,Array;Math;Greedy;Sorting;,false,false,25.765852379495698,35376,137298
2306,"Create Binary Tree From Descriptions",create-binary-tree-from-descriptions,false,Medium,1589,36,Algorithms,81.7%,2196,false,Array;Hash Table;Tree;Binary Tree;,true,false,81.72193232584931,156768,191831
2307,"Replace Non-Coprime Numbers in Array",replace-non-coprime-numbers-in-array,false,Hard,433,13,Algorithms,40.1%,2197,false,Array;Math;Stack;Number Theory;,false,false,40.14360478345511,15875,39550
1383,"Number of Single Divisor Triplets",number-of-single-divisor-triplets,true,Medium,27,12,Algorithms,55.9%,2198,true,Math;,false,false,55.85808580858086,1354,2424
2335,"Finding the Topic of Each Post",finding-the-topic-of-each-post,true,Hard,46,15,Database,49.6%,2199,true,Database;,false,false,49.63225970073548,3914,7886
2320,"Find All K-Distant Indices in an Array",find-all-k-distant-indices-in-an-array,false,Easy,434,73,Algorithms,66.6%,2200,false,Array;Two Pointers;,false,false,66.61007016963923,44331,66553
1312,"Count Artifacts That Can Be Extracted",count-artifacts-that-can-be-extracted,false,Medium,216,200,Algorithms,56.2%,2201,false,Array;Hash Table;Simulation;,false,false,56.19266675686646,20765,36954
1346,"Maximize the Topmost Element After K Moves",maximize-the-topmost-element-after-k-moves,false,Medium,624,326,Algorithms,23.2%,2202,false,Array;Greedy;,false,false,23.155995326204316,31311,135221
2321,"Minimum Weighted Subgraph With the Required Paths",minimum-weighted-subgraph-with-the-required-paths,false,Hard,684,18,Algorithms,37.5%,2203,false,Graph;Shortest Path;,false,false,37.5259525279165,13375,35642
1347,"Distance to a Cycle in Undirected Graph",distance-to-a-cycle-in-undirected-graph,true,Hard,140,9,Algorithms,73.4%,2204,true,Depth-First Search;Breadth-First Search;Union Find;Graph;,true,false,73.40058740901544,5748,7831
2336,"The Number of Users That Are Eligible for Discount",the-number-of-users-that-are-eligible-for-discount,true,Easy,28,76,Database,50.4%,2205,true,Database;,false,false,50.35750766087844,6902,13706
2308,"Divide Array Into Equal Pairs",divide-array-into-equal-pairs,false,Easy,733,36,Algorithms,74.0%,2206,false,Array;Hash Table;Bit Manipulation;Counting;,false,false,74.01464440202025,91883,124142
2309,"Maximize Number of Subsequences in a String",maximize-number-of-subsequences-in-a-string,false,Medium,510,35,Algorithms,35.2%,2207,false,String;Greedy;Prefix Sum;,false,false,35.200013373230135,21057,59821
2310,"Minimum Operations to Halve Array Sum",minimum-operations-to-halve-array-sum,false,Medium,613,30,Algorithms,47.8%,2208,false,Array;Greedy;Heap (Priority Queue);,false,false,47.768414281119334,37128,77725
2311,"Minimum White Tiles After Covering With Carpets",minimum-white-tiles-after-covering-with-carpets,false,Hard,509,16,Algorithms,37.2%,2209,false,String;Dynamic Programming;Prefix Sum;,false,false,37.19944979367263,13522,36350
2316,"Count Hills and Valleys in an Array",count-hills-and-valleys-in-an-array,false,Easy,706,98,Algorithms,61.4%,2210,false,Array;,false,false,61.36692381870781,56001,91256
2317,"Count Collisions on a Road",count-collisions-on-a-road,false,Medium,687,234,Algorithms,43.9%,2211,false,String;Stack;Simulation;,false,false,43.913674334737344,31173,70987
2318,"Maximum Points in an Archery Competition",maximum-points-in-an-archery-competition,false,Medium,497,55,Algorithms,50.1%,2212,false,Array;Backtracking;Bit Manipulation;Enumeration;,false,false,50.07201584348556,16687,33326
2319,"Longest Substring of One Repeating Character",longest-substring-of-one-repeating-character,false,Hard,303,84,Algorithms,32.3%,2213,false,Array;String;Segment Tree;Ordered Set;,false,false,32.32510669883095,5226,16167
2354,"Minimum Health to Beat Game",minimum-health-to-beat-game,true,Medium,317,235,Algorithms,57.7%,2214,true,Array;Greedy;,true,false,57.69941015113756,32183,55777
1392,"Find the Difference of Two Arrays",find-the-difference-of-two-arrays,false,Easy,2437,107,Algorithms,80.1%,2215,false,Array;Hash Table;,true,false,80.06640750964752,451889,564393
1355,"Minimum Deletions to Make Array Beautiful",minimum-deletions-to-make-array-beautiful,false,Medium,806,95,Algorithms,48.6%,2216,false,Array;Stack;Greedy;,false,false,48.624952957082925,34885,71743
1375,"Find Palindrome With Fixed Length",find-palindrome-with-fixed-length,false,Medium,636,291,Algorithms,37.3%,2217,false,Array;Math;,false,false,37.32088379402792,24222,64902
1393,"Maximum Value of K Coins From Piles",maximum-value-of-k-coins-from-piles,false,Hard,2350,37,Algorithms,60.5%,2218,false,Array;Dynamic Programming;Prefix Sum;,true,false,60.47886966453741,71483,118195
2369,"Maximum Sum Score of Array",maximum-sum-score-of-array,true,Medium,69,16,Algorithms,62.1%,2219,true,Array;Prefix Sum;,false,false,62.06628689798032,4794,7724
2323,"Minimum Bit Flips to Convert Number",minimum-bit-flips-to-convert-number,false,Easy,1384,31,Algorithms,87.4%,2220,false,Bit Manipulation;,true,false,87.44064608625884,265912,304106
2324,"Find Triangular Sum of an Array",find-triangular-sum-of-an-array,false,Medium,1113,57,Algorithms,78.7%,2221,false,Array;Math;Simulation;Combinatorics;,false,false,78.73524331831699,88437,112322
2325,"Number of Ways to Select Buildings",number-of-ways-to-select-buildings,false,Medium,998,53,Algorithms,50.7%,2222,false,String;Dynamic Programming;Prefix Sum;,false,false,50.744243978838064,41148,81089
2326,"Sum of Scores of Built Strings",sum-of-scores-of-built-strings,false,Hard,274,184,Algorithms,41.0%,2223,false,String;Binary Search;Rolling Hash;Suffix Array;String Matching;Hash Function;,false,false,41.02653176429719,9447,23027
2345,"Minimum Number of Operations to Convert Time",minimum-number-of-operations-to-convert-time,false,Easy,465,37,Algorithms,65.5%,2224,false,String;Greedy;,false,false,65.47131436965059,46353,70799
1354,"Find Players With Zero or One Losses",find-players-with-zero-or-one-losses,false,Medium,2181,155,Algorithms,72.9%,2225,false,Array;Hash Table;Sorting;Counting;,true,false,72.91165480184382,267316,366630
1335,"Maximum Candies Allocated to K Children",maximum-candies-allocated-to-k-children,false,Medium,1182,41,Algorithms,39.1%,2226,false,Array;Binary Search;,false,false,39.093580819798916,50548,129294
1433,"Encrypt and Decrypt Strings",encrypt-and-decrypt-strings,false,Hard,342,77,Algorithms,41.0%,2227,false,Array;Hash Table;String;Design;Trie;,false,false,41.00509415602999,14328,34942
2370,"Users With Two Purchases Within Seven Days",users-with-two-purchases-within-seven-days,true,Medium,63,9,Database,45.4%,2228,true,Database;,false,false,45.39797395079595,9411,20730
1416,"Check if an Array Is Consecutive",check-if-an-array-is-consecutive,true,Easy,85,11,Algorithms,61.8%,2229,true,Array;Hash Table;Sorting;,false,false,61.809701492537314,6626,10720
2371,"The Users That Are Eligible for Discount",the-users-that-are-eligible-for-discount,true,Easy,21,44,Database,50.4%,2230,true,Database;,false,false,50.42372881355932,6069,12036
2327,"Largest Number After Digit Swaps by Parity",largest-number-after-digit-swaps-by-parity,false,Easy,639,301,Algorithms,62.8%,2231,false,Sorting;Heap (Priority Queue);,false,false,62.75795754333193,50906,81116
2328,"Minimize Result by Adding Parentheses to Expression",minimize-result-by-adding-parentheses-to-expression,false,Medium,217,338,Algorithms,68.0%,2232,false,String;Enumeration;,false,false,67.9688886260129,22983,33814
2329,"Maximum Product After K Increments",maximum-product-after-k-increments,false,Medium,752,45,Algorithms,41.8%,2233,false,Array;Greedy;Heap (Priority Queue);,false,false,41.791949987753526,35832,85739
2330,"Maximum Total Beauty of the Gardens",maximum-total-beauty-of-the-gardens,false,Hard,440,39,Algorithms,29.7%,2234,false,Array;Two Pointers;Binary Search;Greedy;Sorting;,false,false,29.70514779885936,7969,26827
2383,"Add Two Integers",add-two-integers,false,Easy,1732,3148,Algorithms,88.1%,2235,false,Math;,false,false,88.05937506213306,620053,704131
2384,"Root Equals Sum of Children",root-equals-sum-of-children,false,Easy,1342,1572,Algorithms,84.9%,2236,false,Tree;Binary Tree;,false,false,84.87634510100057,269750,317816
2385,"Count Positions on Street With Required Brightness",count-positions-on-street-with-required-brightness,true,Medium,83,6,Algorithms,62.7%,2237,true,Array;Prefix Sum;,false,false,62.7093836396162,3856,6149
2376,"Number of Times a Driver Was a Passenger",number-of-times-a-driver-was-a-passenger,true,Medium,68,5,Database,71.7%,2238,true,Database;,false,false,71.72728729370293,8953,12482
2350,"Find Closest Number to Zero",find-closest-number-to-zero,false,Easy,664,49,Algorithms,46.7%,2239,false,Array;,false,false,46.70149847682301,136133,291496
2351,"Number of Ways to Buy Pens and Pencils",number-of-ways-to-buy-pens-and-pencils,false,Medium,456,35,Algorithms,57.1%,2240,false,Math;Enumeration;,false,false,57.096194675812505,31464,55107
2352,"Design an ATM Machine",design-an-atm-machine,false,Medium,275,358,Algorithms,43.3%,2241,false,Array;Greedy;Design;,false,false,43.32935292387034,25037,57783
2353,"Maximum Score of a Node Sequence",maximum-score-of-a-node-sequence,false,Hard,533,17,Algorithms,38.6%,2242,false,Array;Graph;Sorting;Enumeration;,false,false,38.63502009931426,13071,33832
2361,"Calculate Digit Sum of a String",calculate-digit-sum-of-a-string,false,Easy,558,49,Algorithms,66.3%,2243,false,String;Simulation;,false,false,66.30369299355382,44022,66395
2362,"Minimum Rounds to Complete All Tasks",minimum-rounds-to-complete-all-tasks,false,Medium,2797,83,Algorithms,62.9%,2244,false,Array;Hash Table;Greedy;Counting;,true,false,62.93330768552582,157039,249533
2363,"Maximum Trailing Zeros in a Cornered Path",maximum-trailing-zeros-in-a-cornered-path,false,Medium,189,405,Algorithms,36.5%,2245,false,Array;Matrix;Prefix Sum;,false,false,36.451695131277084,8580,23538
2364,"Longest Path With Different Adjacent Characters",longest-path-with-different-adjacent-characters,false,Hard,2413,61,Algorithms,54.1%,2246,false,Array;String;Tree;Depth-First Search;Graph;Topological Sort;,true,false,54.12107101280559,79033,146030
2007,"Maximum Cost of Trip With K Highways",maximum-cost-of-trip-with-k-highways,true,Hard,60,0,Algorithms,50.1%,2247,true,Dynamic Programming;Bit Manipulation;Graph;Bitmask;,false,false,50.08894536213469,1971,3935
2331,"Intersection of Multiple Arrays",intersection-of-multiple-arrays,false,Easy,746,43,Algorithms,68.3%,2248,false,Array;Hash Table;Sorting;Counting;,false,false,68.27115244733515,96674,141603
2332,"Count Lattice Points Inside a Circle",count-lattice-points-inside-a-circle,false,Medium,239,223,Algorithms,54.1%,2249,false,Array;Hash Table;Math;Geometry;Enumeration;,false,false,54.146633416458855,27141,50125
2333,"Count Number of Rectangles Containing Each Point",count-number-of-rectangles-containing-each-point,false,Medium,514,138,Algorithms,35.5%,2250,false,Array;Binary Search;Binary Indexed Tree;Sorting;,false,false,35.49226266761032,18555,52279
2334,"Number of Flowers in Full Bloom",number-of-flowers-in-full-bloom,false,Hard,1712,42,Algorithms,57.0%,2251,false,Array;Hash Table;Binary Search;Sorting;Prefix Sum;Ordered Set;,true,false,56.97809714994438,89120,156414
2381,"Dynamic Pivoting of a Table",dynamic-pivoting-of-a-table,true,Hard,33,10,Database,56.5%,2252,true,Database;,false,false,56.45780051150895,1766,3128
2382,"Dynamic Unpivoting of a Table",dynamic-unpivoting-of-a-table,true,Hard,18,13,Database,67.3%,2253,true,Database;,false,false,67.31588557516737,1106,1643
2396,"Design Video Sharing Platform",design-video-sharing-platform,true,Hard,82,13,Algorithms,63.5%,2254,true,Hash Table;Stack;Design;Ordered Set;,false,false,63.47360367253252,4148,6535
2341,"Count Prefixes of a Given String",count-prefixes-of-a-given-string,false,Easy,558,24,Algorithms,73.2%,2255,false,Array;String;,false,false,73.15471151590563,71725,98046
2342,"Minimum Average Difference",minimum-average-difference,false,Medium,1533,179,Algorithms,43.3%,2256,false,Array;Prefix Sum;,true,false,43.3490989352155,89362,206145
2343,"Count Unguarded Cells in the Grid",count-unguarded-cells-in-the-grid,false,Medium,897,75,Algorithms,66.1%,2257,false,Array;Matrix;Simulation;,true,false,66.07240846054076,105958,160367
2344,"Escape the Spreading Fire",escape-the-spreading-fire,false,Hard,761,36,Algorithms,35.5%,2258,false,Array;Binary Search;Breadth-First Search;Matrix;,false,false,35.5438538752674,12960,36462
2337,"Remove Digit From Number to Maximize Result",remove-digit-from-number-to-maximize-result,false,Easy,865,59,Algorithms,46.5%,2259,false,String;Greedy;Enumeration;,false,false,46.458878504672896,99421,213997
2338,"Minimum Consecutive Cards to Pick Up",minimum-consecutive-cards-to-pick-up,false,Medium,998,41,Algorithms,52.0%,2260,false,Array;Hash Table;Sliding Window;,false,false,51.95086832593812,88397,170155
2339,"K Divisible Elements Subarrays",k-divisible-elements-subarrays,false,Medium,694,157,Algorithms,52.8%,2261,false,Array;Hash Table;Trie;Rolling Hash;Hash Function;Enumeration;,false,false,52.794019888483405,38915,73711
2340,"Total Appeal of A String",total-appeal-of-a-string,false,Hard,1141,32,Algorithms,55.8%,2262,false,Hash Table;String;Dynamic Programming;,false,false,55.81118662720661,37527,67240
1419,"Make Array Non-decreasing or Non-increasing",make-array-non-decreasing-or-non-increasing,true,Hard,87,12,Algorithms,65.7%,2263,true,Dynamic Programming;Greedy;,false,false,65.68157202537522,4245,6463
2346,"Largest 3-Same-Digit Number in String",largest-3-same-digit-number-in-string,false,Easy,1028,49,Algorithms,69.1%,2264,false,String;,true,false,69.05424565457123,157800,228516
2347,"Count Nodes Equal to Average of Subtree",count-nodes-equal-to-average-of-subtree,false,Medium,2229,55,Algorithms,86.4%,2265,false,Tree;Depth-First Search;Binary Tree;,true,false,86.43383766975987,159555,184598
2348,"Count Number of Texts",count-number-of-texts,false,Medium,890,33,Algorithms,48.3%,2266,false,Hash Table;Math;String;Dynamic Programming;,false,false,48.31174258253238,23122,47860
2349," Check if There Is a Valid Parentheses String Path",check-if-there-is-a-valid-parentheses-string-path,false,Hard,519,8,Algorithms,39.3%,2267,false,Array;Dynamic Programming;Matrix;,false,false,39.31902877115015,16987,43203
2405,"Minimum Number of Keypresses",minimum-number-of-keypresses,true,Medium,246,38,Algorithms,71.2%,2268,true,Hash Table;String;Greedy;Sorting;Counting;,false,false,71.1936293603393,32900,46212
1430,"Find the K-Beauty of a Number",find-the-k-beauty-of-a-number,false,Easy,684,45,Algorithms,61.0%,2269,false,Math;String;Sliding Window;,false,false,61.036319612590795,69322,113575
2358,"Number of Ways to Split Array",number-of-ways-to-split-array,false,Medium,1102,91,Algorithms,56.2%,2270,false,Array;Prefix Sum;,true,false,56.17807835470708,194516,346249
2359,"Maximum White Tiles Covered by a Carpet",maximum-white-tiles-covered-by-a-carpet,false,Medium,793,49,Algorithms,34.1%,2271,false,Array;Binary Search;Greedy;Sorting;Prefix Sum;,false,false,34.08078606793982,17828,52310
2360,"Substring With Largest Variance",substring-with-largest-variance,false,Hard,1868,208,Algorithms,46.0%,2272,false,Array;Dynamic Programming;,true,false,46.02759679034503,70784,153785
1353,"Find Resultant Array After Removing Anagrams",find-resultant-array-after-removing-anagrams,false,Easy,694,190,Algorithms,58.8%,2273,false,Array;Hash Table;String;Sorting;,false,false,58.84328484152969,69734,118508
2355,"Maximum Consecutive Floors Without Special Floors",maximum-consecutive-floors-without-special-floors,false,Medium,416,37,Algorithms,51.9%,2274,false,Array;Sorting;,false,false,51.88202704904676,35024,67507
2356,"Largest Combination With Bitwise AND Greater Than Zero",largest-combination-with-bitwise-and-greater-than-zero,false,Medium,1109,58,Algorithms,81.0%,2275,false,Array;Hash Table;Bit Manipulation;Counting;,true,false,81.02646854725897,147123,181574
2357,"Count Integers in Intervals",count-integers-in-intervals,false,Hard,591,60,Algorithms,35.6%,2276,false,Design;Segment Tree;Ordered Set;,false,false,35.56737469283334,21132,59414
2420,"Closest Node to Path in Tree",closest-node-to-path-in-tree,true,Hard,136,3,Algorithms,62.6%,2277,true,Array;Tree;Depth-First Search;Breadth-First Search;,false,false,62.58115958537419,5494,8779
2365,"Percentage of Letter in String",percentage-of-letter-in-string,false,Easy,534,62,Algorithms,74.2%,2278,false,String;,false,false,74.1824548239855,83047,111950
2366,"Maximum Bags With Full Capacity of Rocks",maximum-bags-with-full-capacity-of-rocks,false,Medium,1694,71,Algorithms,67.5%,2279,false,Array;Greedy;Sorting;,true,false,67.48144087811546,99718,147771
2367,"Minimum Lines to Represent a Line Chart",minimum-lines-to-represent-a-line-chart,false,Medium,346,527,Algorithms,25.7%,2280,false,Array;Math;Geometry;Sorting;Number Theory;,false,false,25.68233440797186,28041,109184
2368,"Sum of Total Strength of Wizards",sum-of-total-strength-of-wizards,false,Hard,1213,104,Algorithms,28.1%,2281,false,Array;Stack;Monotonic Stack;Prefix Sum;,true,false,28.144703246313373,21605,76764
2425,"Number of People That Can Be Seen in a Grid",number-of-people-that-can-be-seen-in-a-grid,true,Medium,64,30,Algorithms,47.9%,2282,true,Array;Stack;Matrix;Monotonic Stack;,false,false,47.927927927927925,2128,4440
2377,"Check if Number Has Equal Digit Count and Digit Value",check-if-number-has-equal-digit-count-and-digit-value,false,Easy,625,85,Algorithms,72.4%,2283,false,Hash Table;String;Counting;,false,false,72.41106110456992,65805,90877
2378,"Sender With Largest Word Count",sender-with-largest-word-count,false,Medium,443,40,Algorithms,57.7%,2284,false,Array;Hash Table;String;Counting;,false,false,57.70550568338491,37669,65278
2379,"Maximum Total Importance of Roads",maximum-total-importance-of-roads,false,Medium,1286,79,Algorithms,69.3%,2285,false,Greedy;Graph;Sorting;Heap (Priority Queue);,true,false,69.25684984285174,148299,214129
2380,"Booking Concert Tickets in Groups",booking-concert-tickets-in-groups,false,Hard,335,58,Algorithms,18.3%,2286,false,Binary Search;Design;Binary Indexed Tree;Segment Tree;,false,false,18.294887555137755,7590,41487
2372,"Rearrange Characters to Make Target String",rearrange-characters-to-make-target-string,false,Easy,485,36,Algorithms,59.7%,2287,false,Hash Table;String;Counting;,false,false,59.71406856064577,45569,76312
2373,"Apply Discount to Prices",apply-discount-to-prices,false,Medium,206,1109,Algorithms,31.9%,2288,false,String;,false,false,31.913232520989226,26570,83257
2374,"Steps to Make Array Non-decreasing",steps-to-make-array-non-decreasing,false,Medium,1360,139,Algorithms,22.6%,2289,false,Array;Linked List;Stack;Monotonic Stack;,false,false,22.593502895068717,24544,108633
2375,"Minimum Obstacle Removal to Reach Corner",minimum-obstacle-removal-to-reach-corner,false,Hard,1552,28,Algorithms,70.0%,2290,false,Array;Breadth-First Search;Graph;Heap (Priority Queue);Matrix;Shortest Path;,true,false,69.99698643897538,104522,149323
2426,"Maximum Profit From Trading Stocks",maximum-profit-from-trading-stocks,true,Medium,168,7,Algorithms,45.8%,2291,true,Array;Dynamic Programming;,false,false,45.83813601185576,11135,24292
2431,"Products With Three or More Orders in Two Consecutive Years",products-with-three-or-more-orders-in-two-consecutive-years,true,Medium,61,26,Database,39.9%,2292,true,Database;,false,false,39.911340607950116,8193,20528
2386,"Min Max Game",min-max-game,false,Easy,542,28,Algorithms,63.5%,2293,false,Array;Simulation;,false,false,63.49689631570252,53805,84737
2387,"Partition Array Such That Maximum Difference Is K",partition-array-such-that-maximum-difference-is-k,false,Medium,790,29,Algorithms,74.3%,2294,false,Array;Greedy;Sorting;,false,false,74.27286821705427,47906,64500
2388,"Replace Elements in an Array",replace-elements-in-an-array,false,Medium,648,37,Algorithms,58.5%,2295,false,Array;Hash Table;Simulation;,false,false,58.450568224021396,39346,67315
2389,"Design a Text Editor",design-a-text-editor,false,Hard,590,226,Algorithms,46.7%,2296,false,Linked List;String;Stack;Design;Simulation;Doubly-Linked List;,false,false,46.70022644706189,28663,61380
2056,"Jump Game VIII",jump-game-viii,true,Medium,153,44,Algorithms,45.6%,2297,true,Array;Dynamic Programming;Stack;Graph;Monotonic Stack;Shortest Path;,false,false,45.63927617917532,6154,13484
2440,"Tasks Count in the Weekend",tasks-count-in-the-weekend,true,Medium,51,10,Database,81.8%,2298,true,Database;,false,false,81.82948891904115,7237,8844
2391,"Strong Password Checker II",strong-password-checker-ii,false,Easy,355,41,Algorithms,54.9%,2299,false,String;,false,false,54.918894913986534,46993,85568
2392,"Successful Pairs of Spells and Potions",successful-pairs-of-spells-and-potions,false,Medium,2641,82,Algorithms,44.4%,2300,false,Array;Two Pointers;Binary Search;Sorting;,true,false,44.36762578802296,195088,439708
2393,"Match Substring After Replacement",match-substring-after-replacement,false,Hard,383,78,Algorithms,41.6%,2301,false,Array;Hash Table;String;String Matching;,false,false,41.60291049168049,15552,37382
2394,"Count Subarrays With Score Less Than K",count-subarrays-with-score-less-than-k,false,Hard,1088,30,Algorithms,55.5%,2302,false,Array;Binary Search;Sliding Window;Prefix Sum;,false,false,55.50392321170108,36429,65634
1382,"Calculate Amount Paid in Taxes",calculate-amount-paid-in-taxes,false,Easy,268,284,Algorithms,66.6%,2303,false,Array;Simulation;,false,false,66.5912857607534,42992,64561
1394,"Minimum Path Cost in a Grid",minimum-path-cost-in-a-grid,false,Medium,910,159,Algorithms,67.0%,2304,false,Array;Dynamic Programming;Matrix;,false,false,66.96807455879437,33772,50430
1418,"Fair Distribution of Cookies",fair-distribution-of-cookies,false,Medium,2601,122,Algorithms,69.3%,2305,false,Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,true,false,69.30515134852406,103352,149126
2390,"Naming a Company",naming-a-company,false,Hard,1953,72,Algorithms,46.3%,2306,false,Array;Hash Table;String;Bit Manipulation;Enumeration;,true,false,46.32183908045977,62465,134850
2065,"Check for Contradictions in Equations",check-for-contradictions-in-equations,true,Hard,64,26,Algorithms,43.2%,2307,true,Array;Depth-First Search;Union Find;Graph;,false,false,43.18228843368509,4174,9666
2441,"Arrange Table by Gender",arrange-table-by-gender,true,Medium,84,15,Database,69.8%,2308,true,Database;,false,false,69.7516232093167,6768,9703
1363,"Greatest English Letter in Upper and Lower Case",greatest-english-letter-in-upper-and-lower-case,false,Easy,493,31,Algorithms,70.6%,2309,false,Hash Table;String;Enumeration;,false,false,70.64773549245164,60555,85714
1334,"Sum of Numbers With Units Digit K",sum-of-numbers-with-units-digit-k,false,Medium,411,333,Algorithms,27.0%,2310,false,Math;Dynamic Programming;Greedy;Enumeration;,false,false,27.02353616532721,28245,104520
2395,"Longest Binary Subsequence Less Than or Equal to K",longest-binary-subsequence-less-than-or-equal-to-k,false,Medium,689,50,Algorithms,38.1%,2311,false,String;Dynamic Programming;Greedy;Memoization;,false,false,38.06030573908538,23503,61752
1376,"Selling Pieces of Wood",selling-pieces-of-wood,false,Hard,552,11,Algorithms,51.0%,2312,false,Array;Dynamic Programming;Memoization;,false,false,51.041581570133154,12496,24482
2399,"Minimum Flips in Binary Tree to Get Result",minimum-flips-in-binary-tree-to-get-result,true,Hard,106,1,Algorithms,56.8%,2313,true,Dynamic Programming;Tree;Depth-First Search;Binary Tree;,false,false,56.838691483361536,4031,7092
2446,"The First Day of the Maximum Recorded Degree in Each City",the-first-day-of-the-maximum-recorded-degree-in-each-city,true,Medium,54,2,Database,72.5%,2314,true,Database;,false,false,72.5204329578087,6566,9054
2401,"Count Asterisks",count-asterisks,false,Easy,643,108,Algorithms,82.5%,2315,false,String;,false,false,82.4755165871917,80426,97515
2403,"Count Unreachable Pairs of Nodes in an Undirected Graph",count-unreachable-pairs-of-nodes-in-an-undirected-graph,false,Medium,2090,52,Algorithms,49.2%,2316,false,Depth-First Search;Breadth-First Search;Union Find;Graph;,true,false,49.229412609791986,99374,201859
2402,"Maximum XOR After Operations ",maximum-xor-after-operations,false,Medium,621,169,Algorithms,79.4%,2317,false,Array;Math;Bit Manipulation;,false,false,79.44975383724298,27433,34529
2404,"Number of Distinct Roll Sequences",number-of-distinct-roll-sequences,false,Hard,443,19,Algorithms,57.2%,2318,false,Dynamic Programming;Memoization;,false,false,57.16134598792062,11925,20862
2398,"Check if Matrix Is X-Matrix",check-if-matrix-is-x-matrix,false,Easy,503,23,Algorithms,65.3%,2319,false,Array;Matrix;,false,false,65.3467787114846,58322,89250
2397,"Count Number of Ways to Place Houses",count-number-of-ways-to-place-houses,false,Medium,600,197,Algorithms,42.3%,2320,false,Dynamic Programming;,false,false,42.320401071041985,29714,70210
1348,"Maximum Score Of Spliced Array",maximum-score-of-spliced-array,false,Hard,812,13,Algorithms,57.2%,2321,false,Array;Dynamic Programming;,false,false,57.218509995286546,20637,36067
2400,"Minimum Score After Removals on a Tree",minimum-score-after-removals-on-a-tree,false,Hard,460,18,Algorithms,52.0%,2322,false,Array;Bit Manipulation;Tree;Depth-First Search;,false,false,51.95187340613352,7945,15293
2458,"Find Minimum Time to Finish All Jobs II",find-minimum-time-to-finish-all-jobs-ii,true,Medium,64,18,Algorithms,66.0%,2323,true,Array;Greedy;Sorting;,false,false,65.97132523895635,10215,15484
2451,"Product Sales Analysis IV",product-sales-analysis-iv,true,Medium,52,1,Database,75.0%,2324,true,Database;,false,false,75.00433050407067,8660,11546
2406,"Decode the Message",decode-the-message,false,Easy,1030,104,Algorithms,85.0%,2325,false,Hash Table;String;,false,false,84.98788328734118,121344,142778
2411,"Spiral Matrix IV",spiral-matrix-iv,false,Medium,1228,52,Algorithms,82.3%,2326,false,Array;Linked List;Matrix;Simulation;,true,false,82.29113624103212,163222,198347
2408,"Number of People Aware of a Secret",number-of-people-aware-of-a-secret,false,Medium,866,118,Algorithms,45.9%,2327,false,Dynamic Programming;Queue;Simulation;,false,false,45.861972715536794,26289,57322
2409,"Number of Increasing Paths in a Grid",number-of-increasing-paths-in-a-grid,false,Hard,2022,43,Algorithms,57.9%,2328,false,Array;Dynamic Programming;Depth-First Search;Breadth-First Search;Graph;Topological Sort;Memoization;Matrix;,true,false,57.922009274313034,72322,124861
2452,"Product Sales Analysis V",product-sales-analysis-v,true,Easy,33,7,Database,70.1%,2329,true,Database;,false,false,70.05307679548847,8447,12058
2468,"Valid Palindrome IV",valid-palindrome-iv,true,Medium,106,33,Algorithms,76.0%,2330,true,Two Pointers;String;,false,false,75.96888125238641,15917,20952
2416,"Evaluate Boolean Binary Tree",evaluate-boolean-binary-tree,false,Easy,1462,39,Algorithms,82.7%,2331,false,Tree;Depth-First Search;Binary Tree;,true,false,82.70057277157343,201275,243378
2417,"The Latest Time to Catch a Bus",the-latest-time-to-catch-a-bus,false,Medium,477,753,Algorithms,27.9%,2332,false,Array;Two Pointers;Binary Search;Sorting;,false,false,27.858468035382995,27178,97560
2418,"Minimum Sum of Squared Difference",minimum-sum-of-squared-difference,false,Medium,641,47,Algorithms,25.7%,2333,false,Array;Binary Search;Greedy;Sorting;Heap (Priority Queue);,false,false,25.657689080469225,15595,60781
2419,"Subarray With Elements Greater Than Varying Threshold",subarray-with-elements-greater-than-varying-threshold,false,Hard,575,10,Algorithms,44.5%,2334,false,Array;Stack;Union Find;Monotonic Stack;,false,false,44.485878469250515,14554,32716
2412,"Minimum Amount of Time to Fill Cups",minimum-amount-of-time-to-fill-cups,false,Easy,712,83,Algorithms,58.4%,2335,false,Array;Greedy;Sorting;Heap (Priority Queue);,false,false,58.36135236071714,53288,91307
2413,"Smallest Number in Infinite Set",smallest-number-in-infinite-set,false,Medium,1720,209,Algorithms,71.5%,2336,false,Hash Table;Design;Heap (Priority Queue);Ordered Set;,true,false,71.46847516155675,172194,240937
2414,"Move Pieces to Obtain a String",move-pieces-to-obtain-a-string,false,Medium,1347,79,Algorithms,57.1%,2337,false,Two Pointers;String;,true,false,57.121461010725675,130052,227677
2415,"Count the Number of Ideal Arrays",count-the-number-of-ideal-arrays,false,Hard,496,28,Algorithms,27.1%,2338,false,Math;Dynamic Programming;Combinatorics;Number Theory;,false,false,27.107279693486593,6792,25056
2453,"All the Matches of the League",all-the-matches-of-the-league,true,Easy,43,4,Database,88.2%,2339,true,Database;,false,false,88.1582747665351,9157,10387
2474,"Minimum Adjacent Swaps to Make a Valid Array",minimum-adjacent-swaps-to-make-a-valid-array,true,Medium,189,25,Algorithms,72.6%,2340,true,Array;Greedy;,false,false,72.58359508568248,36511,50302
2421,"Maximum Number of Pairs in Array",maximum-number-of-pairs-in-array,false,Easy,697,17,Algorithms,75.3%,2341,false,Array;Hash Table;Counting;,false,false,75.30404002452094,76161,101138
2473,"Max Sum of a Pair With Equal Sum of Digits",max-sum-of-a-pair-with-equal-sum-of-digits,false,Medium,725,21,Algorithms,55.8%,2342,false,Array;Hash Table;Sorting;Heap (Priority Queue);,false,false,55.77646537418962,54116,97023
2422,"Query Kth Smallest Trimmed Number",query-kth-smallest-trimmed-number,false,Medium,318,434,Algorithms,44.6%,2343,false,Array;String;Divide and Conquer;Sorting;Heap (Priority Queue);Radix Sort;Quickselect;,false,false,44.64825917166272,32470,72724
2423,"Minimum Deletions to Make Array Divisible",minimum-deletions-to-make-array-divisible,false,Hard,556,128,Algorithms,56.5%,2344,false,Array;Math;Sorting;Heap (Priority Queue);Number Theory;,false,false,56.50206753323814,30471,53929
2485,"Finding the Number of Visible Mountains",finding-the-number-of-visible-mountains,true,Medium,168,75,Algorithms,37.3%,2345,true,Array;Stack;Sorting;Monotonic Stack;,false,false,37.256065890034876,10042,26954
2484,"Compute the Rank as a Percentage",compute-the-rank-as-a-percentage,true,Medium,28,74,Database,33.8%,2346,true,Database;,false,false,33.77561900248786,5702,16882
2433,"Best Poker Hand",best-poker-hand,false,Easy,382,40,Algorithms,60.9%,2347,false,Array;Hash Table;Counting;,false,false,60.85786534326784,45005,73951
2432,"Number of Zero-Filled Subarrays",number-of-zero-filled-subarrays,false,Medium,2286,83,Algorithms,66.7%,2348,false,Array;Math;,true,false,66.71398580425873,133468,200060
2434,"Design a Number Container System",design-a-number-container-system,false,Medium,408,31,Algorithms,44.8%,2349,false,Hash Table;Design;Heap (Priority Queue);Ordered Set;,false,false,44.79523266134145,24730,55208
2435,"Shortest Impossible Sequence of Rolls",shortest-impossible-sequence-of-rolls,false,Hard,649,49,Algorithms,68.8%,2350,false,Array;Hash Table;Greedy;,false,false,68.82192234456494,16626,24158
2427,"First Letter to Appear Twice",first-letter-to-appear-twice,false,Easy,1080,61,Algorithms,73.9%,2351,false,Hash Table;String;Bit Manipulation;Counting;,false,false,73.91120855592955,143608,194298
2428,"Equal Row and Column Pairs",equal-row-and-column-pairs,false,Medium,2304,169,Algorithms,70.3%,2352,false,Array;Hash Table;Matrix;Simulation;,true,false,70.30825505400098,283895,403787
2429,"Design a Food Rating System",design-a-food-rating-system,false,Medium,1508,293,Algorithms,45.2%,2353,false,Hash Table;Design;Heap (Priority Queue);Ordered Set;,true,false,45.17620413082326,86966,192504
2430,"Number of Excellent Pairs",number-of-excellent-pairs,false,Hard,600,22,Algorithms,47.7%,2354,false,Array;Hash Table;Binary Search;Bit Manipulation;,false,false,47.71789161098738,16069,33675
2490,"Maximum Number of Books You Can Take",maximum-number-of-books-you-can-take,true,Hard,286,37,Algorithms,39.6%,2355,true,Array;Dynamic Programming;Stack;Monotonic Stack;,true,false,39.63865042922739,11913,30054
2495,"Number of Unique Subjects Taught by Each Teacher",number-of-unique-subjects-taught-by-each-teacher,false,Easy,533,41,Database,89.2%,2356,false,Database;,true,false,89.16018203074911,283694,318185
2436,"Make Array Zero by Subtracting Equal Amounts",make-array-zero-by-subtracting-equal-amounts,false,Easy,1215,57,Algorithms,72.6%,2357,false,Array;Hash Table;Greedy;Sorting;Heap (Priority Queue);Simulation;,false,false,72.58177550125063,127389,175511
2437,"Maximum Number of Groups Entering a Competition",maximum-number-of-groups-entering-a-competition,false,Medium,685,116,Algorithms,68.0%,2358,false,Array;Math;Binary Search;Greedy;,false,false,67.99260415253087,40083,58952
2438,"Find Closest Node to Given Two Nodes",find-closest-node-to-given-two-nodes,false,Medium,1711,411,Algorithms,45.6%,2359,false,Depth-First Search;Graph;,true,false,45.55202939702689,81816,179610
2439,"Longest Cycle in a Graph",longest-cycle-in-a-graph,false,Hard,2380,49,Algorithms,49.7%,2360,false,Depth-First Search;Graph;Topological Sort;,true,false,49.72358591896304,81939,164789
2500,"Minimum Costs Using the Train Line",minimum-costs-using-the-train-line,true,Hard,190,31,Algorithms,78.3%,2361,true,Array;Dynamic Programming;,true,false,78.3132530120482,12740,16268
2501,"Generate the Invoice",generate-the-invoice,true,Hard,33,29,Database,75.2%,2362,true,Database;,false,false,75.18623625399078,4239,5638
2447,"Merge Similar Items",merge-similar-items,false,Easy,575,30,Algorithms,76.1%,2363,false,Array;Hash Table;Sorting;Ordered Set;,false,false,76.09834123222748,64227,84400
2448,"Count Number of Bad Pairs",count-number-of-bad-pairs,false,Medium,1016,27,Algorithms,42.0%,2364,false,Array;Hash Table;Math;Counting;,false,false,42.01074443591711,35581,84695
2483,"Task Scheduler II",task-scheduler-ii,false,Medium,580,66,Algorithms,53.4%,2365,false,Array;Hash Table;Simulation;,false,false,53.35231875874597,43464,81466
2450,"Minimum Replacements to Sort the Array",minimum-replacements-to-sort-the-array,false,Hard,2021,68,Algorithms,53.4%,2366,false,Array;Math;Greedy;,true,false,53.368056362917656,68856,129021
2442,"Number of Arithmetic Triplets",number-of-arithmetic-triplets,false,Easy,1298,86,Algorithms,84.6%,2367,false,Array;Hash Table;Two Pointers;Enumeration;,false,false,84.61121694601255,145235,171650
2445,"Reachable Nodes With Restrictions",reachable-nodes-with-restrictions,false,Medium,726,31,Algorithms,59.3%,2368,false,Array;Hash Table;Tree;Depth-First Search;Breadth-First Search;Union Find;Graph;,true,false,59.27085724780752,64543,108893
2443,"Check if There is a Valid Partition For The Array",check-if-there-is-a-valid-partition-for-the-array,false,Medium,2017,200,Algorithms,51.9%,2369,false,Array;Dynamic Programming;,true,false,51.929982805761476,92116,177385
2444,"Longest Ideal Subsequence",longest-ideal-subsequence,false,Medium,1472,81,Algorithms,47.1%,2370,false,Hash Table;String;Dynamic Programming;,true,false,47.06628518837158,117621,249905
2506,"Minimize Maximum Value in a Grid",minimize-maximum-value-in-a-grid,true,Hard,138,5,Algorithms,71.6%,2371,true,Array;Union Find;Graph;Topological Sort;Sorting;Matrix;,true,false,71.62905579880993,6380,8907
2515,"Calculate the Influence of Each Salesperson",calculate-the-influence-of-each-salesperson,true,Medium,38,4,Database,83.5%,2372,true,Database;,false,false,83.47129506008011,6252,7490
2454,"Largest Local Values in a Matrix",largest-local-values-in-a-matrix,false,Easy,1248,168,Algorithms,87.8%,2373,false,Array;Matrix;,true,false,87.79285268225861,174325,198564
2455,"Node With Highest Edge Score",node-with-highest-edge-score,false,Medium,455,42,Algorithms,48.1%,2374,false,Hash Table;Graph;,false,false,48.09108139819745,37298,77557
2456,"Construct Smallest Number From DI String",construct-smallest-number-from-di-string,false,Medium,966,45,Algorithms,76.3%,2375,false,String;Backtracking;Stack;Greedy;,false,false,76.28368332077316,37453,49097
2457,"Count Special Integers",count-special-integers,false,Hard,588,32,Algorithms,39.6%,2376,false,Math;Dynamic Programming;,false,false,39.626041235895315,13415,33854
2516,"Sort the Olympic Table",sort-the-olympic-table,true,Easy,38,2,Database,79.2%,2377,true,Database;,false,false,79.1685292802861,7084,8948
2517,"Choose Edges to Maximize Score in a Tree",choose-edges-to-maximize-score-in-a-tree,true,Medium,55,12,Algorithms,58.6%,2378,true,Dynamic Programming;Tree;Depth-First Search;,false,false,58.59213250517599,1698,2898
2463,"Minimum Recolors to Get K Consecutive Black Blocks",minimum-recolors-to-get-k-consecutive-black-blocks,false,Easy,757,21,Algorithms,59.5%,2379,false,String;Sliding Window;,false,false,59.54590984974958,62419,104824
2464,"Time Needed to Rearrange a Binary String",time-needed-to-rearrange-a-binary-string,false,Medium,515,113,Algorithms,51.3%,2380,false,String;Dynamic Programming;Simulation;,false,false,51.26388849218817,35895,70021
2465,"Shifting Letters II",shifting-letters-ii,false,Medium,1257,38,Algorithms,48.3%,2381,false,Array;String;Prefix Sum;,true,false,48.511561064490465,73785,152615
2466,"Maximum Segment Sum After Removals",maximum-segment-sum-after-removals,false,Hard,472,6,Algorithms,48.8%,2382,false,Array;Union Find;Prefix Sum;Ordered Set;,false,false,48.841059602649004,10029,20535
2459,"Minimum Hours of Training to Win a Competition",minimum-hours-of-training-to-win-a-competition,false,Easy,354,287,Algorithms,41.6%,2383,false,Array;Greedy;,false,false,41.630533187211135,34948,83948
2475,"Largest Palindromic Number",largest-palindromic-number,false,Medium,628,232,Algorithms,36.1%,2384,false,Hash Table;String;Greedy;Counting;,false,false,36.05141594697731,44874,124471
2461,"Amount of Time for Binary Tree to Be Infected",amount-of-time-for-binary-tree-to-be-infected,false,Medium,2814,68,Algorithms,62.9%,2385,false,Hash Table;Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,62.88613208928684,150300,239004
2462,"Find the K-Sum of an Array",find-the-k-sum-of-an-array,false,Hard,577,20,Algorithms,39.2%,2386,false,Array;Sorting;Heap (Priority Queue);,false,false,39.22809237583043,9920,25288
2522,"Median of a Row Wise Sorted Matrix",median-of-a-row-wise-sorted-matrix,true,Medium,79,9,Algorithms,70.1%,2387,true,Array;Binary Search;Matrix;,false,false,70.09837177747626,4133,5896
2523,"Change Null Values in a Table to the Previous Value",change-null-values-in-a-table-to-the-previous-value,true,Medium,88,29,Database,51.4%,2388,true,Database;,false,false,51.36979527247553,5194,10111
2469,"Longest Subsequence With Limited Sum",longest-subsequence-with-limited-sum,false,Easy,1958,179,Algorithms,72.3%,2389,false,Array;Binary Search;Greedy;Sorting;Prefix Sum;,true,false,72.29906606156906,126493,174958
2470,"Removing Stars From a String",removing-stars-from-a-string,false,Medium,3009,219,Algorithms,76.9%,2390,false,String;Stack;Simulation;,true,false,76.93013161067793,421084,547362
2471,"Minimum Amount of Time to Collect Garbage",minimum-amount-of-time-to-collect-garbage,false,Medium,1554,241,Algorithms,85.2%,2391,false,Array;String;Prefix Sum;,true,false,85.17312652045874,139695,164013
2472,"Build a Matrix With Conditions",build-a-matrix-with-conditions,false,Hard,1384,53,Algorithms,79.5%,2392,false,Array;Graph;Topological Sort;Matrix;,true,false,79.47201263674403,94586,119018
2535,"Count Strictly Increasing Subarrays",count-strictly-increasing-subarrays,true,Medium,138,2,Algorithms,73.6%,2393,true,Array;Math;Dynamic Programming;,true,false,73.58803986710963,7088,9632
2534,"Employees With Deductions",employees-with-deductions,true,Medium,29,37,Database,41.3%,2394,true,Database;,false,false,41.320388349514566,5320,12875
2480,"Find Subarrays With Equal Sum",find-subarrays-with-equal-sum,false,Easy,560,31,Algorithms,65.7%,2395,false,Array;Hash Table;,false,false,65.69240675159821,57134,86972
2481,"Strictly Palindromic Number",strictly-palindromic-number,false,Medium,655,1611,Algorithms,87.9%,2396,false,Math;Two Pointers;Brainteaser;,false,false,87.93364386970926,104581,118932
2482,"Maximum Rows Covered by Columns",maximum-rows-covered-by-columns,false,Medium,272,421,Algorithms,56.2%,2397,false,Array;Backtracking;Bit Manipulation;Matrix;Enumeration;,false,false,56.22172324809813,16776,29839
2449,"Maximum Number of Robots Within Budget",maximum-number-of-robots-within-budget,false,Hard,837,17,Algorithms,35.9%,2398,false,Array;Binary Search;Queue;Sliding Window;Heap (Priority Queue);Prefix Sum;Monotonic Queue;,false,false,35.89094956561962,24829,69179
2476,"Check Distances Between Same Letters",check-distances-between-same-letters,false,Easy,496,64,Algorithms,70.8%,2399,false,Array;Hash Table;String;,false,false,70.78667928297324,53862,76091
2477,"Number of Ways to Reach a Position After Exactly k Steps",number-of-ways-to-reach-a-position-after-exactly-k-steps,false,Medium,804,63,Algorithms,35.6%,2400,false,Math;Dynamic Programming;Combinatorics;,false,false,35.58104642625323,33437,93975
2478,"Longest Nice Subarray",longest-nice-subarray,false,Medium,1349,33,Algorithms,52.1%,2401,false,Array;Bit Manipulation;Sliding Window;,false,false,52.14089648734132,37421,71769
2479,"Meeting Rooms III",meeting-rooms-iii,false,Hard,1798,117,Algorithms,44.1%,2402,false,Array;Hash Table;Sorting;Heap (Priority Queue);Simulation;,true,false,44.08215469482055,129936,294759
2537,"Minimum Time to Kill All Monsters",minimum-time-to-kill-all-monsters,true,Hard,50,4,Algorithms,56.2%,2403,true,Array;Dynamic Programming;Bit Manipulation;Bitmask;,false,false,56.21366279069767,1547,2752
2486,"Most Frequent Even Element",most-frequent-even-element,false,Easy,1018,37,Algorithms,51.1%,2404,false,Array;Hash Table;Counting;,false,false,51.1423475454391,96344,188384
2487,"Optimal Partition of String",optimal-partition-of-string,false,Medium,2695,106,Algorithms,78.0%,2405,false,Hash Table;String;Greedy;,true,false,78.0374711037041,232250,297614
2488,"Divide Intervals Into Minimum Number of Groups",divide-intervals-into-minimum-number-of-groups,false,Medium,1400,39,Algorithms,63.7%,2406,false,Array;Two Pointers;Greedy;Sorting;Heap (Priority Queue);Prefix Sum;,true,false,63.72266931514452,130885,205397
2526,"Longest Increasing Subsequence II",longest-increasing-subsequence-ii,false,Hard,905,38,Algorithms,24.6%,2407,false,Array;Divide and Conquer;Dynamic Programming;Binary Indexed Tree;Segment Tree;Queue;Monotonic Queue;,false,false,24.64419579258931,17818,72301
2555,"Design SQL",design-sql,true,Medium,55,82,Algorithms,78.0%,2408,true,Array;Hash Table;String;Design;,false,false,77.98079175450926,9987,12807
2496,"Count Days Spent Together",count-days-spent-together,false,Easy,264,588,Algorithms,45.8%,2409,false,Math;String;,false,false,45.7895114684662,25513,55718
2497,"Maximum Matching of Players With Trainers",maximum-matching-of-players-with-trainers,false,Medium,528,17,Algorithms,65.2%,2410,false,Array;Two Pointers;Greedy;Sorting;,false,false,65.24747048279336,44044,67503
2498,"Smallest Subarrays With Maximum Bitwise OR",smallest-subarrays-with-maximum-bitwise-or,false,Medium,585,31,Algorithms,44.9%,2411,false,Array;Binary Search;Bit Manipulation;Sliding Window;,false,false,44.8579098398593,14538,32409
2499,"Minimum Money Required Before Transactions",minimum-money-required-before-transactions,false,Hard,406,35,Algorithms,40.7%,2412,false,Array;Greedy;Sorting;,false,false,40.736278921447045,11495,28216
2491,"Smallest Even Multiple",smallest-even-multiple,false,Easy,938,111,Algorithms,87.9%,2413,false,Math;Number Theory;,false,false,87.94972539079004,208177,236700
2492,"Length of the Longest Alphabetical Continuous Substring",length-of-the-longest-alphabetical-continuous-substring,false,Medium,520,31,Algorithms,59.1%,2414,false,String;,false,false,59.1133968429288,51379,86916
2493,"Reverse Odd Levels of Binary Tree",reverse-odd-levels-of-binary-tree,false,Medium,1647,68,Algorithms,86.8%,2415,false,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,86.77705519242735,157586,181599
2494,"Sum of Prefix Scores of Strings",sum-of-prefix-scores-of-strings,false,Hard,1158,109,Algorithms,60.6%,2416,false,Array;String;Trie;Counting;,true,false,60.61558492841477,113593,187399
2560,"Closest Fair Integer",closest-fair-integer,true,Medium,28,12,Algorithms,45.0%,2417,true,Math;Enumeration;,false,false,45.018450184501845,1220,2710
2502,"Sort the People",sort-the-people,false,Easy,1754,35,Algorithms,84.8%,2418,false,Array;Hash Table;String;Sorting;,true,false,84.8465671265539,323111,380818
2503,"Longest Subarray With Maximum Bitwise AND",longest-subarray-with-maximum-bitwise-and,false,Medium,1030,99,Algorithms,61.9%,2419,false,Array;Bit Manipulation;Brainteaser;,true,false,61.85022633419652,152621,246759
2504,"Find All Good Indices",find-all-good-indices,false,Medium,643,37,Algorithms,39.3%,2420,false,Array;Dynamic Programming;Prefix Sum;,false,false,39.282659263149995,26176,66635
2505,"Number of Good Paths",number-of-good-paths,false,Hard,2289,107,Algorithms,56.1%,2421,false,Array;Hash Table;Tree;Union Find;Graph;Sorting;,true,false,56.098936282052506,58698,104633
2565,"Merge Operations to Turn Array Into a Palindrome",merge-operations-to-turn-array-into-a-palindrome,true,Medium,143,16,Algorithms,69.1%,2422,true,Array;Two Pointers;Greedy;,false,false,69.10597470562581,15846,22930
2532,"Remove Letter To Equalize Frequency",remove-letter-to-equalize-frequency,false,Easy,703,1270,Algorithms,17.6%,2423,false,Hash Table;String;Counting;,false,false,17.62782022127399,55191,313088
2512,"Longest Uploaded Prefix",longest-uploaded-prefix,false,Medium,368,31,Algorithms,56.0%,2424,false,Binary Search;Union Find;Design;Binary Indexed Tree;Segment Tree;Heap (Priority Queue);Ordered Set;,false,false,55.97111913357401,23256,41550
2533,"Bitwise XOR of All Pairings",bitwise-xor-of-all-pairings,false,Medium,414,13,Algorithms,58.1%,2425,false,Array;Bit Manipulation;Brainteaser;,true,false,58.062672140518636,22346,38486
2513,"Number of Pairs Satisfying Inequality",number-of-pairs-satisfying-inequality,false,Hard,543,10,Algorithms,44.4%,2426,false,Array;Binary Search;Divide and Conquer;Binary Indexed Tree;Segment Tree;Merge Sort;Ordered Set;,false,false,44.435638735635685,14578,32807
2507,"Number of Common Factors",number-of-common-factors,false,Easy,600,10,Algorithms,79.4%,2427,false,Math;Enumeration;Number Theory;,false,false,79.40985029290518,106140,133661
2508,"Maximum Sum of an Hourglass",maximum-sum-of-an-hourglass,false,Medium,466,64,Algorithms,75.6%,2428,false,Array;Matrix;Prefix Sum;,false,false,75.64841498559078,44100,58296
2509,"Minimize XOR",minimize-xor,false,Medium,495,22,Algorithms,44.6%,2429,false,Greedy;Bit Manipulation;,false,false,44.61262282690854,23609,52920
2510,"Maximum Deletions on a String",maximum-deletions-on-a-string,false,Hard,492,58,Algorithms,34.0%,2430,false,String;Dynamic Programming;Rolling Hash;String Matching;Hash Function;,false,false,33.97672636053237,14628,43053
2570,"Maximize Total Tastiness of Purchased Fruits",maximize-total-tastiness-of-purchased-fruits,true,Medium,48,1,Algorithms,64.0%,2431,true,Array;Dynamic Programming;,false,false,64.0373750543242,2947,4602
2518,"The Employee That Worked on the Longest Task",the-employee-that-worked-on-the-longest-task,false,Easy,282,68,Algorithms,50.4%,2432,false,Array;,false,false,50.42005636199287,37930,75228
2519,"Find The Original Array of Prefix Xor",find-the-original-array-of-prefix-xor,false,Medium,1419,87,Algorithms,88.0%,2433,false,Array;Bit Manipulation;,true,false,88.02769306849089,160206,181995
2520,"Using a Robot to Print the Lexicographically Smallest String",using-a-robot-to-print-the-lexicographically-smallest-string,false,Medium,659,196,Algorithms,40.9%,2434,false,Hash Table;String;Stack;Greedy;,false,false,40.914060364687046,20957,51222
2521,"Paths in Matrix Whose Sum Is Divisible by K",paths-in-matrix-whose-sum-is-divisible-by-k,false,Hard,922,34,Algorithms,43.4%,2435,false,Array;Dynamic Programming;Matrix;,false,false,43.42111965768428,25572,58893
2579,"Minimum Split Into Subarrays With GCD Greater Than One",minimum-split-into-subarrays-with-gcd-greater-than-one,true,Medium,43,11,Algorithms,70.8%,2436,true,Array;Math;Dynamic Programming;Greedy;Number Theory;,false,false,70.81930415263749,2524,3564
2528,"Number of Valid Clock Times",number-of-valid-clock-times,false,Easy,295,242,Algorithms,47.2%,2437,false,String;Enumeration;,false,false,47.169340759830405,34044,72174
2529,"Range Product Queries of Powers",range-product-queries-of-powers,false,Medium,298,54,Algorithms,41.2%,2438,false,Array;Bit Manipulation;Prefix Sum;,false,false,41.23384937725527,17712,42955
2530,"Minimize Maximum of Array",minimize-maximum-of-array,false,Medium,2458,627,Algorithms,46.4%,2439,false,Array;Binary Search;Dynamic Programming;Greedy;Prefix Sum;,true,false,46.40176270680062,86975,187439
2531,"Create Components With Same Value",create-components-with-same-value,false,Hard,412,6,Algorithms,53.3%,2440,false,Array;Math;Tree;Depth-First Search;Enumeration;,false,false,53.32601394988375,8257,15484
2524,"Largest Positive Integer That Exists With Its Negative",largest-positive-integer-that-exists-with-its-negative,false,Easy,1016,24,Algorithms,74.9%,2441,false,Array;Hash Table;Two Pointers;Sorting;,true,false,74.92643308974688,236541,315698
2525,"Count Number of Distinct Integers After Reverse Operations",count-number-of-distinct-integers-after-reverse-operations,false,Medium,656,58,Algorithms,80.0%,2442,false,Array;Hash Table;Math;Counting;,false,false,80.04479695294155,73974,92416
2541,"Sum of Number and Its Reverse",sum-of-number-and-its-reverse,false,Medium,268,303,Algorithms,47.8%,2443,false,Math;Enumeration;,false,false,47.80944695107785,39100,81783
2527,"Count Subarrays With Fixed Bounds",count-subarrays-with-fixed-bounds,false,Hard,3218,82,Algorithms,67.8%,2444,false,Array;Queue;Sliding Window;Monotonic Queue;,true,false,67.7727809371029,150400,221918
2584,"Number of Nodes With Value One",number-of-nodes-with-value-one,true,Medium,76,9,Algorithms,67.8%,2445,true,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,false,false,67.76491540516474,2283,3369
2536,"Determine if Two Events Have Conflict",determine-if-two-events-have-conflict,false,Easy,487,68,Algorithms,51.9%,2446,false,Array;String;,false,false,51.86814945195616,51864,99992
2546,"Number of Subarrays With GCD Equal to K",number-of-subarrays-with-gcd-equal-to-k,false,Medium,452,70,Algorithms,50.6%,2447,false,Array;Math;Number Theory;,false,false,50.61863238374904,28270,55849
2538,"Minimum Cost to Make Array Equal",minimum-cost-to-make-array-equal,false,Hard,2420,36,Algorithms,46.1%,2448,false,Array;Binary Search;Greedy;Sorting;Prefix Sum;,true,false,46.12624487404804,69289,150216
2539,"Minimum Number of Operations to Make Arrays Similar",minimum-number-of-operations-to-make-arrays-similar,false,Hard,433,13,Algorithms,61.8%,2449,false,Array;Greedy;Sorting;,false,false,61.81554931554931,14089,22792
2593,"Number of Distinct Binary Strings After Applying Operations",number-of-distinct-binary-strings-after-applying-operations,true,Medium,37,8,Algorithms,64.3%,2450,true,Math;String;,false,false,64.27771556550952,1148,1786
2547,"Odd String Difference",odd-string-difference,false,Easy,411,118,Algorithms,60.3%,2451,false,Array;Hash Table;String;,false,false,60.27026555161758,34521,57277
2550,"Words Within Two Edits of Dictionary",words-within-two-edits-of-dictionary,false,Medium,302,21,Algorithms,61.0%,2452,false,Array;String;,false,false,61.01277780539949,24543,40226
2548,"Destroy Sequential Targets",destroy-sequential-targets,false,Medium,577,29,Algorithms,40.0%,2453,false,Array;Hash Table;Counting;,false,false,40.014397367338546,19455,48620
2549,"Next Greater Element IV",next-greater-element-iv,false,Hard,681,10,Algorithms,39.1%,2454,false,Array;Binary Search;Stack;Sorting;Heap (Priority Queue);Monotonic Stack;,false,false,39.11799684998875,12170,31111
2542,"Average Value of Even Numbers That Are Divisible by Three",average-value-of-even-numbers-that-are-divisible-by-three,false,Easy,347,39,Algorithms,61.2%,2455,false,Array;Math;,false,false,61.16131478455552,67749,110771
2543,"Most Popular Video Creator",most-popular-video-creator,false,Medium,278,372,Algorithms,44.2%,2456,false,Array;Hash Table;String;Sorting;Heap (Priority Queue);,false,false,44.23316090193039,24541,55481
2544,"Minimum Addition to Make Integer Beautiful",minimum-addition-to-make-integer-beautiful,false,Medium,528,26,Algorithms,37.9%,2457,false,Math;Greedy;,false,false,37.856753477412205,21528,56867
2545,"Height of Binary Tree After Subtree Removal Queries",height-of-binary-tree-after-subtree-removal-queries,false,Hard,1472,34,Algorithms,55.0%,2458,false,Array;Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,55.01795901119797,98952,179854
2489,"Sort Array by Moving Items to Empty Space",sort-array-by-moving-items-to-empty-space,true,Hard,58,1,Algorithms,45.3%,2459,true,Array;Greedy;Sorting;,false,false,45.27280299875052,2174,4802
2551,"Apply Operations to an Array",apply-operations-to-an-array,false,Easy,583,32,Algorithms,68.4%,2460,false,Array;Two Pointers;Simulation;,false,false,68.35472516055067,76316,111647
2552,"Maximum Sum of Distinct Subarrays With Length K",maximum-sum-of-distinct-subarrays-with-length-k,false,Medium,1955,45,Algorithms,42.8%,2461,false,Array;Hash Table;Sliding Window;,true,false,42.83065541771291,183877,429304
2553,"Total Cost to Hire K Workers",total-cost-to-hire-k-workers,false,Medium,1946,648,Algorithms,42.8%,2462,false,Array;Two Pointers;Heap (Priority Queue);Simulation;,true,false,42.77524402199395,120426,281532
2554,"Minimum Total Distance Traveled",minimum-total-distance-traveled,false,Hard,936,33,Algorithms,59.1%,2463,false,Array;Dynamic Programming;Sorting;,true,false,59.14046310478421,72204,122089
2607,"Minimum Subarrays in a Valid Split",minimum-subarrays-in-a-valid-split,true,Medium,29,7,Algorithms,54.3%,2464,true,Array;Math;Dynamic Programming;Number Theory;,false,false,54.33235663457514,1298,2389
2561,"Number of Distinct Averages",number-of-distinct-averages,false,Easy,385,29,Algorithms,58.4%,2465,false,Array;Hash Table;Two Pointers;Sorting;,false,false,58.411236107652954,51609,88355
2562,"Count Ways To Build Good Strings",count-ways-to-build-good-strings,false,Medium,2130,203,Algorithms,59.4%,2466,false,Dynamic Programming;,true,false,59.447547901585516,161862,272277
2564,"Most Profitable Path in a Tree",most-profitable-path-in-a-tree,false,Medium,735,72,Algorithms,49.6%,2467,false,Array;Tree;Depth-First Search;Breadth-First Search;Graph;,false,false,49.64527027027027,14695,29600
2563,"Split Message Based on Limit",split-message-based-on-limit,false,Hard,180,181,Algorithms,43.4%,2468,false,String;Binary Search;,false,false,43.366297016119816,15173,34988
2556,"Convert the Temperature",convert-the-temperature,false,Easy,649,351,Algorithms,89.9%,2469,false,Math;,false,false,89.90654661094392,221364,246213
2557,"Number of Subarrays With LCM Equal to K",number-of-subarrays-with-lcm-equal-to-k,false,Medium,364,39,Algorithms,39.3%,2470,false,Array;Math;Number Theory;,false,false,39.321861518019716,23971,60961
2558,"Minimum Number of Operations to Sort a Binary Tree by Level",minimum-number-of-operations-to-sort-a-binary-tree-by-level,false,Medium,1166,43,Algorithms,74.5%,2471,false,Tree;Breadth-First Search;Binary Tree;,true,false,74.49960802928632,103585,139041
2559,"Maximum Number of Non-overlapping Palindrome Substrings",maximum-number-of-non-overlapping-palindrome-substrings,false,Hard,473,9,Algorithms,41.0%,2472,false,Two Pointers;String;Dynamic Programming;Greedy;,false,false,41.02959096866162,17845,43493
2612,"Minimum Cost to Buy Apples",minimum-cost-to-buy-apples,true,Medium,113,26,Algorithms,67.3%,2473,true,Array;Graph;Heap (Priority Queue);Shortest Path;,true,false,67.34965679745928,6574,9761
2613,"Customers With Strictly Increasing Purchases",customers-with-strictly-increasing-purchases,true,Hard,42,6,Database,46.6%,2474,true,Database;,false,false,46.55699177438308,3962,8510
2566,"Number of Unequal Triplets in Array",number-of-unequal-triplets-in-array,false,Easy,417,46,Algorithms,71.8%,2475,false,Array;Hash Table;Sorting;,false,false,71.83768713255348,47409,65995
2567,"Closest Nodes Queries in a Binary Search Tree",closest-nodes-queries-in-a-binary-search-tree,false,Medium,464,130,Algorithms,41.7%,2476,false,Array;Binary Search;Tree;Depth-First Search;Binary Search Tree;Binary Tree;,false,false,41.71887476199251,27169,65124
2568,"Minimum Fuel Cost to Report to the Capital",minimum-fuel-cost-to-report-to-the-capital,false,Medium,2238,90,Algorithms,64.2%,2477,false,Tree;Depth-First Search;Breadth-First Search;Graph;,true,false,64.20210337729007,74538,116099
2569,"Number of Beautiful Partitions",number-of-beautiful-partitions,false,Hard,349,18,Algorithms,32.0%,2478,false,String;Dynamic Programming;,false,false,32.01098565761367,11539,36047
2623,"Maximum XOR of Two Non-Overlapping Subtrees",maximum-xor-of-two-non-overlapping-subtrees,true,Hard,32,4,Algorithms,48.1%,2479,true,Tree;Depth-First Search;Graph;Trie;,false,false,48.123765635286375,731,1519
2622,"Form a Chemical Bond",form-a-chemical-bond,true,Easy,28,10,Database,77.4%,2480,true,Database;,false,false,77.44596131968146,5446,7032
2575,"Minimum Cuts to Divide a Circle",minimum-cuts-to-divide-a-circle,false,Easy,241,54,Algorithms,54.5%,2481,false,Math;Geometry;,false,false,54.53532962930151,43090,79013
2606,"Difference Between Ones and Zeros in Row and Column",difference-between-ones-and-zeros-in-row-and-column,false,Medium,1184,83,Algorithms,84.3%,2482,false,Array;Matrix;Simulation;,true,false,84.33557435584007,131087,155435
2576,"Minimum Penalty for a Shop",minimum-penalty-for-a-shop,false,Medium,1976,103,Algorithms,67.4%,2483,false,String;Prefix Sum;,true,true,67.43913681244456,116316,172476
2577,"Count Palindromic Subsequences",count-palindromic-subsequences,false,Hard,530,29,Algorithms,38.3%,2484,false,String;Dynamic Programming;,false,false,38.33960889104822,12626,32932
2571,"Find the Pivot Integer",find-the-pivot-integer,false,Easy,1320,57,Algorithms,83.8%,2485,false,Math;Prefix Sum;,true,false,83.80752620991274,244133,291302
2572,"Append Characters to String to Make Subsequence",append-characters-to-string-to-make-subsequence,false,Medium,1114,87,Algorithms,73.0%,2486,false,Two Pointers;String;Greedy;,true,false,72.96730445556562,195521,267957
2573,"Remove Nodes From Linked List",remove-nodes-from-linked-list,false,Medium,2185,78,Algorithms,74.4%,2487,false,Linked List;Stack;Recursion;Monotonic Stack;,true,false,74.41218999905007,211504,284232
2574,"Count Subarrays With Median K",count-subarrays-with-median-k,false,Hard,586,15,Algorithms,44.8%,2488,false,Array;Hash Table;Prefix Sum;,false,false,44.81849458216778,13939,31101
2629,"Number of Substrings With Fixed Ratio",number-of-substrings-with-fixed-ratio,true,Medium,48,2,Algorithms,55.9%,2489,true,Hash Table;Math;String;Prefix Sum;,false,false,55.895196506550214,1280,2290
2580,"Circular Sentence",circular-sentence,false,Easy,738,26,Algorithms,70.7%,2490,false,String;,true,false,70.74977866086765,173406,245098
2581,"Divide Players Into Teams of Equal Skill",divide-players-into-teams-of-equal-skill,false,Medium,1024,34,Algorithms,69.0%,2491,false,Array;Hash Table;Two Pointers;Sorting;,true,false,68.97241436786399,182072,263978
2582,"Minimum Score of a Path Between Two Cities",minimum-score-of-a-path-between-two-cities,false,Medium,1808,308,Algorithms,57.5%,2492,false,Depth-First Search;Breadth-First Search;Union Find;Graph;,true,false,57.51944330740892,91338,158795
2583,"Divide Nodes Into the Maximum Number of Groups",divide-nodes-into-the-maximum-number-of-groups,false,Hard,442,23,Algorithms,40.4%,2493,false,Breadth-First Search;Union Find;Graph;,false,false,40.436840471756675,10423,25776
2637,"Merge Overlapping Events in the Same Hall",merge-overlapping-events-in-the-same-hall,true,Hard,50,6,Database,33.3%,2494,true,Database;,false,false,33.34357241591153,2171,6511
2638,"Number of Subarrays Having Even Product",number-of-subarrays-having-even-product,true,Medium,49,4,Algorithms,62.4%,2495,true,Array;Math;Dynamic Programming;,false,false,62.412640534791855,2054,3291
2589,"Maximum Value of a String in an Array",maximum-value-of-a-string-in-an-array,false,Easy,406,22,Algorithms,72.9%,2496,false,Array;String;,false,false,72.88569235580067,51277,70353
2590,"Maximum Star Sum of a Graph",maximum-star-sum-of-a-graph,false,Medium,417,55,Algorithms,40.3%,2497,false,Array;Greedy;Graph;Sorting;Heap (Priority Queue);,false,false,40.25868076210548,23687,58837
2591,"Frog Jump II",frog-jump-ii,false,Medium,744,108,Algorithms,62.2%,2498,false,Array;Binary Search;Greedy;,false,false,62.15003365660293,24929,40111
2592,"Minimum Total Cost to Make Arrays Unequal",minimum-total-cost-to-make-arrays-unequal,false,Hard,230,12,Algorithms,42.1%,2499,false,Array;Hash Table;Greedy;Counting;,false,false,42.0607393621521,4972,11821
2585,"Delete Greatest Value in Each Row",delete-greatest-value-in-each-row,false,Easy,650,49,Algorithms,78.6%,2500,false,Array;Sorting;Heap (Priority Queue);Matrix;Simulation;,false,false,78.56941928369696,69827,88873
2586,"Longest Square Streak in an Array",longest-square-streak-in-an-array,false,Medium,982,32,Algorithms,53.1%,2501,false,Array;Hash Table;Binary Search;Dynamic Programming;Sorting;,true,false,53.09206244178897,147640,278082
2587,"Design Memory Allocator",design-memory-allocator,false,Medium,297,90,Algorithms,53.5%,2502,false,Array;Hash Table;Design;Simulation;,false,false,53.449299300591015,20710,38746
2588,"Maximum Number of Points From Grid Queries",maximum-number-of-points-from-grid-queries,false,Hard,484,20,Algorithms,38.9%,2503,false,Array;Two Pointers;Breadth-First Search;Union Find;Sorting;Heap (Priority Queue);Matrix;,false,false,38.86729198616214,10898,28039
2643,"Concatenate the Name and the Profession",concatenate-the-name-and-the-profession,true,Easy,30,4,Database,77.4%,2504,true,Database;,false,false,77.3514481934906,5181,6698
2644,"Bitwise OR of All Subsequence Sums",bitwise-or-of-all-subsequence-sums,true,Medium,53,17,Algorithms,66.4%,2505,true,Array;Math;Bit Manipulation;Brainteaser;,false,false,66.36726546906188,3990,6012
2594,"Count Pairs Of Similar Strings",count-pairs-of-similar-strings,false,Easy,539,39,Algorithms,71.7%,2506,false,Array;Hash Table;String;Bit Manipulation;Counting;,false,false,71.69823468060724,55682,77662
2595,"Smallest Value After Replacing With Sum of Prime Factors",smallest-value-after-replacing-with-sum-of-prime-factors,false,Medium,401,25,Algorithms,49.0%,2507,false,Math;Simulation;Number Theory;,false,false,49.04396048755127,25470,51933
2596,"Add Edges to Make Degrees of All Nodes Even",add-edges-to-make-degrees-of-all-nodes-even,false,Hard,341,57,Algorithms,33.2%,2508,false,Hash Table;Graph;,false,false,33.16175688610018,15591,47015
2597,"Cycle Length Queries in a Tree",cycle-length-queries-in-a-tree,false,Hard,361,30,Algorithms,57.2%,2509,false,Array;Tree;Binary Tree;,false,false,57.159469726335374,14746,25798
2653,"Check if There is a Path With Equal Number of 0's And 1's",check-if-there-is-a-path-with-equal-number-of-0s-and-1s,true,Medium,98,4,Algorithms,50.7%,2510,true,Array;Dynamic Programming;Matrix;,false,false,50.685832393836904,5395,10644
2602,"Maximum Enemy Forts That Can Be Captured",maximum-enemy-forts-that-can-be-captured,false,Easy,288,286,Algorithms,39.2%,2511,false,Array;Two Pointers;,false,false,39.15670640944395,26569,67853
2603,"Reward Top K Students",reward-top-k-students,false,Medium,340,84,Algorithms,45.5%,2512,false,Array;Hash Table;String;Sorting;Heap (Priority Queue);,false,false,45.50011841793637,23053,50666
2628,"Minimize the Maximum of Two Arrays",minimize-the-maximum-of-two-arrays,false,Medium,487,98,Algorithms,30.8%,2513,false,Math;Binary Search;Number Theory;,false,false,30.758825326177075,14098,45834
2605,"Count Anagrams",count-anagrams,false,Hard,430,36,Algorithms,34.3%,2514,false,Hash Table;Math;String;Combinatorics;Counting;,false,false,34.30140900581338,13924,40595
2598,"Shortest Distance to Target String in a Circular Array",shortest-distance-to-target-string-in-a-circular-array,false,Easy,353,23,Algorithms,50.3%,2515,false,Array;String;,false,false,50.346427190817444,33862,67257
2599,"Take K of Each Character From Left and Right",take-k-of-each-character-from-left-and-right,false,Medium,1412,158,Algorithms,51.9%,2516,false,Hash Table;String;Sliding Window;,true,false,51.885031913520805,104539,201482
2600,"Maximum Tastiness of Candy Basket",maximum-tastiness-of-candy-basket,false,Medium,938,157,Algorithms,64.9%,2517,false,Array;Binary Search;Greedy;Sorting;,false,false,64.91574313040837,25656,39522
2601,"Number of Great Partitions",number-of-great-partitions,false,Hard,443,10,Algorithms,32.3%,2518,false,Array;Dynamic Programming;,false,false,32.25927196731027,10342,32059
2658,"Count the Number of K-Big Indices",count-the-number-of-k-big-indices,true,Hard,107,21,Algorithms,53.2%,2519,true,Array;Binary Search;Divide and Conquer;Binary Indexed Tree;Segment Tree;Merge Sort;Ordered Set;,false,false,53.154584154012326,8366,15739
2608,"Count the Digits That Divide a Number",count-the-digits-that-divide-a-number,false,Easy,548,33,Algorithms,85.3%,2520,false,Math;,false,false,85.33356718113183,102175,119736
2609,"Distinct Prime Factors of Product of Array",distinct-prime-factors-of-product-of-array,false,Medium,484,10,Algorithms,52.2%,2521,false,Array;Hash Table;Math;Number Theory;,false,false,52.21240248108836,35270,67551
2511,"Partition String Into Substrings With Values at Most K",partition-string-into-substrings-with-values-at-most-k,false,Medium,378,51,Algorithms,46.6%,2522,false,String;Dynamic Programming;Greedy;,false,false,46.60399814415105,23103,49573
2610,"Closest Prime Numbers in Range",closest-prime-numbers-in-range,false,Medium,375,29,Algorithms,38.9%,2523,false,Math;Number Theory;,false,false,38.92119822841052,27506,70671
2667,"Maximum Frequency Score of a Subarray",maximum-frequency-score-of-a-subarray,true,Hard,25,6,Algorithms,37.2%,2524,true,Array;Hash Table;Math;Stack;Sliding Window;,false,false,37.16651333946642,1212,3261
2619,"Categorize Box According to Criteria",categorize-box-according-to-criteria,false,Easy,206,60,Algorithms,36.8%,2525,false,Math;,false,false,36.77040722135313,37843,102917
2620,"Find Consecutive Integers from a Data Stream",find-consecutive-integers-from-a-data-stream,false,Medium,322,34,Algorithms,49.9%,2526,false,Hash Table;Design;Queue;Counting;Data Stream;,false,false,49.90141478432322,28852,57818
2621,"Find Xor-Beauty of Array",find-xor-beauty-of-array,false,Medium,367,53,Algorithms,68.9%,2527,false,Array;Math;Bit Manipulation;,false,false,68.86338867876147,21484,31198
2618,"Maximize the Minimum Powered City",maximize-the-minimum-powered-city,false,Hard,470,10,Algorithms,32.7%,2528,false,Array;Binary Search;Greedy;Queue;Sliding Window;Prefix Sum;,false,false,32.660902977905856,7818,23940
2614,"Maximum Count of Positive Integer and Negative Integer",maximum-count-of-positive-integer-and-negative-integer,false,Easy,966,59,Algorithms,70.9%,2529,false,Array;Binary Search;Counting;,false,false,70.8554892185451,128055,180726
2616,"Maximal Score After Applying K Operations",maximal-score-after-applying-k-operations,false,Medium,840,52,Algorithms,63.8%,2530,false,Array;Greedy;Heap (Priority Queue);,true,false,63.802864924251665,151572,237563
2615,"Make Number of Distinct Characters Equal",make-number-of-distinct-characters-equal,false,Medium,578,152,Algorithms,26.7%,2531,false,Hash Table;String;Counting;,false,false,26.698703179514187,20279,75955
2642,"Time to Cross a Bridge",time-to-cross-a-bridge,false,Hard,116,221,Algorithms,43.4%,2532,false,Array;Heap (Priority Queue);Simulation;,false,false,43.36324546644232,4639,10698
2672,"Number of Good Binary Strings",number-of-good-binary-strings,true,Medium,54,22,Algorithms,52.1%,2533,true,Dynamic Programming;,false,false,52.088647959183675,6534,12544
2617,"Time Taken to Cross the Door",time-taken-to-cross-the-door,true,Hard,97,20,Algorithms,49.2%,2534,true,Array;Queue;Simulation;,false,false,49.18139815186822,9793,19912
2624,"Difference Between Element Sum and Digit Sum of an Array",difference-between-element-sum-and-digit-sum-of-an-array,false,Easy,720,20,Algorithms,84.8%,2535,false,Array;Math;,false,false,84.79995824005012,146205,172412
2625,"Increment Submatrices by One",increment-submatrices-by-one,false,Medium,469,60,Algorithms,50.9%,2536,false,Array;Matrix;Prefix Sum;,false,false,50.87285717495338,22643,44509
2626,"Count the Number of Good Subarrays",count-the-number-of-good-subarrays,false,Medium,901,29,Algorithms,52.4%,2537,false,Array;Hash Table;Sliding Window;,false,false,52.3864461821134,24520,46806
2627,"Difference Between Maximum and Minimum Price Sum",difference-between-maximum-and-minimum-price-sum,false,Hard,444,17,Algorithms,32.1%,2538,false,Array;Dynamic Programming;Tree;Depth-First Search;,false,false,32.105618483234565,8560,26662
2683,"Count the Number of Good Subsequences",count-the-number-of-good-subsequences,true,Medium,33,72,Algorithms,52.5%,2539,true,Hash Table;Math;String;Combinatorics;Counting;,false,false,52.471629159453734,2728,5199
2634,"Minimum Common Value",minimum-common-value,false,Easy,1158,39,Algorithms,58.4%,2540,false,Array;Hash Table;Two Pointers;Binary Search;,true,false,58.43764025332868,257807,441166
2604,"Minimum Operations to Make Array Equal II",minimum-operations-to-make-array-equal-ii,false,Medium,421,26,Algorithms,32.0%,2541,false,Array;Math;Greedy;,false,false,32.03817945934497,24201,75538
2636,"Maximum Subsequence Score",maximum-subsequence-score,false,Medium,2875,179,Algorithms,53.9%,2542,false,Array;Greedy;Sorting;Heap (Priority Queue);,true,false,53.931535421011944,110925,205680
2635,"Check if Point Is Reachable",check-if-point-is-reachable,false,Hard,251,51,Algorithms,43.4%,2543,false,Math;Number Theory;,false,false,43.42817761149946,8822,20314
2630,"Alternating Digit Sum",alternating-digit-sum,false,Easy,416,21,Algorithms,68.5%,2544,false,Math;,false,false,68.49913158627042,71385,104213
2631,"Sort the Students by Their Kth Score",sort-the-students-by-their-kth-score,false,Medium,684,49,Algorithms,85.6%,2545,false,Array;Sorting;Matrix;,false,false,85.59247633822804,71171,83151
2632,"Apply Bitwise Operations to Make Strings Equal",apply-bitwise-operations-to-make-strings-equal,false,Medium,253,100,Algorithms,41.6%,2546,false,String;Bit Manipulation;,false,false,41.62805676175438,20036,48131
2633,"Minimum Cost to Split an Array",minimum-cost-to-split-an-array,false,Hard,439,27,Algorithms,41.5%,2547,false,Array;Hash Table;Dynamic Programming;Counting;,false,false,41.50364284607038,13387,32255
2693,"Maximum Price to Fill a Bag",maximum-price-to-fill-a-bag,true,Medium,40,9,Algorithms,66.8%,2548,true,Array;Greedy;Sorting;,false,false,66.84782608695652,1599,2392
2679,"Count Distinct Numbers on Board",count-distinct-numbers-on-board,false,Easy,279,279,Algorithms,61.0%,2549,false,Array;Hash Table;Math;Simulation;,false,false,61.0491438399474,48274,79074
2680,"Count Collisions of Monkeys on a Polygon",count-collisions-of-monkeys-on-a-polygon,false,Medium,250,521,Algorithms,28.3%,2550,false,Math;Recursion;,false,false,28.34310813212481,22327,78774
2681,"Put Marbles in Bags",put-marbles-in-bags,false,Hard,2055,89,Algorithms,66.2%,2551,false,Array;Greedy;Sorting;Heap (Priority Queue);,true,false,66.2313165297005,60042,90655
2682,"Count Increasing Quadruplets",count-increasing-quadruplets,false,Hard,385,69,Algorithms,33.4%,2552,false,Array;Dynamic Programming;Binary Indexed Tree;Enumeration;Prefix Sum;,false,false,33.36763143919278,10048,30123
2639,"Separate the Digits in an Array",separate-the-digits-in-an-array,false,Easy,504,12,Algorithms,79.9%,2553,false,Array;Simulation;,false,false,79.91239351363896,82642,103416
2640,"Maximum Number of Integers to Choose From a Range I",maximum-number-of-integers-to-choose-from-a-range-i,false,Medium,787,55,Algorithms,68.1%,2554,false,Array;Hash Table;Binary Search;Greedy;Sorting;,true,false,68.08048607823636,156756,230251
2673,"Maximize Win From Two Segments",maximize-win-from-two-segments,false,Medium,571,53,Algorithms,34.5%,2555,false,Array;Binary Search;Sliding Window;,false,false,34.49094858797972,11908,34525
2641,"Disconnect Path in a Binary Matrix by at Most One Flip",disconnect-path-in-a-binary-matrix-by-at-most-one-flip,false,Medium,603,30,Algorithms,27.3%,2556,false,Array;Dynamic Programming;Depth-First Search;Breadth-First Search;Matrix;,false,false,27.323380241445815,15299,55995
2702,"Maximum Number of Integers to Choose From a Range II",maximum-number-of-integers-to-choose-from-a-range-ii,true,Medium,39,22,Algorithms,37.0%,2557,true,Array;Binary Search;Greedy;Sorting;,false,false,36.99348482440807,2328,6293
2692,"Take Gifts From the Richest Pile",take-gifts-from-the-richest-pile,false,Easy,777,72,Algorithms,75.8%,2558,false,Array;Heap (Priority Queue);Simulation;,true,false,75.79176554923795,170223,224593
2691,"Count Vowel Strings in Ranges",count-vowel-strings-in-ranges,false,Medium,1057,64,Algorithms,68.2%,2559,false,Array;String;Prefix Sum;,true,false,68.21688709986582,170813,250385
2690,"House Robber IV",house-robber-iv,false,Medium,951,35,Algorithms,45.2%,2560,false,Array;Binary Search;,false,false,45.16213494461228,22423,49650
2689,"Rearranging Fruits",rearranging-fruits,false,Hard,385,19,Algorithms,34.5%,2561,false,Array;Hash Table;Greedy;,false,false,34.46481742673562,10990,31893
2698,"Find the Array Concatenation Value",find-the-array-concatenation-value,false,Easy,363,17,Algorithms,70.6%,2562,false,Array;Two Pointers;Simulation;,false,false,70.55012020621473,54876,77783
2699,"Count the Number of Fair Pairs",count-the-number-of-fair-pairs,false,Medium,1554,106,Algorithms,48.9%,2563,false,Array;Two Pointers;Binary Search;Sorting;,true,false,48.89896071212192,125905,257481
2700,"Substring XOR Queries",substring-xor-queries,false,Medium,377,83,Algorithms,33.8%,2564,false,Array;Hash Table;String;Bit Manipulation;,false,false,33.78078320549051,13388,39632
2701,"Subsequence With the Minimum Score",subsequence-with-the-minimum-score,false,Hard,387,5,Algorithms,32.3%,2565,false,Two Pointers;String;Binary Search;,false,false,32.27523431172138,8368,25927
2704,"Maximum Difference by Remapping a Digit",maximum-difference-by-remapping-a-digit,false,Easy,235,43,Algorithms,60.2%,2566,false,Math;Greedy;,false,false,60.151218761676596,27367,45497
2706,"Minimum Score by Changing Two Elements",minimum-score-by-changing-two-elements,false,Medium,249,239,Algorithms,48.4%,2567,false,Array;Greedy;Sorting;,false,false,48.375836828258095,18571,38389
2705,"Minimum Impossible OR",minimum-impossible-or,false,Medium,363,21,Algorithms,57.9%,2568,false,Array;Bit Manipulation;Brainteaser;,false,false,57.86161359103102,16825,29078
2703,"Handling Sum Queries After Update",handling-sum-queries-after-update,false,Hard,177,24,Algorithms,28.8%,2569,false,Array;Segment Tree;,false,false,28.75985795323525,6236,21683
2707,"Merge Two 2D Arrays by Summing Values",merge-two-2d-arrays-by-summing-values,false,Easy,348,13,Algorithms,74.2%,2570,false,Array;Hash Table;Two Pointers;,false,false,74.2222018376676,48548,65409
2710,"Minimum Operations to Reduce an Integer to 0",minimum-operations-to-reduce-an-integer-to-0,false,Medium,550,192,Algorithms,56.3%,2571,false,Dynamic Programming;Greedy;Bit Manipulation;,false,false,56.288961598071296,32686,58069
2709,"Count the Number of Square-Free Subsets",count-the-number-of-square-free-subsets,false,Medium,468,116,Algorithms,23.9%,2572,false,Array;Math;Dynamic Programming;Bit Manipulation;Bitmask;,false,false,23.900999091734786,10526,44040
2708,"Find the String with LCP",find-the-string-with-lcp,false,Hard,190,17,Algorithms,31.2%,2573,false,Array;String;Dynamic Programming;Greedy;Union Find;Matrix;,false,false,31.24639020445882,5410,17314
2714,"Left and Right Sum Differences",left-and-right-sum-differences,false,Easy,1107,103,Algorithms,87.2%,2574,false,Array;Prefix Sum;,false,false,87.1782570493712,161722,185507
2713,"Find the Divisibility Array of a String",find-the-divisibility-array-of-a-string,false,Medium,547,20,Algorithms,33.9%,2575,false,Array;Math;String;,false,false,33.88517423170889,31623,93324
2712,"Find the Maximum Number of Marked Indices",find-the-maximum-number-of-marked-indices,false,Medium,572,28,Algorithms,39.3%,2576,false,Array;Two Pointers;Binary Search;Greedy;Sorting;,false,false,39.28379202698339,21896,55738
2711,"Minimum Time to Visit a Cell In a Grid",minimum-time-to-visit-a-cell-in-a-grid,false,Hard,1034,40,Algorithms,57.5%,2577,false,Array;Breadth-First Search;Graph;Heap (Priority Queue);Matrix;Shortest Path;,true,false,57.459138401953844,79520,138394
2650,"Split With Minimum Sum",split-with-minimum-sum,false,Easy,385,31,Algorithms,71.4%,2578,false,Math;Greedy;Sorting;,false,false,71.39913675198494,40196,56298
2649,"Count Total Number of Colored Cells",count-total-number-of-colored-cells,false,Medium,295,25,Algorithms,58.0%,2579,false,Math;,false,false,57.978450487429456,28250,48725
2651,"Count Ways to Group Overlapping Ranges",count-ways-to-group-overlapping-ranges,false,Medium,319,25,Algorithms,37.0%,2580,false,Array;Sorting;,false,false,36.97839084212459,18122,49006
2652,"Count Number of Possible Root Nodes",count-number-of-possible-root-nodes,false,Hard,304,9,Algorithms,46.4%,2581,false,Array;Hash Table;Dynamic Programming;Tree;Depth-First Search;,false,false,46.41942894650476,7072,15235
2645,"Pass the Pillow",pass-the-pillow,false,Easy,1053,53,Algorithms,56.7%,2582,false,Math;Simulation;,true,false,56.72786566710509,199694,352021
2646,"Kth Largest Sum in a Binary Tree",kth-largest-sum-in-a-binary-tree,false,Medium,1000,37,Algorithms,59.4%,2583,false,Tree;Breadth-First Search;Sorting;Binary Tree;,true,false,59.385536532884274,158693,267225
2647,"Split the Array to Make Coprime Products",split-the-array-to-make-coprime-products,false,Hard,309,111,Algorithms,23.5%,2584,false,Array;Hash Table;Math;Number Theory;,false,false,23.475740861923907,12556,53485
2648,"Number of Ways to Earn Points",number-of-ways-to-earn-points,false,Hard,485,12,Algorithms,57.9%,2585,false,Array;Dynamic Programming;,false,false,57.94663573085847,18981,32756
2654,"Count the Number of Vowel Strings in Range",count-the-number-of-vowel-strings-in-range,false,Easy,349,27,Algorithms,74.4%,2586,false,Array;String;Counting;,false,false,74.34807436076392,70308,94563
2655,"Rearrange Array to Maximize Prefix Score",rearrange-array-to-maximize-prefix-score,false,Medium,292,49,Algorithms,41.1%,2587,false,Array;Greedy;Sorting;Prefix Sum;,false,false,41.13057138776729,31680,77023
2656,"Count the Number of Beautiful Subarrays",count-the-number-of-beautiful-subarrays,false,Medium,529,22,Algorithms,51.2%,2588,false,Array;Hash Table;Bit Manipulation;Prefix Sum;,false,false,51.19632907243526,20306,39663
2657,"Minimum Time to Complete All Tasks",minimum-time-to-complete-all-tasks,false,Hard,429,19,Algorithms,37.9%,2589,false,Array;Binary Search;Stack;Greedy;Sorting;,false,false,37.92427055238362,10827,28549
2688,"Design a Todo List",design-a-todo-list,true,Medium,44,14,Algorithms,58.5%,2590,true,Array;Hash Table;String;Design;Sorting;,false,false,58.53341985723556,2706,4623
2663,"Distribute Money to Maximum Children",distribute-money-to-maximum-children,false,Easy,324,857,Algorithms,19.5%,2591,false,Math;Greedy;,false,false,19.52982046001999,35755,183079
2664,"Maximize Greatness of an Array",maximize-greatness-of-an-array,false,Medium,459,18,Algorithms,58.4%,2592,false,Array;Two Pointers;Greedy;Sorting;,false,false,58.38501534799223,27960,47889
2695,"Find Score of an Array After Marking All Elements",find-score-of-an-array-after-marking-all-elements,false,Medium,881,20,Algorithms,65.0%,2593,false,Array;Hash Table;Sorting;Heap (Priority Queue);Simulation;,true,false,64.97282608695653,124332,191360
2665,"Minimum Time to Repair Cars",minimum-time-to-repair-cars,false,Medium,622,31,Algorithms,45.6%,2594,false,Array;Binary Search;,false,false,45.585495819434215,21045,46166
2659,"Number of Even and Odd Bits",number-of-even-and-odd-bits,false,Easy,336,113,Algorithms,72.9%,2595,false,Bit Manipulation;,false,false,72.91536658762186,52580,72111
2662,"Check Knight Tour Configuration",check-knight-tour-configuration,false,Medium,417,61,Algorithms,56.9%,2596,false,Array;Depth-First Search;Breadth-First Search;Matrix;Simulation;,false,false,56.89611076062678,33368,58647
2696,"The Number of Beautiful Subsets",the-number-of-beautiful-subsets,false,Medium,1218,175,Algorithms,50.9%,2597,false,Array;Hash Table;Math;Dynamic Programming;Backtracking;Sorting;Combinatorics;,true,false,50.8658256637431,119874,235668
2661,"Smallest Missing Non-negative Integer After Operations",smallest-missing-non-negative-integer-after-operations,false,Medium,362,50,Algorithms,39.5%,2598,false,Array;Hash Table;Math;Greedy;,false,false,39.52852218392083,17774,44965
2674,"Make the Prefix Sum Non-negative",make-the-prefix-sum-non-negative,true,Medium,51,2,Algorithms,48.4%,2599,true,Array;Greedy;Heap (Priority Queue);,false,false,48.430004361099,2221,4586
2715,"K Items With the Maximum Sum",k-items-with-the-maximum-sum,false,Easy,300,34,Algorithms,61.6%,2600,false,Math;Greedy;,false,false,61.61090715684876,47494,77087
2716,"Prime Subtraction Operation",prime-subtraction-operation,false,Medium,914,92,Algorithms,55.9%,2601,false,Array;Math;Binary Search;Greedy;Number Theory;,true,false,55.85688229512525,114229,204503
2718,"Minimum Operations to Make All Array Elements Equal",minimum-operations-to-make-all-array-elements-equal,false,Medium,762,27,Algorithms,36.4%,2602,false,Array;Binary Search;Sorting;Prefix Sum;,false,false,36.38923502662114,22486,61793
2717,"Collect Coins in a Tree",collect-coins-in-a-tree,false,Hard,457,12,Algorithms,36.3%,2603,false,Array;Tree;Graph;Topological Sort;,false,false,36.34050133604784,8568,23577
2666,"Minimum Time to Eat All Grains",minimum-time-to-eat-all-grains,true,Hard,45,3,Algorithms,40.1%,2604,true,Array;Two Pointers;Binary Search;Sorting;,false,false,40.05665722379603,1414,3530
2668,"Form Smallest Number From Two Digit Arrays",form-smallest-number-from-two-digit-arrays,false,Easy,306,25,Algorithms,54.3%,2605,false,Array;Hash Table;Enumeration;,false,false,54.34104497010658,41810,76940
2669,"Find the Substring With Maximum Cost",find-the-substring-with-maximum-cost,false,Medium,370,12,Algorithms,56.9%,2606,false,Array;Hash Table;String;Dynamic Programming;,false,false,56.89406474057104,26821,47142
2670,"Make K-Subarray Sums Equal",make-k-subarray-sums-equal,false,Medium,473,85,Algorithms,36.8%,2607,false,Array;Math;Sorting;Number Theory;,false,false,36.81869099055849,11504,31245
2671,"Shortest Cycle in a Graph",shortest-cycle-in-a-graph,false,Hard,533,16,Algorithms,36.6%,2608,false,Breadth-First Search;Graph;,false,false,36.623794212218655,20502,55980
2723,"Find the Longest Balanced Substring of a Binary String",find-the-longest-balanced-substring-of-a-binary-string,false,Easy,367,29,Algorithms,46.2%,2609,false,String;,false,false,46.15099875241634,33663,72941
2724,"Convert an Array Into a 2D Array With Conditions",convert-an-array-into-a-2d-array-with-conditions,false,Medium,1624,79,Algorithms,86.6%,2610,false,Array;Hash Table;,true,false,86.61652439737401,207401,239447
2725,"Mice and Cheese",mice-and-cheese,false,Medium,634,61,Algorithms,46.7%,2611,false,Array;Greedy;Sorting;Heap (Priority Queue);,false,false,46.700303349223056,30174,64612
2726,"Minimum Reverse Operations",minimum-reverse-operations,false,Hard,242,72,Algorithms,16.5%,2612,false,Array;Breadth-First Search;Ordered Set;,false,false,16.474275897404986,5466,33179
2719,"Beautiful Pairs",beautiful-pairs,true,Hard,18,2,Algorithms,42.5%,2613,true,Array;Math;Divide and Conquer;Geometry;Sorting;Ordered Set;,false,false,42.45416078984485,602,1418
2722,"Prime In Diagonal",prime-in-diagonal,false,Easy,354,40,Algorithms,35.3%,2614,false,Array;Math;Matrix;Number Theory;,false,false,35.251100664129545,51963,147410
2721,"Sum of Distances",sum-of-distances,false,Medium,757,91,Algorithms,31.1%,2615,false,Array;Hash Table;Prefix Sum;,false,false,31.12040793328826,22093,70992
2720,"Minimize the Maximum Difference of Pairs",minimize-the-maximum-difference-of-pairs,false,Medium,2345,249,Algorithms,44.0%,2616,false,Array;Binary Search;Greedy;,true,false,43.961005881535684,75940,172743
2697,"Minimum Number of Visited Cells in a Grid",minimum-number-of-visited-cells-in-a-grid,false,Hard,391,34,Algorithms,23.4%,2617,false,Array;Dynamic Programming;Stack;Breadth-First Search;Union Find;Heap (Priority Queue);Matrix;Monotonic Stack;,false,false,23.408725744654554,9470,40455
2758,"Check if Object Instance of Class",check-if-object-instance-of-class,false,Medium,269,101,JavaScript,27.8%,2618,false,,true,false,27.820487062082965,26309,94567
2734,"Array Prototype Last",array-prototype-last,false,Easy,523,21,JavaScript,74.1%,2619,false,,true,false,74.11509554922047,163005,219936
2732,"Counter",counter,false,Easy,1362,118,JavaScript,81.8%,2620,false,,true,false,81.79447639595756,494352,604384
2733,"Sleep",sleep,false,Easy,615,51,JavaScript,87.5%,2621,false,,true,false,87.46262829667225,170254,194660
2762,"Cache With Time Limit",cache-with-time-limit,false,Medium,456,32,JavaScript,75.2%,2622,false,,true,false,75.23024129559049,55463,73725
2731,"Memoize",memoize,false,Medium,650,97,JavaScript,63.1%,2623,false,,true,false,63.0927762959411,126309,200193
2760,"Snail Traversal",snail-traversal,false,Medium,105,45,JavaScript,66.2%,2624,false,,true,false,66.16729754225089,12411,18757
2759,"Flatten Deeply Nested Array",flatten-deeply-nested-array,false,Medium,361,25,JavaScript,63.6%,2625,false,,true,false,63.63451606732976,53227,83646
2761,"Array Reduce Transformation",array-reduce-transformation,false,Easy,644,41,JavaScript,85.1%,2626,false,,true,false,85.14216570821458,201944,237185
2743,"Debounce",debounce,false,Medium,416,50,JavaScript,91.4%,2627,false,,true,false,91.41465180470294,60605,66297
2735,"JSON Deep Equal",json-deep-equal,true,Medium,218,17,JavaScript,38.9%,2628,true,,true,false,38.89779383906974,13347,34313
2741,"Function Composition",function-composition,false,Easy,714,55,JavaScript,86.7%,2629,false,,true,false,86.73319666054877,169650,195600
2744,"Memoize II",memoize-ii,false,Hard,121,43,JavaScript,31.6%,2630,false,,true,false,31.647486371895823,6270,19812
2742,"Group By",group-by,false,Medium,327,17,JavaScript,81.0%,2631,false,,true,false,80.96335110067155,53771,66414
2740,"Curry",curry,true,Medium,344,35,JavaScript,89.3%,2632,true,,true,false,89.29698411877295,17262,19331
2745,"Convert Object to JSON String",convert-object-to-json-string,true,Medium,205,12,JavaScript,77.4%,2633,true,,true,false,77.40441774607346,12370,15981
2746,"Filter Elements from Array",filter-elements-from-array,false,Easy,677,92,JavaScript,85.2%,2634,false,,true,false,85.16642547033285,216562,254282
2747,"Apply Transform Over Each Element in Array",apply-transform-over-each-element-in-array,false,Easy,786,84,JavaScript,86.0%,2635,false,,true,false,85.973383498056,239478,278549
2750,"Promise Pool",promise-pool,true,Medium,290,27,JavaScript,79.7%,2636,true,,true,false,79.74927675988428,13232,16592
2749,"Promise Time Limit",promise-time-limit,false,Medium,501,74,JavaScript,82.2%,2637,false,,true,false,82.1774458805901,67456,82086
2738,"Count the Number of K-Free Subsets",count-the-number-of-k-free-subsets,true,Medium,87,16,Algorithms,46.9%,2638,true,Array;Math;Dynamic Programming;Sorting;Combinatorics;,false,false,46.9049983449189,4251,9063
2675,"Find the Width of Columns of a Grid",find-the-width-of-columns-of-a-grid,false,Easy,175,46,Algorithms,68.4%,2639,false,Array;Matrix;,false,false,68.36564357096752,30716,44929
2676,"Find the Score of All Prefixes of an Array",find-the-score-of-all-prefixes-of-an-array,false,Medium,316,42,Algorithms,71.7%,2640,false,Array;Prefix Sum;,false,false,71.7235370400389,35397,49352
2677,"Cousins in Binary Tree II",cousins-in-binary-tree-ii,false,Medium,1143,51,Algorithms,75.3%,2641,false,Hash Table;Tree;Depth-First Search;Breadth-First Search;Binary Tree;,true,false,75.31343925830785,115515,153379
2678,"Design Graph With Shortest Path Calculator",design-graph-with-shortest-path-calculator,false,Hard,819,58,Algorithms,70.6%,2642,false,Graph;Design;Heap (Priority Queue);Shortest Path;,true,false,70.59391889851747,70140,99357
2737,"Row With Maximum Ones",row-with-maximum-ones,false,Easy,482,15,Algorithms,74.6%,2643,false,Array;Matrix;,false,false,74.62546629695386,74818,100258
2694,"Find the Maximum Divisibility Score",find-the-maximum-divisibility-score,false,Easy,240,60,Algorithms,49.9%,2644,false,Array;,false,false,49.9438137497839,34667,69412
2736,"Minimum Additions to Make Valid String",minimum-additions-to-make-valid-string,false,Medium,557,26,Algorithms,50.2%,2645,false,String;Dynamic Programming;Stack;Greedy;,false,false,50.150462415906475,31831,63471
2739,"Minimize the Total Price of the Trips",minimize-the-total-price-of-the-trips,false,Hard,490,19,Algorithms,46.1%,2646,false,Array;Dynamic Programming;Tree;Depth-First Search;Graph;,false,false,46.12406363100749,10960,23762
2540,"Color the Triangle Red",color-the-triangle-red,true,Hard,10,17,Algorithms,67.7%,2647,true,Array;Math;,false,false,67.70642201834862,369,545
2775,"Generate Fibonacci Sequence",generate-fibonacci-sequence,false,Easy,251,28,JavaScript,83.5%,2648,false,,true,false,83.53531340021854,33638,40268
2783,"Nested Array Generator",nested-array-generator,false,Medium,164,11,JavaScript,79.4%,2649,false,,true,false,79.41728788482331,13956,17573
2788,"Design Cancellable Function",design-cancellable-function,false,Hard,65,16,JavaScript,50.0%,2650,false,,false,false,50.02875215641173,2610,5217
2748,"Calculate Delayed Arrival Time",calculate-delayed-arrival-time,false,Easy,241,48,Algorithms,77.5%,2651,false,Math;,false,false,77.51563220292904,65579,84601
2752,"Sum Multiples",sum-multiples,false,Easy,513,34,Algorithms,85.3%,2652,false,Math;,false,false,85.29056973938863,128681,150874
2751,"Sliding Subarray Beauty",sliding-subarray-beauty,false,Medium,650,130,Algorithms,33.5%,2653,false,Array;Hash Table;Sliding Window;,false,false,33.52119026149684,23792,70976
2753,"Minimum Number of Operations to Make All Array Elements Equal to 1",minimum-number-of-operations-to-make-all-array-elements-equal-to-1,false,Medium,390,24,Algorithms,34.9%,2654,false,Array;Math;Number Theory;,false,false,34.850621874599305,13590,38995
2815,"Find Maximal Uncovered Ranges",find-maximal-uncovered-ranges,true,Medium,28,3,Algorithms,51.3%,2655,true,Array;Sorting;,false,false,51.260229132569556,1566,3055
2767,"Maximum Sum With Exactly K Elements ",maximum-sum-with-exactly-k-elements,false,Easy,386,50,Algorithms,81.7%,2656,false,Array;Greedy;,false,false,81.71032297188913,83539,102238
2766,"Find the Prefix Common Array of Two Arrays",find-the-prefix-common-array-of-two-arrays,false,Medium,496,17,Algorithms,79.7%,2657,false,Array;Hash Table;Bit Manipulation;,false,false,79.71167017473523,47717,59862
2764,"Maximum Number of Fish in a Grid",maximum-number-of-fish-in-a-grid,false,Medium,451,25,Algorithms,59.5%,2658,false,Array;Depth-First Search;Breadth-First Search;Union Find;Matrix;,false,false,59.52753774478532,30791,51727
2765,"Make Array Empty",make-array-empty,false,Hard,546,32,Algorithms,25.2%,2659,false,Array;Binary Search;Greedy;Binary Indexed Tree;Segment Tree;Sorting;Ordered Set;,false,false,25.233485799383043,11861,47005
2684,"Determine the Winner of a Bowling Game",determine-the-winner-of-a-bowling-game,false,Easy,278,155,Algorithms,35.0%,2660,false,Array;Simulation;,false,false,35.044439908708,37773,107786
2685,"First Completely Painted Row or Column",first-completely-painted-row-or-column,false,Medium,442,10,Algorithms,50.0%,2661,false,Array;Hash Table;Matrix;,false,false,49.98133631952221,26780,53580
2686,"Minimum Cost of a Path With Special Roads",minimum-cost-of-a-path-with-special-roads,false,Medium,636,86,Algorithms,40.2%,2662,false,Array;Graph;Heap (Priority Queue);Shortest Path;,false,false,40.161480055609026,15022,37404
2687,"Lexicographically Smallest Beautiful String",lexicographically-smallest-beautiful-string,false,Hard,210,24,Algorithms,38.3%,2663,false,String;Greedy;,false,false,38.25951480080125,8595,22465
2823,"The Knight’s Tour",the-knights-tour,true,Medium,56,15,Algorithms,73.2%,2664,true,Array;Backtracking;Matrix;,true,false,73.23926073926074,5865,8008
2789,"Counter II",counter-ii,false,Easy,779,33,JavaScript,80.7%,2665,false,,true,false,80.65609387813151,266539,330465
2796,"Allow One Function Call",allow-one-function-call,false,Easy,510,61,JavaScript,86.6%,2666,false,,true,false,86.56215579292503,135167,156151
2809,"Create Hello World Function",create-hello-world-function,false,Easy,1386,191,JavaScript,81.7%,2667,false,,true,false,81.74336509614601,581445,711305
2829,"Find Latest Salaries",find-latest-salaries,true,Easy,19,18,Database,73.9%,2668,true,Database;,true,false,73.90888818094935,4640,6278
2830,"Count Artist Occurrences On Spotify Ranking List",count-artist-occurrences-on-spotify-ranking-list,true,Easy,16,1,Database,73.5%,2669,true,Database;,false,false,73.53454291695743,4215,5732
2777,"Find the Distinct Difference Array",find-the-distinct-difference-array,false,Easy,339,34,Algorithms,77.3%,2670,false,Array;Hash Table;,false,false,77.2744541129222,42715,55277
2778,"Frequency Tracker",frequency-tracker,false,Medium,331,29,Algorithms,30.5%,2671,false,Hash Table;Design;,false,false,30.485723746211253,23938,78522
2779,"Number of Adjacent Elements With the Same Color",number-of-adjacent-elements-with-the-same-color,false,Medium,347,97,Algorithms,54.2%,2672,false,Array;,false,false,54.192248968586554,16680,30780
2780,"Make Costs of Paths Equal in a Binary Tree",make-costs-of-paths-equal-in-a-binary-tree,false,Medium,620,13,Algorithms,58.0%,2673,false,Array;Dynamic Programming;Greedy;Tree;Binary Tree;,false,false,58.04999676186775,17927,30882
2835,"Split a Circular Linked List",split-a-circular-linked-list,true,Medium,40,6,Algorithms,75.8%,2674,true,Linked List;Two Pointers;,false,false,75.80228697897455,2055,2711
2769,"Array of Objects to Matrix",array-of-objects-to-matrix,true,Hard,132,72,JavaScript,68.5%,2675,true,,true,false,68.48373797526341,5980,8732
2771,"Throttle",throttle,true,Medium,165,30,JavaScript,82.9%,2676,true,,true,false,82.94367251851236,9969,12019
2798,"Chunk Array",chunk-array,false,Easy,358,7,JavaScript,83.9%,2677,false,,true,false,83.93585096427918,78036,92971
2727,"Number of Senior Citizens",number-of-senior-citizens,false,Easy,733,59,Algorithms,81.5%,2678,false,Array;String;,true,false,81.45314501101649,268393,329506
2728,"Sum in a Matrix",sum-in-a-matrix,false,Medium,366,60,Algorithms,59.5%,2679,false,Array;Sorting;Heap (Priority Queue);Matrix;Simulation;,false,false,59.54354280059376,38508,64672
2730,"Maximum OR",maximum-or,false,Medium,399,46,Algorithms,41.1%,2680,false,Array;Greedy;Bit Manipulation;Prefix Sum;,false,false,41.05220449012713,15177,36970
2784,"Power of Heroes",power-of-heroes,false,Hard,323,16,Algorithms,30.9%,2681,false,Array;Math;Dynamic Programming;Sorting;Prefix Sum;,false,false,30.882173382173384,10117,32760
2791,"Find the Losers of the Circular Game",find-the-losers-of-the-circular-game,false,Easy,248,39,Algorithms,49.3%,2682,false,Array;Hash Table;Simulation;,false,false,49.25281132861308,29564,60025
2792,"Neighboring Bitwise XOR",neighboring-bitwise-xor,false,Medium,274,10,Algorithms,61.3%,2683,false,Array;Bit Manipulation;,false,false,61.28763629739507,23551,38427
2794,"Maximum Number of Moves in a Grid",maximum-number-of-moves-in-a-grid,false,Medium,918,25,Algorithms,59.1%,2684,false,Array;Dynamic Programming;Matrix;,true,false,59.103051546974605,125448,212253
2793,"Count the Number of Complete Components",count-the-number-of-complete-components,false,Medium,704,17,Algorithms,64.8%,2685,false,Depth-First Search;Breadth-First Search;Union Find;Graph;,false,false,64.75166861098892,33857,52288
2840,"Immediate Food Delivery III",immediate-food-delivery-iii,true,Medium,14,1,Database,68.6%,2686,true,Database;,false,false,68.62476451447166,4007,5839
2841,"Bikes Last Time Used ",bikes-last-time-used,true,Easy,21,3,Database,80.8%,2687,true,Database;,false,false,80.75870873609338,4428,5483
2842,"Find Active Users",find-active-users,true,Medium,22,8,Database,43.8%,2688,true,Database;,false,false,43.80870128468099,4058,9263
2843,"Extract Kth Character From The Rope Tree",extract-kth-character-from-the-rope-tree,true,Easy,37,23,Algorithms,74.1%,2689,true,Tree;Depth-First Search;Binary Tree;,false,false,74.06143344709898,3472,4688
2772,"Infinite Method Object",infinite-method-object,true,Easy,30,6,JavaScript,92.6%,2690,true,,true,false,92.57884972170687,1497,1617
2773,"Immutability Helper",immutability-helper,true,Hard,11,8,JavaScript,42.2%,2691,true,,false,false,42.194744976816075,273,647
2776,"Make Object Immutable",make-object-immutable,true,Medium,17,0,JavaScript,64.8%,2692,true,,true,false,64.84375,498,768
2790,"Call Function with Custom Context",call-function-with-custom-context,false,Medium,140,13,JavaScript,79.0%,2693,false,,true,false,79.00069881201956,11305,14310
2797,"Event Emitter",event-emitter,false,Medium,253,32,JavaScript,74.1%,2694,false,,true,false,74.06865636427982,31393,42384
2805,"Array Wrapper",array-wrapper,false,Easy,246,56,JavaScript,88.7%,2695,false,,true,false,88.70373366409606,49345,55629
2800,"Minimum String Length After Removing Substrings",minimum-string-length-after-removing-substrings,false,Easy,954,24,Algorithms,77.5%,2696,false,String;Stack;Simulation;,true,false,77.51599435744717,217604,280722
2816,"Lexicographically Smallest Palindrome",lexicographically-smallest-palindrome,false,Easy,365,26,Algorithms,81.6%,2697,false,Two Pointers;String;Greedy;,false,false,81.60574637863962,61463,75317
2802,"Find the Punishment Number of an Integer",find-the-punishment-number-of-an-integer,false,Medium,486,32,Algorithms,62.9%,2698,false,Math;Backtracking;,false,false,62.91546715519497,21636,34389
2803,"Modify Graph Edge Weights",modify-graph-edge-weights,false,Hard,703,151,Algorithms,56.7%,2699,false,Graph;Heap (Priority Queue);Shortest Path;,true,false,56.65820709383149,64966,114663
2774,"Differences Between Two Objects",differences-between-two-objects,true,Medium,145,30,JavaScript,75.3%,2700,true,,true,false,75.2754958926067,7514,9982
2853,"Consecutive Transactions with Increasing Amounts",consecutive-transactions-with-increasing-amounts,true,Hard,49,5,Database,33.1%,2701,true,Database;,true,false,33.095386811814045,3709,11207
2729,"Minimum Operations to Make Numbers Non-positive",minimum-operations-to-make-numbers-non-positive,true,Hard,46,4,Algorithms,41.2%,2702,true,Array;Binary Search;,false,false,41.219802838262375,3805,9231
2820,"Return Length of Arguments Passed",return-length-of-arguments-passed,false,Easy,339,166,JavaScript,94.4%,2703,false,,true,false,94.40092915214866,203191,215243
2813,"To Be Or Not To Be",to-be-or-not-to-be,false,Easy,736,178,JavaScript,62.6%,2704,false,,true,false,62.591859254795466,239931,383327
2804,"Compact Object",compact-object,false,Medium,188,22,JavaScript,65.9%,2705,false,,true,false,65.9028973816739,30229,45869
2756,"Buy Two Chocolates",buy-two-chocolates,false,Easy,1008,68,Algorithms,68.8%,2706,false,Array;Greedy;Sorting;,true,false,68.81830010966807,195157,283583
2755,"Extra Characters in a String",extra-characters-in-a-string,false,Medium,2550,134,Algorithms,57.4%,2707,false,Array;Hash Table;String;Dynamic Programming;Trie;,true,false,57.395933382298466,182860,318593
2754,"Maximum Strength of a Group",maximum-strength-of-a-group,false,Medium,368,61,Algorithms,24.6%,2708,false,Array;Dynamic Programming;Backtracking;Greedy;Bit Manipulation;Sorting;Enumeration;,false,false,24.5696891720145,31318,127466
2827,"Greatest Common Divisor Traversal",greatest-common-divisor-traversal,false,Hard,818,139,Algorithms,42.1%,2709,false,Array;Math;Union Find;Number Theory;,true,false,42.09243746704938,71856,170710
2819,"Remove Trailing Zeros From a String",remove-trailing-zeros-from-a-string,false,Easy,320,12,Algorithms,78.9%,2710,false,String;,false,false,78.8825606923542,74376,94287
2801,"Difference of Number of Distinct Values on Diagonals",difference-of-number-of-distinct-values-on-diagonals,false,Medium,128,209,Algorithms,69.2%,2711,false,Array;Hash Table;Matrix;,false,false,69.22147245442642,20619,29787
2817,"Minimum Cost to Make All Characters Equal",minimum-cost-to-make-all-characters-equal,false,Medium,542,25,Algorithms,53.3%,2712,false,String;Dynamic Programming;Greedy;,false,false,53.29671808954581,19796,37143
2818,"Maximum Strictly Increasing Cells in a Matrix",maximum-strictly-increasing-cells-in-a-matrix,false,Hard,593,20,Algorithms,30.5%,2713,false,Array;Hash Table;Binary Search;Dynamic Programming;Memoization;Sorting;Matrix;Ordered Set;,false,false,30.503886879885666,14087,46181
2865,"Find Shortest Path with K Hops",find-shortest-path-with-k-hops,true,Hard,34,0,Algorithms,61.9%,2714,true,Graph;Heap (Priority Queue);Shortest Path;,false,false,61.937533086289044,1170,1889
2821,"Timeout Cancellation",timeout-cancellation,false,Easy,252,316,JavaScript,89.3%,2715,false,,true,false,89.28179192710805,65847,73752
2825,"Minimize String Length",minimize-string-length,false,Easy,340,98,Algorithms,76.6%,2716,false,Hash Table;String;,false,false,76.60141587293823,62650,81787
2785,"Semi-Ordered Permutation",semi-ordered-permutation,false,Easy,210,17,Algorithms,63.5%,2717,false,Array;Simulation;,false,false,63.494135452137726,33563,52860
2838,"Sum of Matrix After Queries",sum-of-matrix-after-queries,false,Medium,710,26,Algorithms,31.1%,2718,false,Array;Hash Table;,false,false,31.089847322873425,22094,71065
2757,"Count of Integers",count-of-integers,false,Hard,531,12,Algorithms,35.0%,2719,false,Math;String;Dynamic Programming;,false,false,34.98,12243,35000
2874,"Popularity Percentage",popularity-percentage,true,Hard,13,9,Database,53.6%,2720,true,Database;,true,false,53.61894024802706,2378,4435
2807,"Execute Asynchronous Functions in Parallel",execute-asynchronous-functions-in-parallel,false,Medium,209,45,JavaScript,76.4%,2721,false,,true,false,76.35882741899934,34642,45368
2858,"Join Two Arrays by ID",join-two-arrays-by-id,false,Medium,193,54,JavaScript,55.6%,2722,false,,true,false,55.55819112866093,39817,71668
2859,"Add Two Promises",add-two-promises,false,Easy,291,29,JavaScript,91.6%,2723,false,,true,false,91.60431387132763,123160,134448
2860,"Sort By",sort-by,false,Easy,185,39,JavaScript,82.8%,2724,false,,true,false,82.79877361038301,52121,62949
2862,"Interval Cancellation",interval-cancellation,false,Easy,174,88,JavaScript,82.6%,2725,false,,true,false,82.59536836942695,53891,65247
2863,"Calculator with Method Chaining",calculator-with-method-chaining,false,Easy,122,19,JavaScript,76.5%,2726,false,,true,false,76.47071347967722,35915,46966
2864,"Is Object Empty",is-object-empty,false,Easy,187,14,JavaScript,80.9%,2727,false,,true,false,80.8963827351423,80555,99576
2875,"Count Houses in a Circular Street",count-houses-in-a-circular-street,true,Easy,52,12,Algorithms,85.4%,2728,true,Array;Interactive;,false,false,85.4315933128625,2504,2931
2824,"Check if The Number is Fascinating",check-if-the-number-is-fascinating,false,Easy,239,13,Algorithms,52.2%,2729,false,Hash Table;Math;,false,false,52.243005427050946,49576,94895
2786,"Find the Longest Semi-Repetitive Substring",find-the-longest-semi-repetitive-substring,false,Medium,296,85,Algorithms,37.3%,2730,false,String;Sliding Window;,false,false,37.33027785734747,26064,69820
2787,"Movement of Robots",movement-of-robots,false,Medium,495,95,Algorithms,27.5%,2731,false,Array;Brainteaser;Sorting;Prefix Sum;,false,false,27.54389957143399,14525,52734
2826,"Find a Good Subset of the Matrix",find-a-good-subset-of-the-matrix,false,Hard,208,27,Algorithms,45.5%,2732,false,Array;Hash Table;Bit Manipulation;Matrix;,false,false,45.4625550660793,7224,15890
2836,"Neither Minimum nor Maximum",neither-minimum-nor-maximum,false,Easy,358,18,Algorithms,76.3%,2733,false,Array;Sorting;,false,false,76.25133507225738,104947,137633
2828,"Lexicographically Smallest String After Substring Operation",lexicographically-smallest-string-after-substring-operation,false,Medium,257,189,Algorithms,32.2%,2734,false,String;Greedy;,false,false,32.23251107169672,29622,91901
2810,"Collecting Chocolates",collecting-chocolates,false,Medium,292,543,Algorithms,33.8%,2735,false,Array;Enumeration;,false,false,33.80186546805581,13010,38489
2839,"Maximum Sum Queries",maximum-sum-queries,false,Hard,343,15,Algorithms,29.3%,2736,false,Array;Binary Search;Stack;Binary Indexed Tree;Segment Tree;Sorting;Monotonic Stack;,false,false,29.29391530702366,6302,21513
2880,"Find the Closest Marked Node",find-the-closest-marked-node,true,Medium,34,1,Algorithms,57.3%,2737,true,Array;Graph;Heap (Priority Queue);Shortest Path;,false,false,57.345032550240596,2025,3532
2885,"Count Occurrences in Text",count-occurrences-in-text,true,Medium,23,46,Database,55.8%,2738,true,Database;,true,false,55.84213542946041,6820,12213
2857,"Total Distance Traveled",total-distance-traveled,false,Easy,295,99,Algorithms,39.9%,2739,false,Math;Simulation;,false,false,39.9122375328084,48661,121920
2845,"Find the Value of the Partition",find-the-value-of-the-partition,false,Medium,293,22,Algorithms,64.4%,2740,false,Array;Sorting;,false,false,64.37692405778094,35341,54897
2848,"Special Permutations",special-permutations,false,Medium,564,65,Algorithms,28.8%,2741,false,Array;Dynamic Programming;Bit Manipulation;Bitmask;,false,false,28.8406861360598,15317,53109
2808,"Painting the Walls",painting-the-walls,false,Hard,1394,88,Algorithms,50.4%,2742,false,Array;Dynamic Programming;,true,false,50.351598481274294,67233,133530
2890,"Count Substrings Without Repeating Character",count-substrings-without-repeating-character,true,Medium,90,2,Algorithms,76.8%,2743,true,Hash Table;String;Sliding Window;,true,false,76.76464500103498,7417,9662
2847,"Find Maximum Number of String Pairs",find-maximum-number-of-string-pairs,false,Easy,383,16,Algorithms,81.2%,2744,false,Array;Hash Table;String;Simulation;,false,false,81.22152744583508,83259,102509
2850,"Construct the Longest New String",construct-the-longest-new-string,false,Medium,316,24,Algorithms,53.8%,2745,false,Math;Dynamic Programming;Greedy;Brainteaser;,false,false,53.83534977700022,21848,40583
2854,"Decremental String Concatenation",decremental-string-concatenation,false,Medium,365,33,Algorithms,26.7%,2746,false,Array;String;Dynamic Programming;,false,false,26.710212728396147,9078,33987
2833,"Count Zero Request Servers",count-zero-request-servers,false,Medium,350,41,Algorithms,33.1%,2747,false,Array;Hash Table;Sliding Window;Sorting;,false,false,33.0688057652711,7709,23312
2831,"Number of Beautiful Pairs",number-of-beautiful-pairs,false,Easy,214,38,Algorithms,50.5%,2748,false,Array;Hash Table;Math;Counting;Number Theory;,false,false,50.48445673978315,38505,76271
2837,"Minimum Operations to Make the Integer Zero",minimum-operations-to-make-the-integer-zero,false,Medium,294,289,Algorithms,29.9%,2749,false,Bit Manipulation;Brainteaser;,false,false,29.86708365910868,10314,34533
2867,"Ways to Split Array Into Good Subarrays",ways-to-split-array-into-good-subarrays,false,Medium,448,14,Algorithms,34.3%,2750,false,Array;Math;Dynamic Programming;,false,false,34.26188786373314,23172,67632
2846,"Robot Collisions",robot-collisions,false,Hard,1139,97,Algorithms,56.8%,2751,false,Array;Stack;Sorting;Simulation;,true,false,56.840982940698616,111954,196960
2852,"Customers with Maximum Number of Transactions on Consecutive Days",customers-with-maximum-number-of-transactions-on-consecutive-days,true,Hard,14,28,Database,39.8%,2752,true,Database;,false,false,39.7743021183924,2009,5051
2897,"Count Houses in a Circular Street II",count-houses-in-a-circular-street-ii,true,Hard,27,3,Algorithms,60.9%,2753,true,,true,false,60.942492012779546,763,1252
2770,"Bind Function to Context",bind-function-to-context,true,Medium,16,0,JavaScript,87.3%,2754,true,,true,false,87.25824800910125,767,879
2795,"Deep Merge of Two Objects",deep-merge-of-two-objects,true,Medium,15,4,JavaScript,66.2%,2755,true,,true,false,66.18257261410788,638,964
2806,"Query Batching",query-batching,true,Hard,14,5,JavaScript,63.3%,2756,true,,true,false,63.30434782608696,364,575
2814,"Generate Circular Array Values",generate-circular-array-values,true,Medium,11,1,JavaScript,73.7%,2757,true,,true,false,73.66818873668188,484,657
2822,"Next Day",next-day,true,Easy,13,1,JavaScript,83.7%,2758,true,,true,false,83.6644591611479,1137,1359
2851,"Convert JSON String to Object",convert-json-string-to-object,true,Hard,16,3,JavaScript,61.8%,2759,true,,true,false,61.80124223602485,597,966
2866,"Longest Even Odd Subarray With Threshold",longest-even-odd-subarray-with-threshold,false,Easy,305,275,Algorithms,30.1%,2760,false,Array;Sliding Window;,false,false,30.1454846977235,39990,132659
2873,"Prime Pairs With Target Sum",prime-pairs-with-target-sum,false,Medium,374,34,Algorithms,34.8%,2761,false,Array;Math;Enumeration;Number Theory;,false,false,34.836691169306384,32179,92371
2868,"Continuous Subarrays",continuous-subarrays,false,Medium,1396,86,Algorithms,58.9%,2762,false,Array;Queue;Sliding Window;Heap (Priority Queue);Ordered Set;Monotonic Queue;,true,false,58.90523106456257,104330,177115
2849,"Sum of Imbalance Numbers of All Subarrays",sum-of-imbalance-numbers-of-all-subarrays,false,Hard,312,8,Algorithms,45.0%,2763,false,Array;Hash Table;Ordered Set;,false,false,45.007243655094705,8388,18637
2918,"Is Array a Preorder of Some ‌Binary Tree",is-array-a-preorder-of-some-binary-tree,true,Medium,31,5,Algorithms,66.2%,2764,true,Stack;Tree;Depth-First Search;Binary Tree;,false,false,66.15460852329038,1335,2018
2870,"Longest Alternating Subarray",longest-alternating-subarray,false,Easy,223,177,Algorithms,34.2%,2765,false,Array;Enumeration;,false,false,34.17344512576649,27308,79910
2834,"Relocate Marbles",relocate-marbles,false,Medium,199,16,Algorithms,51.5%,2766,false,Array;Hash Table;Sorting;Simulation;,false,false,51.51587038003511,21716,42154
2883,"Partition String Into Minimum Beautiful Substrings",partition-string-into-minimum-beautiful-substrings,false,Medium,367,19,Algorithms,53.1%,2767,false,Hash Table;String;Dynamic Programming;Backtracking;,false,false,53.09360595674271,17969,33844
2889,"Number of Black Blocks",number-of-black-blocks,false,Medium,231,25,Algorithms,36.8%,2768,false,Array;Hash Table;Enumeration;,false,false,36.777447829801076,9041,24583
2812,"Find the Maximum Achievable Number",find-the-maximum-achievable-number,false,Easy,382,612,Algorithms,90.8%,2769,false,Math;,false,false,90.76849046757349,133921,147541
2855,"Maximum Number of Jumps to Reach the Last Index",maximum-number-of-jumps-to-reach-the-last-index,false,Medium,438,15,Algorithms,31.6%,2770,false,Array;Dynamic Programming;,false,false,31.60028980178855,29223,92477
2869,"Longest Non-decreasing Subarray From Two Arrays",longest-non-decreasing-subarray-from-two-arrays,false,Medium,608,21,Algorithms,29.8%,2771,false,Array;Dynamic Programming;,false,false,29.797071667094787,27840,93432
2878,"Apply Operations to Make All Array Elements Equal to Zero",apply-operations-to-make-all-array-elements-equal-to-zero,false,Medium,403,25,Algorithms,33.0%,2772,false,Array;Prefix Sum;,false,false,33.00280636108512,14112,42760
2944,"Height of Special Binary Tree",height-of-special-binary-tree,true,Medium,11,40,Algorithms,73.1%,2773,true,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,false,false,73.14328582145536,975,1333
2768,"Array Upper Bound",array-upper-bound,true,Easy,21,2,JavaScript,82.2%,2774,true,,true,false,82.16403162055336,1663,2024
2781,"Undefined to Null",undefined-to-null,true,Medium,15,1,JavaScript,70.0%,2775,true,,true,false,70,693,990
2782,"Convert Callback Based Function to Promise Based Function",convert-callback-based-function-to-promise-based-function,true,Medium,18,10,JavaScript,92.3%,2776,true,,true,false,92.33160621761658,891,965
2799,"Date Range Generator",date-range-generator,true,Medium,10,2,JavaScript,81.1%,2777,true,,true,false,81.09965635738831,472,582
2844,"Sum of Squares of Special Elements ",sum-of-squares-of-special-elements,false,Easy,288,119,Algorithms,81.1%,2778,false,Array;Enumeration;,false,false,81.0952776666359,79046,97473
2891,"Maximum Beauty of an Array After Applying Operation",maximum-beauty-of-an-array-after-applying-operation,false,Medium,1201,45,Algorithms,58.2%,2779,false,Array;Binary Search;Sliding Window;Sorting;,true,false,58.21497701718068,121203,208199
2888,"Minimum Index of a Valid Split",minimum-index-of-a-valid-split,false,Medium,340,13,Algorithms,61.4%,2780,false,Array;Hash Table;Sorting;,false,false,61.36547563577507,25023,40777
2884,"Length of the Longest Valid Substring",length-of-the-longest-valid-substring,false,Hard,570,26,Algorithms,37.9%,2781,false,Array;Hash Table;String;Sliding Window;,false,false,37.88711036225779,33729,89025
2995,"Number of Unique Categories",number-of-unique-categories,true,Medium,33,2,Algorithms,83.2%,2782,true,Union Find;Interactive;Counting;,true,false,83.17183462532299,2575,3096
3002,"Flight Occupancy and Waitlist Analysis",flight-occupancy-and-waitlist-analysis,true,Medium,17,6,Database,37.9%,2783,true,Database;,true,false,37.906095741017104,3302,8711
2892,"Check if Array is Good",check-if-array-is-good,false,Easy,283,51,Algorithms,49.1%,2784,false,Array;Hash Table;Sorting;,false,false,49.12068903383906,54522,110994
2887,"Sort Vowels in a String",sort-vowels-in-a-string,false,Medium,1029,59,Algorithms,80.7%,2785,false,String;Sorting;,true,false,80.67360761960715,142806,177017
2893,"Visit Array Positions to Maximize Score",visit-array-positions-to-maximize-score,false,Medium,494,30,Algorithms,36.3%,2786,false,Array;Dynamic Programming;,false,false,36.3157164655292,20944,57672
2882,"Ways to Express an Integer as Sum of Powers",ways-to-express-an-integer-as-sum-of-powers,false,Medium,426,13,Algorithms,34.2%,2787,false,Dynamic Programming;,false,false,34.1646165967231,21248,62193
2881,"Split Strings by Separator",split-strings-by-separator,false,Easy,322,12,Algorithms,75.0%,2788,false,Array;String;,false,false,75.02441965631594,62214,82925
2872,"Largest Element in an Array after Merge Operations",largest-element-in-an-array-after-merge-operations,false,Medium,475,31,Algorithms,47.1%,2789,false,Array;Greedy;,false,false,47.052028192904984,32177,68386
2919,"Maximum Number of Groups With Increasing Length",maximum-number-of-groups-with-increasing-length,false,Hard,406,42,Algorithms,20.1%,2790,false,Array;Math;Binary Search;Greedy;Sorting;,false,false,20.09405029646289,9828,48910
2905,"Count Paths That Can Form a Palindrome in a Tree",count-paths-that-can-form-a-palindrome-in-a-tree,false,Hard,401,12,Algorithms,47.4%,2791,false,Dynamic Programming;Bit Manipulation;Tree;Depth-First Search;Bitmask;,false,false,47.42857142857143,7719,16275
3016,"Count Nodes That Are Great Enough",count-nodes-that-are-great-enough,true,Hard,20,0,Algorithms,57.5%,2792,true,Divide and Conquer;Tree;Depth-First Search;Binary Tree;,false,false,57.47716894977168,1007,1752
3003,"Status of Flight Tickets",status-of-flight-tickets,true,Hard,11,21,Database,76.7%,2793,true,,false,false,76.74338715218138,2234,2911
2861,"Create Object from Two Arrays",create-object-from-two-arrays,true,Easy,10,3,JavaScript,64.7%,2794,true,,true,false,64.65696465696466,1244,1924
2898,"Parallel Execution of Promises for Individual Results Retrieval",parallel-execution-of-promises-for-individual-results-retrieval,true,Medium,14,5,JavaScript,88.8%,2795,true,,true,false,88.7780548628429,712,802
2899,"Repeat String",repeat-string,true,Easy,25,2,JavaScript,92.9%,2796,true,,true,false,92.91390728476821,2805,3019
2900,"Partial Function with Placeholders",partial-function-with-placeholders,true,Easy,11,4,JavaScript,89.2%,2797,true,,false,false,89.18305597579426,1179,1322
2876,"Number of Employees Who Met the Target",number-of-employees-who-met-the-target,false,Easy,522,71,Algorithms,87.7%,2798,false,Array;,false,false,87.74256497212605,185247,211126
2856,"Count Complete Subarrays in an Array",count-complete-subarrays-in-an-array,false,Medium,576,14,Algorithms,65.2%,2799,false,Array;Hash Table;Sliding Window;,false,false,65.18551852281965,44904,68887
2877,"Shortest String That Contains Three Strings",shortest-string-that-contains-three-strings,false,Medium,332,270,Algorithms,31.0%,2800,false,String;Greedy;Enumeration;,false,false,30.983847283406757,16669,53799
2921,"Count Stepping Numbers in Range",count-stepping-numbers-in-range,false,Hard,340,11,Algorithms,27.8%,2801,false,String;Dynamic Programming;,false,false,27.773472814154722,8602,30972
3030,"Find The K-th Lucky Number",find-the-k-th-lucky-number,true,Medium,61,12,Algorithms,76.6%,2802,true,Math;String;Bit Manipulation;,true,false,76.57633840052875,5793,7565
2901,"Factorial Generator",factorial-generator,true,Easy,19,1,JavaScript,86.0%,2803,true,,true,false,85.95641646489103,1065,1239
2907,"Array Prototype ForEach",array-prototype-foreach,true,Easy,9,9,JavaScript,88.6%,2804,true,,true,false,88.64557988645579,1093,1233
2908,"Custom Interval",custom-interval,true,Medium,16,7,JavaScript,82.4%,2805,true,,true,false,82.36272878535775,495,601
2955,"Account Balance After Rounded Purchase",account-balance-after-rounded-purchase,false,Easy,264,48,Algorithms,54.4%,2806,false,Math;,false,false,54.37272023875318,49191,90470
2903,"Insert Greatest Common Divisors in Linked List",insert-greatest-common-divisors-in-linked-list,false,Medium,1028,35,Algorithms,92.2%,2807,false,Linked List;Math;Number Theory;,true,false,92.24341536660069,231600,251075
2920,"Minimum Seconds to Equalize a Circular Array",minimum-seconds-to-equalize-a-circular-array,false,Medium,525,32,Algorithms,27.1%,2808,false,Array;Hash Table;,false,false,27.13269944882021,16294,60053
2952,"Minimum Time to Make Array Sum At Most x",minimum-time-to-make-array-sum-at-most-x,false,Hard,237,14,Algorithms,27.2%,2809,false,Array;Dynamic Programming;Sorting;,false,false,27.214198712371672,4692,17241
2886,"Faulty Keyboard",faulty-keyboard,false,Easy,445,15,Algorithms,83.6%,2810,false,String;Simulation;,false,false,83.55634958252817,91667,109707
2916,"Check if it is Possible to Split Array",check-if-it-is-possible-to-split-array,false,Medium,503,101,Algorithms,33.9%,2811,false,Array;Dynamic Programming;Greedy;,false,false,33.8722779218178,30440,89867
2914,"Find the Safest Path in a Grid",find-the-safest-path-in-a-grid,false,Medium,1662,303,Algorithms,48.6%,2812,false,Array;Binary Search;Breadth-First Search;Union Find;Matrix;,true,false,48.58854306740666,99365,204503
2894,"Maximum Elegance of a K-Length Subsequence",maximum-elegance-of-a-k-length-subsequence,false,Hard,307,5,Algorithms,32.3%,2813,false,Array;Hash Table;Stack;Greedy;Sorting;Heap (Priority Queue);,false,false,32.26026773517894,7084,21961
3043,"Minimum Time Takes to Reach Destination Without Drowning",minimum-time-takes-to-reach-destination-without-drowning,true,Hard,22,0,Algorithms,58.3%,2814,true,Array;Breadth-First Search;Matrix;,false,false,58.29528158295282,1149,1971
2902,"Max Pair Sum in an Array",max-pair-sum-in-an-array,false,Easy,392,125,Algorithms,58.6%,2815,false,Array;Hash Table;,false,false,58.60860566576902,49839,85037
2871,"Double a Number Represented as a Linked List",double-a-number-represented-as-a-linked-list,false,Medium,1175,30,Algorithms,61.4%,2816,false,Linked List;Math;Stack;,true,false,61.411804029846074,176378,287206
3000,"Minimum Absolute Difference Between Elements With Constraint",minimum-absolute-difference-between-elements-with-constraint,false,Medium,696,73,Algorithms,34.5%,2817,false,Array;Binary Search;Ordered Set;,false,false,34.536730401991825,28575,82738
3001,"Apply Operations to Maximize Score",apply-operations-to-maximize-score,false,Hard,330,11,Algorithms,32.1%,2818,false,Array;Math;Stack;Greedy;Monotonic Stack;Number Theory;,false,false,32.064206290832,7411,23113
3077,"Minimum Relative Loss After Buying Chocolates",minimum-relative-loss-after-buying-chocolates,true,Hard,17,1,Algorithms,49.4%,2819,true,Array;Binary Search;Sorting;Prefix Sum;,false,false,49.43820224719101,440,890
3078,"Election Results",election-results,true,Medium,22,3,Database,67.1%,2820,true,,false,false,67.13536701620592,2817,4196
2909,"Delay the Resolution of Each Promise",delay-the-resolution-of-each-promise,true,Medium,16,5,JavaScript,69.2%,2821,true,,true,false,69.20077972709552,710,1026
2925,"Inversion of Object",inversion-of-object,true,Easy,15,1,JavaScript,58.8%,2822,true,,false,false,58.827085852478845,973,1654
2912,"Deep Object Filter",deep-object-filter,true,Medium,15,3,JavaScript,54.6%,2823,true,,true,false,54.64037122969838,471,862
2917,"Count Pairs Whose Sum is Less than Target",count-pairs-whose-sum-is-less-than-target,false,Easy,664,73,Algorithms,87.4%,2824,false,Array;Two Pointers;Binary Search;Sorting;,false,false,87.39586245457087,187557,214606
3018,"Make String a Subsequence Using Cyclic Increments",make-string-a-subsequence-using-cyclic-increments,false,Medium,849,70,Algorithms,65.6%,2825,false,Two Pointers;String;,true,false,65.6362096770762,154251,235009
2904,"Sorting Three Groups",sorting-three-groups,false,Medium,505,91,Algorithms,41.8%,2826,false,Array;Binary Search;Dynamic Programming;,false,false,41.765943889865035,21631,51791
3017,"Number of Beautiful Integers in the Range",number-of-beautiful-integers-in-the-range,false,Hard,359,36,Algorithms,18.9%,2827,false,Math;Dynamic Programming;,false,false,18.859247315768258,10293,54578
2977,"Check if a String Is an Acronym of Words",check-if-a-string-is-an-acronym-of-words,false,Easy,336,11,Algorithms,82.9%,2828,false,Array;String;,false,false,82.85963081798997,105621,127470
2811,"Determine the Minimum Sum of a k-avoiding Array",determine-the-minimum-sum-of-a-k-avoiding-array,false,Medium,334,10,Algorithms,60.5%,2829,false,Math;Greedy;,false,false,60.544195086297115,36447,60199
2979,"Maximize the Profit as the Salesman",maximize-the-profit-as-the-salesman,false,Medium,682,22,Algorithms,36.7%,2830,false,Array;Hash Table;Binary Search;Dynamic Programming;Sorting;,false,false,36.70441048380711,23177,63145
2832,"Find the Longest Equal Subarray",find-the-longest-equal-subarray,false,Medium,697,18,Algorithms,36.1%,2831,false,Array;Hash Table;Binary Search;Sliding Window;,false,false,36.12525579403227,22773,63039
3088,"Maximal Range That Each Element Is Maximum in It",maximal-range-that-each-element-is-maximum-in-it,true,Medium,77,7,Algorithms,77.4%,2832,true,Array;Stack;Monotonic Stack;,true,false,77.42903930131004,5674,7328
3019,"Furthest Point From Origin",furthest-point-from-origin,false,Easy,248,46,Algorithms,64.7%,2833,false,String;Counting;,false,false,64.71536184087246,51804,80049
3026,"Find the Minimum Possible Sum of a Beautiful Array",find-the-minimum-possible-sum-of-a-beautiful-array,false,Medium,300,57,Algorithms,37.0%,2834,false,Math;Greedy;,false,false,37.04673433521036,30987,83643
3025,"Minimum Operations to Form Subsequence With Target Sum",minimum-operations-to-form-subsequence-with-target-sum,false,Hard,531,125,Algorithms,32.0%,2835,false,Array;Greedy;Bit Manipulation;,false,false,32.02229950900164,12522,39104
3032,"Maximize Value of Function in a Ball Passing Game",maximize-value-of-function-in-a-ball-passing-game,false,Hard,296,93,Algorithms,30.9%,2836,false,Array;Dynamic Programming;Bit Manipulation;,false,false,30.913978494623656,5175,16740
3097,"Total Traveled Distance",total-traveled-distance,true,Easy,14,4,Database,76.2%,2837,true,Database;,true,false,76.21218400331537,3678,4826
3101,"Maximum Coins Heroes Can Collect",maximum-coins-heroes-can-collect,true,Medium,71,6,Algorithms,69.8%,2838,true,Array;Two Pointers;Binary Search;Sorting;Prefix Sum;,true,false,69.82702702702703,6459,9250
2999,"Check if Strings Can be Made Equal With Operations I",check-if-strings-can-be-made-equal-with-operations-i,false,Easy,187,25,Algorithms,47.4%,2839,false,String;,false,false,47.3725203271221,40143,84739
2978,"Check if Strings Can be Made Equal With Operations II",check-if-strings-can-be-made-equal-with-operations-ii,false,Medium,258,4,Algorithms,55.9%,2840,false,Hash Table;String;Sorting;,false,false,55.92485836397972,28133,50305
2954,"Maximum Sum of Almost Unique Subarray",maximum-sum-of-almost-unique-subarray,false,Medium,292,135,Algorithms,38.8%,2841,false,Array;Hash Table;Sliding Window;,false,false,38.84699791795622,27613,71081
3057,"Count K-Subsequences of a String With Maximum Beauty",count-k-subsequences-of-a-string-with-maximum-beauty,false,Hard,342,32,Algorithms,29.5%,2842,false,Hash Table;Math;String;Greedy;Combinatorics;,false,false,29.50867180881894,13237,44858
2998,"  Count Symmetric Integers",count-symmetric-integers,false,Easy,270,15,Algorithms,74.3%,2843,false,Math;Enumeration;,false,false,74.28446453306117,50948,68585
3046,"Minimum Operations to Make a Special Number",minimum-operations-to-make-a-special-number,false,Medium,351,53,Algorithms,38.1%,2844,false,Math;String;Greedy;Enumeration;,false,false,38.09901326500276,26912,70637
2915,"Count of Interesting Subarrays",count-of-interesting-subarrays,false,Medium,506,70,Algorithms,35.5%,2845,false,Array;Hash Table;Prefix Sum;,false,false,35.497744920258526,15269,43014
3079,"Minimum Edge Weight Equilibrium Queries in a Tree",minimum-edge-weight-equilibrium-queries-in-a-tree,false,Hard,316,8,Algorithms,44.2%,2846,false,Array;Tree;Graph;Strongly Connected Component;,false,false,44.241161533954035,6795,15359
3111,"Smallest Number With Given Digit Product",smallest-number-with-given-digit-product,true,Medium,19,0,Algorithms,43.5%,2847,true,Math;Greedy;,false,false,43.48341232227489,1101,2532
3034,"Points That Intersect With Cars",points-that-intersect-with-cars,false,Easy,304,31,Algorithms,74.1%,2848,false,Array;Hash Table;Prefix Sum;,false,false,74.1364198803877,57516,77581
3056,"Determine if a Cell Is Reachable at a Given Time",determine-if-a-cell-is-reachable-at-a-given-time,false,Medium,823,759,Algorithms,35.7%,2849,false,Math;,true,false,35.65750283914376,99846,280014
3092,"Minimum Moves to Spread Stones Over Grid",minimum-moves-to-spread-stones-over-grid,false,Medium,520,72,Algorithms,44.9%,2850,false,Array;Dynamic Programming;Breadth-First Search;Matrix;,false,false,44.890108897838296,24857,55373
3024,"String Transformation",string-transformation,false,Hard,171,37,Algorithms,30.1%,2851,false,Math;String;Dynamic Programming;String Matching;,false,false,30.087128468145586,4869,16183
3148,"Sum of Remoteness of All Cells",sum-of-remoteness-of-all-cells,true,Medium,32,1,Algorithms,63.9%,2852,true,Array;Hash Table;Depth-First Search;Breadth-First Search;Union Find;Matrix;,false,false,63.90506045678459,1427,2233
3155,"Highest Salaries Difference",highest-salaries-difference,true,Easy,15,1,Database,73.4%,2853,true,Database;,false,false,73.39484089625306,3898,5311
3156,"Rolling Average Steps",rolling-average-steps,true,Medium,20,3,Database,68.1%,2854,true,Database;,false,false,68.08510638297872,3040,4465
3045,"Minimum Right Shifts to Sort the Array",minimum-right-shifts-to-sort-the-array,false,Easy,224,10,Algorithms,57.7%,2855,false,Array;,false,false,57.71747830317487,36776,63718
3081,"Minimum Array Length After Pair Removals",minimum-array-length-after-pair-removals,false,Medium,384,100,Algorithms,23.6%,2856,false,Array;Hash Table;Two Pointers;Binary Search;Greedy;Counting;,false,false,23.640275468117288,25162,106437
2953,"Count Pairs of Points With Distance k",count-pairs-of-points-with-distance-k,false,Medium,271,44,Algorithms,32.1%,2857,false,Array;Hash Table;Bit Manipulation;,false,false,32.05452775073028,11522,35945
3105,"Minimum Edge Reversals So Every Node Is Reachable",minimum-edge-reversals-so-every-node-is-reachable,false,Hard,320,5,Algorithms,57.3%,2858,false,Dynamic Programming;Depth-First Search;Breadth-First Search;Graph;,false,false,57.29264844486334,9726,16976
3093,"Sum of Values at Indices With K Set Bits",sum-of-values-at-indices-with-k-set-bits,false,Easy,279,44,Algorithms,86.0%,2859,false,Array;Bit Manipulation;,false,false,85.99490803739958,78362,91124
3104,"Happy Students",happy-students,false,Medium,171,302,Algorithms,51.6%,2860,false,Array;Sorting;Enumeration;,false,false,51.57645466847091,22869,44340
3095,"Maximum Number of Alloys",maximum-number-of-alloys,false,Medium,282,50,Algorithms,38.7%,2861,false,Array;Binary Search;,false,false,38.692606219444585,15354,39682
3047,"Maximum Element-Sum of a Complete Subset of Indices",maximum-element-sum-of-a-complete-subset-of-indices,false,Hard,216,56,Algorithms,43.0%,2862,false,Array;Math;Number Theory;,false,false,43.01655296419694,8134,18909
3158,"Maximum Length of Semi-Decreasing Subarrays",maximum-length-of-semi-decreasing-subarrays,true,Medium,131,17,Algorithms,70.4%,2863,true,Array;Stack;Sorting;Monotonic Stack;,false,false,70.37412606073545,13186,18737
3055,"Maximum Odd Binary Number",maximum-odd-binary-number,false,Easy,780,33,Algorithms,83.0%,2864,false,Math;String;Greedy;,true,false,82.96245739143396,211502,254937
3114,"Beautiful Towers I",beautiful-towers-i,false,Medium,312,51,Algorithms,43.5%,2865,false,Array;Stack;Monotonic Stack;,false,false,43.4883683645167,27125,62373
3113,"Beautiful Towers II",beautiful-towers-ii,false,Medium,425,26,Algorithms,34.5%,2866,false,Array;Stack;Monotonic Stack;,false,false,34.50279758903057,14367,41641
3112,"Count Valid Paths in a Tree",count-valid-paths-in-a-tree,false,Hard,259,7,Algorithms,35.2%,2867,false,Math;Dynamic Programming;Tree;Depth-First Search;Number Theory;,false,false,35.197672270460004,7621,21652
3173,"The Wording Game",the-wording-game,true,Hard,10,4,Algorithms,53.4%,2868,true,Array;Math;Two Pointers;String;Greedy;Game Theory;,false,false,53.442959917780065,520,973
3044,"Minimum Operations to Collect Elements",minimum-operations-to-collect-elements,false,Easy,181,20,Algorithms,60.7%,2869,false,Array;Hash Table;Bit Manipulation;,false,false,60.71180956782991,39405,64905
3094,"Minimum Number of Operations to Make Array Empty",minimum-number-of-operations-to-make-array-empty,false,Medium,1397,68,Algorithms,61.9%,2870,false,Array;Hash Table;Greedy;Counting;,true,false,61.943547769194126,185944,300183
3080,"Split Array Into Maximum Number of Subarrays",split-array-into-maximum-number-of-subarrays,false,Medium,226,31,Algorithms,43.3%,2871,false,Array;Greedy;Bit Manipulation;,false,false,43.25722440242597,16975,39242
3058,"Maximum Number of K-Divisible Components",maximum-number-of-k-divisible-components,false,Hard,675,26,Algorithms,70.3%,2872,false,Tree;Depth-First Search;,true,false,70.34852593977374,80150,113933
3154,"Maximum Value of an Ordered Triplet I",maximum-value-of-an-ordered-triplet-i,false,Easy,176,16,Algorithms,46.1%,2873,false,Array;,false,false,46.09562467762553,41109,89178
3152,"Maximum Value of an Ordered Triplet II",maximum-value-of-an-ordered-triplet-ii,false,Medium,289,9,Algorithms,40.9%,2874,false,Array;,false,false,40.92130630367471,28018,68468
3141,"Minimum Size Subarray in Infinite Array",minimum-size-subarray-in-infinite-array,false,Medium,387,29,Algorithms,31.0%,2875,false,Array;Hash Table;Sliding Window;Prefix Sum;,false,false,30.95252225519288,20862,67400
3140,"Count Visited Nodes in a Directed Graph",count-visited-nodes-in-a-directed-graph,false,Hard,331,6,Algorithms,32.7%,2876,false,Dynamic Programming;Graph;Memoization;,false,false,32.664674100471316,11366,34796
3062,"Create a DataFrame from List",create-a-dataframe-from-list,false,Easy,217,9,pandas,81.4%,2877,false,,true,false,81.37594168405225,163433,200834
3076,"Get the Size of a DataFrame",get-the-size-of-a-dataframe,false,Easy,111,10,pandas,85.1%,2878,false,,true,false,85.07771951682645,127690,150087
3065,"Display the First Three Rows",display-the-first-three-rows,false,Easy,93,21,pandas,93.0%,2879,false,,true,false,92.98741831659027,133476,143542
3074,"Select Data",select-data,false,Easy,98,8,pandas,79.3%,2880,false,,true,false,79.29688084374298,106010,133685
3066,"Create a New Column",create-a-new-column,false,Easy,85,6,pandas,90.2%,2881,false,,true,false,90.22221415673856,99431,110207
3071,"Drop Duplicate Rows",drop-duplicate-rows,false,Easy,104,6,pandas,85.7%,2882,false,,true,false,85.66444959843591,89384,104342
3075,"Drop Missing Data",drop-missing-data,false,Easy,74,5,pandas,64.1%,2883,false,,true,false,64.14634334518914,83142,129613
3067,"Modify Columns",modify-columns,false,Easy,73,5,pandas,92.3%,2884,false,,true,false,92.30369955727444,90689,98251
3068,"Rename Columns",rename-columns,false,Easy,64,3,pandas,85.5%,2885,false,,true,false,85.538056886976,78699,92005
3069,"Change Data Type",change-data-type,false,Easy,67,7,pandas,87.4%,2886,false,,true,false,87.40697687670233,76695,87745
3070,"Fill Missing Data",fill-missing-data,false,Easy,73,3,pandas,72.1%,2887,false,,true,false,72.06419316843345,73419,101877
3064,"Reshape Data: Concatenate",reshape-data-concatenate,false,Easy,70,7,pandas,90.7%,2888,false,,true,false,90.7132278614918,77177,85078
3072,"Reshape Data: Pivot",reshape-data-pivot,false,Easy,103,14,pandas,83.2%,2889,false,,true,false,83.24423868839041,65092,78194
3073,"Reshape Data: Melt",reshape-data-melt,false,Easy,84,3,pandas,86.2%,2890,false,,true,false,86.17938615555026,61462,71317
3063,"Method Chaining",method-chaining,false,Easy,82,6,pandas,76.6%,2891,false,,true,false,76.55131838048125,63754,83283
3177,"Minimizing Array After Replacing Pairs With Their Product",minimizing-array-after-replacing-pairs-with-their-product,true,Medium,26,1,Algorithms,40.8%,2892,true,Array;Dynamic Programming;Greedy;,false,false,40.78266494178525,1261,3092
3160,"Calculate Orders Within Each Interval",calculate-orders-within-each-interval,true,Medium,20,3,Database,67.1%,2893,true,Database;,false,false,67.09741550695824,2700,4024
3172,"Divisible and Non-divisible Sums Difference",divisible-and-non-divisible-sums-difference,false,Easy,234,20,Algorithms,89.0%,2894,false,Math;,false,false,89.03063372572795,105730,118757
3151,"Minimum Processing Time",minimum-processing-time,false,Medium,264,45,Algorithms,69.4%,2895,false,Array;Greedy;Sorting;,false,false,69.36777497458297,36844,53114
3033,"Apply Operations to Make Two Strings Equal",apply-operations-to-make-two-strings-equal,false,Medium,362,71,Algorithms,27.2%,2896,false,String;Dynamic Programming;,false,false,27.188809490070646,13431,49399
3153,"Apply Operations on Array to Maximize Sum of Squares",apply-operations-on-array-to-maximize-sum-of-squares,false,Hard,185,4,Algorithms,45.4%,2897,false,Array;Hash Table;Greedy;Bit Manipulation;,false,false,45.40746287283165,7277,16026
3182,"Maximum Linear Stock Score",maximum-linear-stock-score,true,Medium,22,4,Algorithms,64.0%,2898,true,Array;Hash Table;,false,false,64.00264200792603,969,1514
3164,"Last Visited Integers",last-visited-integers,false,Easy,158,217,Algorithms,65.3%,2899,false,Array;Simulation;,false,false,65.32200990799717,28613,43803
3143,"Longest Unequal Adjacent Groups Subsequence I",longest-unequal-adjacent-groups-subsequence-i,false,Easy,192,90,Algorithms,60.5%,2900,false,Array;String;Dynamic Programming;Greedy;,false,false,60.498032225614594,34280,56663
3142,"Longest Unequal Adjacent Groups Subsequence II",longest-unequal-adjacent-groups-subsequence-ii,false,Medium,198,22,Algorithms,27.3%,2901,false,Array;String;Dynamic Programming;,false,false,27.253022494099515,11316,41522
3091,"Count of Sub-Multisets With Bounded Sum",count-of-sub-multisets-with-bounded-sum,false,Hard,153,25,Algorithms,21.3%,2902,false,Array;Hash Table;Dynamic Programming;Sliding Window;,false,false,21.266905879105714,4623,21738
3165,"Find Indices With Index and Value Difference I",find-indices-with-index-and-value-difference-i,false,Easy,146,16,Algorithms,61.2%,2903,false,Array;Two Pointers;,false,false,61.17547925005267,43560,71205
3150,"Shortest and Lexicographically Smallest Beautiful String",shortest-and-lexicographically-smallest-beautiful-string,false,Medium,189,11,Algorithms,39.5%,2904,false,String;Sliding Window;,false,false,39.49787429621969,27499,69623
3170,"Find Indices With Index and Value Difference II",find-indices-with-index-and-value-difference-ii,false,Medium,272,10,Algorithms,32.0%,2905,false,Array;Two Pointers;,false,false,31.965174129353237,19275,60300
3031,"Construct Product Matrix",construct-product-matrix,false,Medium,229,18,Algorithms,30.7%,2906,false,Array;Matrix;Prefix Sum;,false,false,30.738893399837607,13250,43105
3187,"Maximum Profitable Triplets With Increasing Prices I",maximum-profitable-triplets-with-increasing-prices-i,true,Medium,19,1,Algorithms,55.8%,2907,true,Array;Binary Indexed Tree;Segment Tree;,false,false,55.79073482428115,1397,2504
3176,"Minimum Sum of Mountain Triplets I",minimum-sum-of-mountain-triplets-i,false,Easy,165,10,Algorithms,65.1%,2908,false,Array;,false,false,65.05819886196579,37616,57819
3186,"Minimum Sum of Mountain Triplets II",minimum-sum-of-mountain-triplets-ii,false,Medium,202,9,Algorithms,53.3%,2909,false,Array;,false,false,53.277155525668775,25353,47587
3166,"Minimum Number of Groups to Create a Valid Assignment",minimum-number-of-groups-to-create-a-valid-assignment,false,Medium,375,182,Algorithms,24.6%,2910,false,Array;Hash Table;Greedy;,false,false,24.585783003741316,13340,54259
2879,"Minimum Changes to Make K Semi-palindromes",minimum-changes-to-make-k-semi-palindromes,false,Hard,124,103,Algorithms,35.4%,2911,false,Two Pointers;String;Dynamic Programming;,false,false,35.37001581619912,4249,12013
3198,"Number of Ways to Reach Destination in the Grid",number-of-ways-to-reach-destination-in-the-grid,true,Hard,15,4,Algorithms,59.9%,2912,true,Math;Dynamic Programming;Combinatorics;,false,false,59.856201318154575,999,1669
3163,"Subarrays Distinct Element Sum of Squares I",subarrays-distinct-element-sum-of-squares-i,false,Easy,158,31,Algorithms,81.8%,2913,false,Array;Hash Table;,false,false,81.81017978566555,37177,45443
3174,"Minimum Number of Changes to Make Binary String Beautiful",minimum-number-of-changes-to-make-binary-string-beautiful,false,Medium,647,109,Algorithms,77.0%,2914,false,String;,true,false,76.95328361608779,155401,201942
3106,"Length of the Longest Subsequence That Sums to Target",length-of-the-longest-subsequence-that-sums-to-target,false,Medium,243,28,Algorithms,36.4%,2915,false,Array;Dynamic Programming;,false,false,36.36782204572596,25275,69500
3139,"Subarrays Distinct Element Sum of Squares II",subarrays-distinct-element-sum-of-squares-ii,false,Hard,147,8,Algorithms,21.3%,2916,false,Array;Dynamic Programming;Binary Indexed Tree;Segment Tree;,false,false,21.335761991499698,3514,16470
3183,"Find the K-or of an Array",find-the-k-or-of-an-array,false,Easy,227,271,Algorithms,73.4%,2917,false,Array;Bit Manipulation;,false,false,73.44942930827567,28765,39163
3171,"Minimum Equal Sum of Two Arrays After Replacing Zeros",minimum-equal-sum-of-two-arrays-after-replacing-zeros,false,Medium,185,20,Algorithms,36.1%,2918,false,Array;Greedy;,false,false,36.056338028169016,30334,84133
3178,"Minimum Increment Operations to Make Array Beautiful",minimum-increment-operations-to-make-array-beautiful,false,Medium,330,20,Algorithms,34.1%,2919,false,Array;Dynamic Programming;,false,false,34.121824134273986,14800,43374
3179,"Maximum Points After Collecting Coins From All Nodes",maximum-points-after-collecting-coins-from-all-nodes,false,Hard,204,17,Algorithms,36.2%,2920,false,Array;Dynamic Programming;Bit Manipulation;Tree;Depth-First Search;,false,false,36.1901916428358,8479,23429
3204,"Maximum Profitable Triplets With Increasing Prices II",maximum-profitable-triplets-with-increasing-prices-ii,true,Hard,8,0,Algorithms,45.6%,2921,true,Array;Binary Indexed Tree;Segment Tree;,false,false,45.588235294117645,527,1156
3205,"Market Analysis III",market-analysis-iii,true,Medium,15,5,Database,41.0%,2922,true,Database;,false,false,41.01700623000505,2436,5939
3188,"Find Champion I",find-champion-i,false,Easy,167,46,Algorithms,74.1%,2923,false,Array;Matrix;,false,false,74.0733255864868,43984,59379
3189,"Find Champion II",find-champion-ii,false,Medium,550,44,Algorithms,70.3%,2924,false,Graph;,true,false,70.30889891267118,121112,172257
3191,"Maximum Score After Applying Operations on a Tree",maximum-score-after-applying-operations-on-a-tree,false,Medium,335,71,Algorithms,48.3%,2925,false,Dynamic Programming;Tree;Depth-First Search;,false,false,48.291304946947776,14017,29025
3184,"Maximum Balanced Subsequence Sum",maximum-balanced-subsequence-sum,false,Hard,216,10,Algorithms,24.2%,2926,false,Array;Binary Search;Dynamic Programming;Binary Indexed Tree;Segment Tree;,false,false,24.201337295690937,6515,26919
3216,"Distribute Candies Among Children III",distribute-candies-among-children-iii,true,Hard,11,0,Algorithms,44.0%,2927,true,Math;Combinatorics;,false,false,44.01679496151154,629,1429
3199,"Distribute Candies Among Children I",distribute-candies-among-children-i,false,Easy,115,50,Algorithms,74.6%,2928,false,Math;Combinatorics;Enumeration;,false,false,74.5614491697465,28648,38422
3201,"Distribute Candies Among Children II",distribute-candies-among-children-ii,false,Medium,98,111,Algorithms,35.3%,2929,false,Math;Combinatorics;Enumeration;,false,false,35.32102813623863,13357,37816
3200,"Number of Strings Which Can Be Rearranged to Contain Substring",number-of-strings-which-can-be-rearranged-to-contain-substring,false,Medium,175,69,Algorithms,55.1%,2930,false,Math;Dynamic Programming;Combinatorics;,false,false,55.098577892695545,6819,12376
3107,"Maximum Spending After Buying Items",maximum-spending-after-buying-items,false,Hard,100,31,Algorithms,61.2%,2931,false,Array;Greedy;Sorting;Heap (Priority Queue);Matrix;,false,false,61.15081831365238,11807,19308
3193,"Maximum Strong Pair XOR I",maximum-strong-pair-xor-i,false,Easy,156,21,Algorithms,75.0%,2932,false,Array;Hash Table;Bit Manipulation;Trie;Sliding Window;,false,false,74.97367739708294,43435,57934
3202,"High-Access Employees",high-access-employees,false,Medium,202,21,Algorithms,44.7%,2933,false,Array;Hash Table;String;Sorting;,false,false,44.703899855560906,24141,54002
3190,"Minimum Operations to Maximize Last Elements in Arrays",minimum-operations-to-maximize-last-elements-in-arrays,false,Medium,191,16,Algorithms,44.5%,2934,false,Array;Enumeration;,false,false,44.49182900617515,13039,29308
3197,"Maximum Strong Pair XOR II",maximum-strong-pair-xor-ii,false,Hard,189,1,Algorithms,30.0%,2935,false,Array;Hash Table;Bit Manipulation;Trie;Sliding Window;,false,false,30.048193836494676,6796,22617
3222,"Number of Equal Numbers Blocks",number-of-equal-numbers-blocks,true,Medium,21,8,Algorithms,63.3%,2936,true,Array;Binary Search;Interactive;,false,false,63.28471781864299,1996,3154
3207,"Make Three Strings Equal",make-three-strings-equal,false,Easy,304,41,Algorithms,43.5%,2937,false,String;,false,false,43.52928437038942,32159,73879
3195,"Separate Black and White Balls",separate-black-and-white-balls,false,Medium,808,40,Algorithms,64.8%,2938,false,Two Pointers;String;Greedy;,true,false,64.76791336798509,164354,253760
3192,"Maximum Xor Product",maximum-xor-product,false,Medium,214,70,Algorithms,26.8%,2939,false,Math;Greedy;Bit Manipulation;,false,false,26.83034325417401,10349,38572
3181,"Find Building Where Alice and Bob Can Meet",find-building-where-alice-and-bob-can-meet,false,Hard,749,54,Algorithms,53.0%,2940,false,Array;Binary Search;Stack;Binary Indexed Tree;Segment Tree;Heap (Priority Queue);Monotonic Stack;,true,false,53.02921513251321,66470,125345
3232,"Maximum GCD-Sum of a Subarray",maximum-gcd-sum-of-a-subarray,true,Hard,15,1,Algorithms,41.6%,2941,true,Array;Math;Binary Search;Number Theory;,false,false,41.62436548223351,492,1182
3194,"Find Words Containing Character",find-words-containing-character,false,Easy,374,31,Algorithms,88.6%,2942,false,Array;String;,false,false,88.55653865048696,174852,197447
3214,"Maximize Area of Square Hole in Grid",maximize-area-of-square-hole-in-grid,false,Medium,232,151,Algorithms,37.0%,2943,false,Array;Sorting;,false,false,37.007803657592184,12425,33574
3209,"Minimum Number of Coins for Fruits",minimum-number-of-coins-for-fruits,false,Medium,271,49,Algorithms,46.4%,2944,false,Array;Dynamic Programming;Queue;Heap (Priority Queue);Monotonic Queue;,false,false,46.38529151713736,17837,38454
3211,"Find Maximum Non-decreasing Array Length",find-maximum-non-decreasing-array-length,false,Hard,185,22,Algorithms,16.6%,2945,false,Array;Binary Search;Dynamic Programming;Stack;Queue;Monotonic Stack;Monotonic Queue;,false,false,16.62552020878888,4714,28354
3215,"Matrix Similarity After Cyclic Shifts",matrix-similarity-after-cyclic-shifts,false,Easy,178,66,Algorithms,58.5%,2946,false,Array;Math;Matrix;Simulation;,false,false,58.53860484371766,25452,43479
3210,"Count Beautiful Substrings I",count-beautiful-substrings-i,false,Medium,149,13,Algorithms,61.0%,2947,false,Hash Table;Math;String;Enumeration;Number Theory;Prefix Sum;,false,false,61.0248783126014,22567,36980
3219,"Make Lexicographically Smallest Array by Swapping Elements",make-lexicographically-smallest-array-by-swapping-elements,false,Medium,275,14,Algorithms,39.1%,2948,false,Array;Union Find;Sorting;,false,false,39.1449280979883,10099,25799
3208,"Count Beautiful Substrings II",count-beautiful-substrings-ii,false,Hard,191,7,Algorithms,25.7%,2949,false,Hash Table;Math;String;Number Theory;Prefix Sum;,false,false,25.665011526866465,5789,22556
3237,"Number of Divisible Substrings",number-of-divisible-substrings,true,Medium,27,5,Algorithms,73.7%,2950,true,Hash Table;String;Counting;Prefix Sum;,false,false,73.65402994584262,2312,3139
3221,"Find the Peaks",find-the-peaks,false,Easy,173,17,Algorithms,75.0%,2951,false,Array;Enumeration;,false,false,75.0085295121119,57159,76204
3231,"Minimum Number of Coins to be Added",minimum-number-of-coins-to-be-added,false,Medium,377,59,Algorithms,56.9%,2952,false,Array;Greedy;Sorting;,false,false,56.94787469127779,21905,38465
3223,"Count Complete Substrings",count-complete-substrings,false,Hard,215,36,Algorithms,27.7%,2953,false,Hash Table;String;Sliding Window;,false,false,27.712807427882915,7820,28218
3224,"Count the Number of Infection Sequences",count-the-number-of-infection-sequences,false,Hard,119,27,Algorithms,34.8%,2954,false,Array;Math;Combinatorics;,false,false,34.79648071159238,3599,10343
3247,"Number of Same-End Substrings",number-of-same-end-substrings,true,Medium,83,17,Algorithms,61.7%,2955,true,Array;Hash Table;String;Counting;Prefix Sum;,true,false,61.67743830787309,8398,13616
3206,"Find Common Elements Between Two Arrays",find-common-elements-between-two-arrays,false,Easy,242,96,Algorithms,83.9%,2956,false,Array;Hash Table;,false,false,83.89583888882449,72361,86251
3230,"Remove Adjacent Almost-Equal Characters",remove-adjacent-almost-equal-characters,false,Medium,178,22,Algorithms,52.1%,2957,false,String;Dynamic Programming;Greedy;,false,false,52.07593226249373,23894,45883
3225,"Length of Longest Subarray With at Most K Frequency",length-of-longest-subarray-with-at-most-k-frequency,false,Medium,1079,33,Algorithms,55.8%,2958,false,Array;Hash Table;Sliding Window;,true,false,55.83142031017261,159301,285325
3217,"Number of Possible Sets of Closing Branches",number-of-possible-sets-of-closing-branches,false,Hard,169,14,Algorithms,50.6%,2959,false,Bit Manipulation;Graph;Heap (Priority Queue);Enumeration;Shortest Path;,false,false,50.633484162895925,7833,15470
3220,"Count Tested Devices After Test Operations",count-tested-devices-after-test-operations,false,Easy,150,13,Algorithms,79.6%,2960,false,Array;Simulation;Counting;,false,false,79.60926676136862,45394,57021
3234,"Double Modular Exponentiation",double-modular-exponentiation,false,Medium,115,20,Algorithms,48.0%,2961,false,Array;Math;Simulation;,false,false,48.0122192582394,22318,46484
3213,"Count Subarrays Where Max Element Appears at Least K Times",count-subarrays-where-max-element-appears-at-least-k-times,false,Medium,1255,62,Algorithms,58.7%,2962,false,Array;Sliding Window;,true,false,58.663930203148354,137774,234853
3212,"Count the Number of Good Partitions",count-the-number-of-good-partitions,false,Hard,254,3,Algorithms,47.3%,2963,false,Array;Hash Table;Math;Combinatorics;,false,false,47.33020599632878,11603,24515
3254,"Number of Divisible Triplet Sums",number-of-divisible-triplet-sums,true,Medium,27,4,Algorithms,64.3%,2964,true,Array;Hash Table;,false,false,64.31322207958921,3507,5453
3227,"Find Missing and Repeated Values",find-missing-and-repeated-values,false,Easy,255,15,Algorithms,76.2%,2965,false,Array;Hash Table;Math;Matrix;,false,false,76.1869995016746,65738,86286
3241,"Divide Array Into Arrays With Max Difference",divide-array-into-arrays-with-max-difference,false,Medium,844,195,Algorithms,71.8%,2966,false,Array;Greedy;Sorting;,true,false,71.84647637477826,155931,217034
3229,"Minimum Cost to Make Array Equalindromic",minimum-cost-to-make-array-equalindromic,false,Medium,231,95,Algorithms,22.2%,2967,false,Array;Math;Binary Search;Greedy;Sorting;,false,false,22.237624719934235,13796,62039
3196,"Apply Operations to Maximize Frequency Score",apply-operations-to-maximize-frequency-score,false,Hard,258,6,Algorithms,37.2%,2968,false,Array;Binary Search;Sliding Window;Sorting;Prefix Sum;,false,false,37.17422532320952,7246,19492
3268,"Minimum Number of Coins for Fruits II",minimum-number-of-coins-for-fruits-ii,true,Hard,20,0,Algorithms,48.3%,2969,true,Array;Dynamic Programming;Queue;Heap (Priority Queue);Monotonic Queue;,false,false,48.28060522696011,702,1454
3252,"Count the Number of Incremovable Subarrays I",count-the-number-of-incremovable-subarrays-i,false,Easy,173,108,Algorithms,54.0%,2970,false,Array;Two Pointers;Binary Search;Enumeration;,false,false,54.02479961635953,23658,43791
3262,"Find Polygon With the Largest Perimeter",find-polygon-with-the-largest-perimeter,false,Medium,799,69,Algorithms,65.7%,2971,false,Array;Greedy;Sorting;Prefix Sum;,true,false,65.7169051814288,137625,209421
3248,"Count the Number of Incremovable Subarrays II",count-the-number-of-incremovable-subarrays-ii,false,Hard,224,19,Algorithms,39.8%,2972,false,Array;Two Pointers;Binary Search;,false,false,39.84135568775915,8840,22188
3218,"Find Number of Coins to Place in Tree Nodes",find-number-of-coins-to-place-in-tree-nodes,false,Hard,183,19,Algorithms,36.6%,2973,false,Dynamic Programming;Tree;Depth-First Search;Sorting;Heap (Priority Queue);,false,false,36.59515795449937,9024,24659
3226,"Minimum Number Game",minimum-number-game,false,Easy,244,20,Algorithms,85.5%,2974,false,Array;Sorting;Heap (Priority Queue);Simulation;,false,false,85.54702923554962,99664,116502
3250,"Maximum Square Area by Removing Fences From a Field",maximum-square-area-by-removing-fences-from-a-field,false,Medium,143,118,Algorithms,23.7%,2975,false,Array;Hash Table;Enumeration;,false,false,23.70278829072372,15344,64735
3235,"Minimum Cost to Convert String I",minimum-cost-to-convert-string-i,false,Medium,895,62,Algorithms,58.1%,2976,false,Array;String;Graph;Shortest Path;,true,false,58.09616724738675,104205,179370
3238,"Minimum Cost to Convert String II",minimum-cost-to-convert-string-ii,false,Hard,105,76,Algorithms,25.5%,2977,false,Array;String;Dynamic Programming;Graph;Trie;Shortest Path;,false,false,25.510590015128592,5396,21152
3253,"Symmetric Coordinates",symmetric-coordinates,true,Medium,10,3,Database,41.0%,2978,true,Database;,false,false,41.030701754385966,1871,4560
3273,"Most Expensive Item That Can Not Be Bought",most-expensive-item-that-can-not-be-bought,true,Medium,20,26,Algorithms,80.3%,2979,true,Math;Dynamic Programming;Number Theory;,false,false,80.33608490566037,5450,6784
3246,"Check if Bitwise OR Has Trailing Zeros",check-if-bitwise-or-has-trailing-zeros,false,Easy,109,9,Algorithms,70.1%,2980,false,Array;Bit Manipulation;,false,false,70.1496475555053,37220,53058
3267,"Find Longest Special Substring That Occurs Thrice I",find-longest-special-substring-that-occurs-thrice-i,false,Medium,682,65,Algorithms,62.3%,2981,false,Hash Table;String;Binary Search;Sliding Window;Counting;,true,false,62.29275225011843,122294,196321
3266,"Find Longest Special Substring That Occurs Thrice II",find-longest-special-substring-that-occurs-thrice-ii,false,Medium,370,29,Algorithms,38.6%,2982,false,Hash Table;String;Binary Search;Sliding Window;Counting;,true,false,38.56928021702592,26160,67826
3203,"Palindrome Rearrangement Queries",palindrome-rearrangement-queries,false,Hard,90,25,Algorithms,25.4%,2983,false,Hash Table;String;Prefix Sum;,false,false,25.37313432835821,3417,13467
3281,"Find Peak Calling Hours for Each City",find-peak-calling-hours-for-each-city,true,Medium,9,5,Database,61.6%,2984,true,Database;,false,false,61.575178997613364,2322,3771
3282,"Calculate Compressed Mean",calculate-compressed-mean,true,Easy,8,5,Database,88.1%,2985,true,Database;,false,false,88.13048933500627,3512,3985
3283,"Find Third Transaction",find-third-transaction,true,Medium,12,9,Database,53.0%,2986,true,Database;,false,false,53.02871515405575,2530,4771
3284,"Find Expensive Cities",find-expensive-cities,true,Easy,9,8,Database,80.0%,2987,true,Database;,false,false,80.00443852640923,3605,4506
3285,"Manager of the Largest Department",manager-of-the-largest-department,true,Medium,5,1,Database,80.0%,2988,true,Database;,false,false,79.99420121774428,2759,3449
3286,"Class Performance",class-performance,true,Medium,8,2,Database,89.9%,2989,true,Database;,false,false,89.94358597007603,3667,4077
3287,"Loan Types",loan-types,true,Easy,14,8,Database,63.5%,2990,true,Database;,false,false,63.479729729729726,3758,5920
3288,"Top Three Wineries ",top-three-wineries,true,Hard,11,5,Database,56.2%,2991,true,Database;,false,false,56.166019707375334,1881,3349
3294,"Number of Self-Divisible Permutations",number-of-self-divisible-permutations,true,Medium,18,0,Algorithms,72.4%,2992,true,Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,false,false,72.38437359676695,1612,2227
3300,"Friday Purchases I",friday-purchases-i,true,Medium,13,4,Database,79.5%,2993,true,Database;,false,false,79.46954813359528,2427,3054
3301,"Friday Purchases II ",friday-purchases-ii,true,Hard,11,4,Database,74.5%,2994,true,Database;,false,false,74.46094873023479,1554,2087
3302,"Viewers Turned Streamers",viewers-turned-streamers,true,Hard,9,6,Database,43.1%,2995,true,Database;,false,false,43.05025996533796,2484,5770
3236,"Smallest Missing Integer Greater Than Sequential Prefix Sum",smallest-missing-integer-greater-than-sequential-prefix-sum,false,Easy,125,260,Algorithms,33.2%,2996,false,Array;Hash Table;Sorting;,false,false,33.20056819764365,35760,107707
3249,"Minimum Number of Operations to Make Array XOR Equal to K",minimum-number-of-operations-to-make-array-xor-equal-to-k,false,Medium,591,55,Algorithms,85.9%,2997,false,Array;Bit Manipulation;,true,false,85.87196966276917,114129,132906
3239,"Minimum Number of Operations to Make X and Y Equal",minimum-number-of-operations-to-make-x-and-y-equal,false,Medium,263,22,Algorithms,47.3%,2998,false,Dynamic Programming;Breadth-First Search;Memoization;,false,false,47.33320788642874,22639,47829
3243,"Count the Number of Powerful Integers",count-the-number-of-powerful-integers,false,Hard,109,9,Algorithms,26.5%,2999,false,Math;String;Dynamic Programming;,false,false,26.500903717453962,5425,20471
3251,"Maximum Area of Longest Diagonal Rectangle",maximum-area-of-longest-diagonal-rectangle,false,Easy,109,17,Algorithms,36.5%,3000,false,Array;,false,false,36.47099396018194,39129,107288
3270,"Minimum Moves to Capture The Queen",minimum-moves-to-capture-the-queen,false,Medium,165,201,Algorithms,21.2%,3001,false,Math;Enumeration;,false,false,21.21212121212121,19096,90024
3228,"Maximum Size of a Set After Removals",maximum-size-of-a-set-after-removals,false,Medium,293,24,Algorithms,45.4%,3002,false,Array;Hash Table;Greedy;,false,false,45.43414972890682,17011,37441
3233,"Maximize the Number of Partitions After Operations",maximize-the-number-of-partitions-after-operations,false,Hard,139,29,Algorithms,27.0%,3003,false,String;Dynamic Programming;Bit Manipulation;Bitmask;,false,false,26.99364345564866,3737,13844
3304,"Maximum Subtree of the Same Color",maximum-subtree-of-the-same-color,true,Medium,20,0,Algorithms,62.6%,3004,true,Array;Dynamic Programming;Tree;Depth-First Search;,false,false,62.620053784095276,1630,2603
3242,"Count Elements With Maximum Frequency",count-elements-with-maximum-frequency,false,Easy,668,69,Algorithms,78.4%,3005,false,Array;Hash Table;Counting;,true,false,78.37004374550858,224654,286658
3245,"Find Beautiful Indices in the Given Array I",find-beautiful-indices-in-the-given-array-i,false,Medium,165,33,Algorithms,37.3%,3006,false,Two Pointers;String;Binary Search;Rolling Hash;String Matching;Hash Function;,false,false,37.2568093385214,30257,81212
3240,"Maximum Number That Sum of the Prices Is Less Than or Equal to K",maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k,false,Medium,309,124,Algorithms,36.6%,3007,false,Binary Search;Dynamic Programming;Bit Manipulation;,false,false,36.62750768118561,10133,27665
3303,"Find Beautiful Indices in the Given Array II",find-beautiful-indices-in-the-given-array-ii,false,Hard,178,14,Algorithms,25.5%,3008,false,Two Pointers;String;Binary Search;Rolling Hash;String Matching;Hash Function;,false,false,25.451084585795297,12836,50434
3315,"Maximum Number of Intersections on the Chart",maximum-number-of-intersections-on-the-chart,true,Hard,29,4,Algorithms,45.4%,3009,true,Array;Math;Binary Indexed Tree;Geometry;,false,false,45.43561263450191,3927,8643
3263,"Divide an Array Into Subarrays With Minimum Cost I",divide-an-array-into-subarrays-with-minimum-cost-i,false,Easy,100,10,Algorithms,66.0%,3010,false,Array;Sorting;Enumeration;,false,false,66.03169960329794,36120,54701
3291,"Find if Array Can Be Sorted",find-if-array-can-be-sorted,false,Medium,672,61,Algorithms,67.0%,3011,false,Array;Bit Manipulation;Sorting;,true,false,67.03018197749189,142291,212279
3244,"Minimize Length of Array Using Operations",minimize-length-of-array-using-operations,false,Medium,173,43,Algorithms,34.8%,3012,false,Array;Math;Greedy;Number Theory;,false,false,34.76911589705299,14901,42857
3260,"Divide an Array Into Subarrays With Minimum Cost II",divide-an-array-into-subarrays-with-minimum-cost-ii,false,Hard,124,19,Algorithms,30.9%,3013,false,Array;Hash Table;Sliding Window;Heap (Priority Queue);,false,false,30.879446640316203,5625,18216
3275,"Minimum Number of Pushes to Type Word I",minimum-number-of-pushes-to-type-word-i,false,Easy,167,29,Algorithms,66.2%,3014,false,Math;String;Greedy;,false,false,66.22924925198585,43606,65841
3271,"Count the Number of Houses at a Certain Distance I",count-the-number-of-houses-at-a-certain-distance-i,false,Medium,163,40,Algorithms,56.5%,3015,false,Breadth-First Search;Graph;Prefix Sum;,false,false,56.52543272804502,21292,37668
3276,"Minimum Number of Pushes to Type Word II",minimum-number-of-pushes-to-type-word-ii,false,Medium,748,74,Algorithms,80.4%,3016,false,Hash Table;String;Greedy;Sorting;Counting;,true,false,80.35964343818401,177324,220663
3310,"Count the Number of Houses at a Certain Distance II",count-the-number-of-houses-at-a-certain-distance-ii,false,Hard,84,24,Algorithms,21.4%,3017,false,Graph;Prefix Sum;,false,false,21.37070849942137,3324,15554
3323,"Maximum Number of Removal Queries That Can Be Processed I",maximum-number-of-removal-queries-that-can-be-processed-i,true,Hard,5,2,Algorithms,43.9%,3018,true,Array;Dynamic Programming;,false,false,43.88111888111888,502,1144
3312,"Number of Changing Keys",number-of-changing-keys,false,Easy,126,13,Algorithms,80.1%,3019,false,String;,false,false,80.1215830725344,57859,72214
3299,"Find the Maximum Number of Elements in Subset",find-the-maximum-number-of-elements-in-subset,false,Medium,198,42,Algorithms,26.2%,3020,false,Array;Hash Table;Enumeration;,false,false,26.19349655376549,24778,94596
3279,"Alice and Bob Playing Flower Game",alice-and-bob-playing-flower-game,false,Medium,92,78,Algorithms,47.9%,3021,false,Math;,false,false,47.901621945873615,20762,43343
3261,"Minimize OR of Remaining Elements Using Operations",minimize-or-of-remaining-elements-using-operations,false,Hard,93,15,Algorithms,30.8%,3022,false,Array;Greedy;Bit Manipulation;,false,false,30.76923076923077,3376,10972
3333,"Find Pattern in Infinite Stream I",find-pattern-in-infinite-stream-i,true,Medium,11,2,Algorithms,58.4%,3023,true,Array;Sliding Window;Rolling Hash;String Matching;Hash Function;,false,false,58.38365071992568,1257,2153
3321,"Type of Triangle",type-of-triangle,false,Easy,111,18,Algorithms,38.3%,3024,false,Array;Math;Sorting;,false,false,38.31799799147735,56470,147372
3278,"Find the Number of Ways to Place People I",find-the-number-of-ways-to-place-people-i,false,Medium,88,74,Algorithms,41.1%,3025,false,Array;Math;Geometry;Sorting;Enumeration;,false,false,41.06148331954784,14893,36268
3265,"Maximum Good Subarray Sum",maximum-good-subarray-sum,false,Medium,384,20,Algorithms,19.7%,3026,false,Array;Hash Table;Prefix Sum;,false,false,19.72985607907303,23634,119788
3277,"Find the Number of Ways to Place People II",find-the-number-of-ways-to-place-people-ii,false,Hard,101,19,Algorithms,46.6%,3027,false,Array;Math;Geometry;Sorting;Enumeration;,false,false,46.62706100133454,10831,23229
3311,"Ant on the Boundary",ant-on-the-boundary,false,Easy,126,43,Algorithms,74.7%,3028,false,Array;Simulation;Prefix Sum;,false,false,74.6821455673452,56095,75112
3297,"Minimum Time to Revert Word to Initial State I",minimum-time-to-revert-word-to-initial-state-i,false,Medium,149,33,Algorithms,41.2%,3029,false,String;Rolling Hash;String Matching;Hash Function;,false,false,41.18282526712759,20967,50912
3272,"Find the Grid of Region Average",find-the-grid-of-region-average,false,Medium,78,127,Algorithms,43.6%,3030,false,Array;Matrix;,false,false,43.578096349391565,10457,23996
3296,"Minimum Time to Revert Word to Initial State II",minimum-time-to-revert-word-to-initial-state-ii,false,Hard,142,21,Algorithms,34.9%,3031,false,String;Rolling Hash;String Matching;Hash Function;,false,false,34.86403206988363,11654,33427
3343,"Count Numbers With Unique Digits II",count-numbers-with-unique-digits-ii,true,Easy,26,4,Algorithms,87.7%,3032,true,Hash Table;Math;Dynamic Programming;,false,false,87.71030283608397,5474,6241
3330,"Modify the Matrix",modify-the-matrix,false,Easy,126,7,Algorithms,68.4%,3033,false,Array;Matrix;,false,false,68.36415319715137,45214,66137
3269,"Number of Subarrays That Match a Pattern I",number-of-subarrays-that-match-a-pattern-i,false,Medium,99,12,Algorithms,66.7%,3034,false,Array;Rolling Hash;String Matching;Hash Function;,false,false,66.74440971387354,27759,41590
3317,"Maximum Palindromes After Operations",maximum-palindromes-after-operations,false,Medium,224,11,Algorithms,42.7%,3035,false,Array;Hash Table;String;Greedy;Sorting;Counting;,false,false,42.7265306122449,15702,36750
3290,"Number of Subarrays That Match a Pattern II",number-of-subarrays-that-match-a-pattern-ii,false,Hard,155,5,Algorithms,32.0%,3036,false,Array;Rolling Hash;String Matching;Hash Function;,false,false,31.97199848640467,11829,36998
3352,"Find Pattern in Infinite Stream II",find-pattern-in-infinite-stream-ii,true,Hard,4,3,Algorithms,69.3%,3037,true,Array;Sliding Window;Rolling Hash;String Matching;Hash Function;,false,false,69.25630810092962,1043,1506
3320,"Maximum Number of Operations With the Same Score I",maximum-number-of-operations-with-the-same-score-i,false,Easy,81,23,Algorithms,52.4%,3038,false,Array;Simulation;,false,false,52.35189752910122,36294,69327
3308,"Apply Operations to Make String Empty",apply-operations-to-make-string-empty,false,Medium,139,7,Algorithms,56.2%,3039,false,Array;Hash Table;Sorting;Counting;,false,false,56.19070884735964,27602,49122
3318,"Maximum Number of Operations With the Same Score II",maximum-number-of-operations-with-the-same-score-ii,false,Medium,168,15,Algorithms,33.4%,3040,false,Array;Dynamic Programming;Memoization;,false,false,33.39694952598178,21524,64449
3298,"Maximize Consecutive Elements in an Array After Modification",maximize-consecutive-elements-in-an-array-after-modification,false,Hard,155,8,Algorithms,30.7%,3041,false,Array;Dynamic Programming;Sorting;,false,false,30.661123578970606,8334,27181
3309,"Count Prefix and Suffix Pairs I",count-prefix-and-suffix-pairs-i,false,Easy,125,6,Algorithms,65.8%,3042,false,Array;String;Trie;Rolling Hash;String Matching;Hash Function;,true,false,65.81538044051801,43656,66331
3329,"Find the Length of the Longest Common Prefix",find-the-length-of-the-longest-common-prefix,false,Medium,734,46,Algorithms,56.2%,3043,false,Array;Hash Table;String;Trie;,true,false,56.211544948067505,144987,257931
3314,"Most Frequent Prime",most-frequent-prime,false,Medium,91,67,Algorithms,46.3%,3044,false,Array;Hash Table;Math;Matrix;Counting;Enumeration;Number Theory;,false,false,46.34834631448245,16424,35436
3305,"Count Prefix and Suffix Pairs II",count-prefix-and-suffix-pairs-ii,false,Hard,164,7,Algorithms,25.0%,3045,false,Array;String;Trie;Rolling Hash;String Matching;Hash Function;,false,false,24.975671339522894,9496,38021
3324,"Split the Array",split-the-array,false,Easy,125,10,Algorithms,59.0%,3046,false,Array;Hash Table;Counting;,false,false,59.0249500998004,59143,100200
3325,"Find the Largest Area of Square Inside Two Rectangles",find-the-largest-area-of-square-inside-two-rectangles,false,Medium,106,44,Algorithms,45.1%,3047,false,Array;Math;Geometry;,false,false,45.09102873437158,20557,45590
3292,"Earliest Second to Mark Indices I",earliest-second-to-mark-indices-i,false,Medium,178,86,Algorithms,35.5%,3048,false,Array;Binary Search;,false,false,35.482981405609834,9007,25384
3289,"Earliest Second to Mark Indices II",earliest-second-to-mark-indices-ii,false,Hard,80,18,Algorithms,20.6%,3049,false,Array;Binary Search;Greedy;Heap (Priority Queue);,false,false,20.635519661861274,2734,13249
3255,"Pizza Toppings Cost Analysis",pizza-toppings-cost-analysis,true,Medium,10,0,Database,66.6%,3050,true,Database;,false,false,66.58686730506156,1947,2924
3256,"Find Candidates for Data Scientist Position",find-candidates-for-data-scientist-position,true,Easy,11,0,Database,75.1%,3051,true,Database;,false,false,75.08105604446503,3242,4318
3257,"Maximize Items",maximize-items,true,Hard,6,7,Database,72.7%,3052,true,Database;,false,false,72.73885350318471,1142,1570
3258,"Classifying Triangles by Lengths",classifying-triangles-by-lengths,true,Easy,7,0,Database,50.3%,3053,true,Database;,true,false,50.32387759660487,2253,4477
3259,"Binary Tree Nodes",binary-tree-nodes,true,Medium,14,2,Database,79.9%,3054,true,Database;,true,false,79.85099898408399,2358,2953
3339,"Top Percentile Fraud",top-percentile-fraud,true,Medium,8,4,Database,58.6%,3055,true,Database;,false,false,58.620689655172406,1819,3103
3340,"Snaps Analysis",snaps-analysis,true,Medium,2,2,Database,58.0%,3056,true,Database;,false,false,58.01204819277108,1926,3320
3357,"Employees Project Allocation",employees-project-allocation,true,Hard,5,4,Database,68.4%,3057,true,Database;,false,false,68.36185819070904,1398,2045
3358,"Friends With No Mutual Friends",friends-with-no-mutual-friends,true,Medium,12,2,Database,49.6%,3058,true,Database;,false,false,49.63137717487467,1683,3391
3365,"Find All Unique Email Domains",find-all-unique-email-domains,true,Easy,7,7,Database,69.6%,3059,true,Database;,true,false,69.57627118644068,2463,3540
3366,"User Activities within Time Bounds",user-activities-within-time-bounds,true,Hard,3,13,Database,40.8%,3060,true,Database;,true,false,40.81006443694385,1330,3259
3369,"Calculate Trapping Rain Water",calculate-trapping-rain-water,true,Hard,8,4,Database,81.2%,3061,true,Database;,false,false,81.21869782971619,973,1198
3368,"Winner of the Linked List Game",winner-of-the-linked-list-game,true,Easy,28,5,Algorithms,79.6%,3062,true,Linked List;,true,false,79.62841708954002,9729,12218
3359,"Linked List Frequency",linked-list-frequency,true,Easy,39,20,Algorithms,85.8%,3063,true,Hash Table;Linked List;Counting;,true,false,85.77009767092412,11413,13307
3370,"Guess the Number Using Bitwise Questions I",guess-the-number-using-bitwise-questions-i,true,Medium,10,8,Algorithms,90.6%,3064,true,Bit Manipulation;Interactive;,false,false,90.55072463768116,1562,1725
3331,"Minimum Operations to Exceed Threshold Value I",minimum-operations-to-exceed-threshold-value-i,false,Easy,102,12,Algorithms,85.9%,3065,false,Array;,false,false,85.89405876577504,71736,83517
3332,"Minimum Operations to Exceed Threshold Value II",minimum-operations-to-exceed-threshold-value-ii,false,Medium,95,7,Algorithms,28.8%,3066,false,Array;Heap (Priority Queue);Simulation;,false,false,28.834270315476466,31030,107615
3326,"Count Pairs of Connectable Servers in a Weighted Tree Network",count-pairs-of-connectable-servers-in-a-weighted-tree-network,false,Medium,206,25,Algorithms,56.3%,3067,false,Array;Tree;Depth-First Search;,false,false,56.33471820051198,13424,23829
3307,"Find the Maximum Sum of Node Values",find-the-maximum-sum-of-node-values,false,Hard,655,93,Algorithms,65.8%,3068,false,Array;Dynamic Programming;Greedy;Bit Manipulation;Tree;Sorting;,true,false,65.83413413594909,72619,110306
3347,"Distribute Elements Into Two Arrays I",distribute-elements-into-two-arrays-i,false,Easy,88,20,Algorithms,72.5%,3069,false,Array;Simulation;,false,false,72.49361259428116,47383,65362
3338,"Count Submatrices with Top-Left Element and Sum Less Than k",count-submatrices-with-top-left-element-and-sum-less-than-k,false,Medium,142,5,Algorithms,58.3%,3070,false,Array;Matrix;Prefix Sum;,false,false,58.294590251740765,27209,46675
3335,"Minimum Operations to Write the Letter Y on a Grid",minimum-operations-to-write-the-letter-y-on-a-grid,false,Medium,104,24,Algorithms,62.2%,3071,false,Array;Hash Table;Matrix;Counting;,false,false,62.22110433804817,21027,33794
3350,"Distribute Elements Into Two Arrays II",distribute-elements-into-two-arrays-ii,false,Hard,133,14,Algorithms,27.5%,3072,false,Array;Binary Indexed Tree;Segment Tree;Simulation;,false,false,27.46081187166046,10844,39489
3378,"Maximum Increasing Triplet Value",maximum-increasing-triplet-value,true,Medium,19,5,Algorithms,38.4%,3073,true,Array;Ordered Set;,false,false,38.37255684084563,962,2507
3334,"Apple Redistribution into Boxes",apple-redistribution-into-boxes,false,Easy,108,8,Algorithms,67.7%,3074,false,Array;Greedy;Sorting;,false,false,67.68256506822813,52477,77534
3351,"Maximize Happiness of Selected Children",maximize-happiness-of-selected-children,false,Medium,651,91,Algorithms,54.9%,3075,false,Array;Greedy;Sorting;,true,false,54.89547728736316,177308,322992
3356,"Shortest Uncommon Substring in an Array",shortest-uncommon-substring-in-an-array,false,Medium,140,20,Algorithms,46.7%,3076,false,Array;Hash Table;String;Trie;,false,false,46.67547419080872,24731,52985
3313,"Maximum Strength of K Disjoint Subarrays",maximum-strength-of-k-disjoint-subarrays,false,Hard,143,73,Algorithms,27.0%,3077,false,Array;Dynamic Programming;Prefix Sum;,false,false,26.961722488038276,6762,25080
3385,"Match Alphanumerical Pattern in Matrix I",match-alphanumerical-pattern-in-matrix-i,true,Medium,9,4,Algorithms,64.4%,3078,true,Array;Hash Table;String;Matrix;,false,false,64.42089326267978,851,1321
3367,"Find the Sum of Encrypted Integers",find-the-sum-of-encrypted-integers,false,Easy,110,15,Algorithms,74.1%,3079,false,Array;Math;,false,false,74.10290827740492,49685,67049
3306,"Mark Elements on Array by Performing Queries",mark-elements-on-array-by-performing-queries,false,Medium,118,25,Algorithms,49.3%,3080,false,Array;Hash Table;Sorting;Heap (Priority Queue);Simulation;,false,false,49.25186075657979,19256,39097
3354,"Replace Question Marks in String to Minimize Its Value",replace-question-marks-in-string-to-minimize-its-value,false,Medium,172,30,Algorithms,27.6%,3081,false,Hash Table;String;Greedy;Sorting;Heap (Priority Queue);Counting;,false,false,27.561077707588094,14485,52556
3345,"Find the Sum of the Power of All Subsequences",find-the-sum-of-the-power-of-all-subsequences,false,Hard,142,3,Algorithms,36.6%,3082,false,Array;Dynamic Programming;,false,false,36.60726683638047,7909,21605
3353,"Existence of a Substring in a String and Its Reverse",existence-of-a-substring-in-a-string-and-its-reverse,false,Easy,95,1,Algorithms,66.2%,3083,false,Hash Table;String;,false,false,66.19445520447125,47848,72284
3337,"Count Substrings Starting and Ending with Given Character",count-substrings-starting-and-ending-with-given-character,false,Medium,124,7,Algorithms,48.6%,3084,false,Math;String;Counting;,false,false,48.61397336014074,38687,79580
3360,"Minimum Deletions to Make String K-Special",minimum-deletions-to-make-string-k-special,false,Medium,214,12,Algorithms,44.0%,3085,false,Hash Table;String;Greedy;Sorting;Counting;,false,false,43.99194403222387,20751,47170
3327,"Minimum Moves to Pick K Ones",minimum-moves-to-pick-k-ones,false,Hard,55,50,Algorithms,22.4%,3086,false,Array;Greedy;Sliding Window;Prefix Sum;,false,false,22.370312295831702,3424,15306
3392,"Find Trending Hashtags",find-trending-hashtags,true,Medium,6,6,Database,62.1%,3087,true,Database;,false,false,62.11562115621157,1515,2439
3393,"Make String Anti-palindrome",make-string-anti-palindrome,true,Hard,8,2,Algorithms,49.6%,3088,true,String;Greedy;Sorting;Counting Sort;,false,false,49.559859154929576,563,1136
3400,"Find Bursty Behavior",find-bursty-behavior,true,Medium,7,18,Database,39.9%,3089,true,Database;,false,false,39.86444855206408,1294,3246
3349,"Maximum Length Substring With Two Occurrences",maximum-length-substring-with-two-occurrences,false,Easy,184,18,Algorithms,63.9%,3090,false,Hash Table;String;Sliding Window;,false,false,63.94832800972383,45246,70754
3328,"Apply Operations to Make Sum of Array Greater Than or Equal to k",apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k,false,Medium,162,15,Algorithms,44.2%,3091,false,Math;Greedy;Enumeration;,false,false,44.239163848755,28782,65060
3363,"Most Frequent IDs",most-frequent-ids,false,Medium,237,34,Algorithms,42.6%,3092,false,Array;Hash Table;Heap (Priority Queue);Ordered Set;,false,false,42.556253800932495,20993,49330
3376,"Longest Common Suffix Queries",longest-common-suffix-queries,false,Hard,148,13,Algorithms,37.9%,3093,false,Array;String;Trie;,false,false,37.89553160820921,11042,29138
3401,"Guess the Number Using Bitwise Questions II",guess-the-number-using-bitwise-questions-ii,true,Medium,12,3,Algorithms,82.8%,3094,true,Bit Manipulation;Interactive;,false,false,82.8125,689,832
3381,"Shortest Subarray With OR at Least K I",shortest-subarray-with-or-at-least-k-i,false,Easy,107,18,Algorithms,42.4%,3095,false,Array;Bit Manipulation;Sliding Window;,false,false,42.357276851642425,31837,75163
3355,"Minimum Levels to Gain More Points",minimum-levels-to-gain-more-points,false,Medium,81,28,Algorithms,40.0%,3096,false,Array;Prefix Sum;,false,false,39.98324557204404,23386,58489
3380,"Shortest Subarray With OR at Least K II",shortest-subarray-with-or-at-least-k-ii,false,Medium,710,69,Algorithms,50.5%,3097,false,Array;Bit Manipulation;Sliding Window;,true,false,50.546423045196484,93753,185479
3316,"Find the Sum of Subsequence Powers",find-the-sum-of-subsequence-powers,false,Hard,133,6,Algorithms,24.1%,3098,false,Array;Dynamic Programming;Sorting;,false,false,24.12560517623637,5332,22101
3371,"Harshad Number",harshad-number,false,Easy,141,7,Algorithms,83.0%,3099,false,Math;,false,false,82.96776433821401,71680,86395
3336,"Water Bottles II",water-bottles-ii,false,Medium,138,40,Algorithms,63.6%,3100,false,Math;Simulation;,false,false,63.58188153310105,36496,57400
3374,"Count Alternating Subarrays",count-alternating-subarrays,false,Medium,215,8,Algorithms,57.2%,3101,false,Array;Math;,false,false,57.16698841698842,37904,66304
3344,"Minimize Manhattan Distances",minimize-manhattan-distances,false,Hard,173,15,Algorithms,31.6%,3102,false,Array;Math;Geometry;Sorting;Ordered Set;,false,false,31.559371523915463,9079,28768
3409,"Find Trending Hashtags II ",find-trending-hashtags-ii,true,Hard,9,0,Database,63.9%,3103,true,Database;,false,false,63.8580931263858,864,1353
3410,"Find Longest Self-Contained Substring",find-longest-self-contained-substring,true,Hard,10,3,Algorithms,57.8%,3104,true,Hash Table;String;Binary Search;Prefix Sum;,false,false,57.81818181818181,795,1375
3372,"Longest Strictly Increasing or Strictly Decreasing Subarray",longest-strictly-increasing-or-strictly-decreasing-subarray,false,Easy,120,9,Algorithms,56.8%,3105,false,Array;,false,false,56.75738876258526,43689,76975
3346,"Lexicographically Smallest String After Operations With Constraint",lexicographically-smallest-string-after-operations-with-constraint,false,Medium,154,24,Algorithms,63.3%,3106,false,String;Greedy;,false,false,63.27428310458381,26324,41603
3387,"Minimum Operations to Make Median of Array Equal to K",minimum-operations-to-make-median-of-array-equal-to-k,false,Medium,145,181,Algorithms,48.0%,3107,false,Array;Greedy;Sorting;,false,false,47.96134982797746,26208,54644
3348,"Minimum Cost Walk in Weighted Graph",minimum-cost-walk-in-weighted-graph,false,Hard,198,12,Algorithms,45.2%,3108,false,Array;Bit Manipulation;Union Find;Graph;,false,false,45.18490514160022,13147,29096
3417,"Find the Index of Permutation",find-the-index-of-permutation,true,Medium,12,5,Algorithms,38.7%,3109,true,Array;Binary Search;Divide and Conquer;Binary Indexed Tree;Segment Tree;Merge Sort;Ordered Set;,false,false,38.657243816254415,547,1415
3379,"Score of a String",score-of-a-string,false,Easy,645,42,Algorithms,92.4%,3110,false,String;,true,false,92.36074584084395,312556,338408
3390,"Minimum Rectangles to Cover Points",minimum-rectangles-to-cover-points,false,Medium,97,8,Algorithms,62.8%,3111,false,Array;Greedy;Sorting;,false,false,62.778772951186745,28037,44660
3389,"Minimum Time to Visit Disappearing Nodes",minimum-time-to-visit-disappearing-nodes,false,Medium,174,22,Algorithms,35.2%,3112,false,Array;Graph;Heap (Priority Queue);Shortest Path;,false,false,35.19415853495522,21063,59848
3382,"Find the Number of Subarrays Where Boundary Elements Are Maximum",find-the-number-of-subarrays-where-boundary-elements-are-maximum,false,Hard,221,5,Algorithms,29.7%,3113,false,Array;Binary Search;Stack;Monotonic Stack;,false,false,29.71128175487848,10795,36333
3361,"Latest Time You Can Obtain After Replacing Characters",latest-time-you-can-obtain-after-replacing-characters,false,Easy,100,47,Algorithms,35.5%,3114,false,String;Enumeration;,false,false,35.529393188793385,36003,101333
3373,"Maximum Prime Difference",maximum-prime-difference,false,Medium,106,15,Algorithms,57.7%,3115,false,Array;Math;Number Theory;,false,false,57.730902558488765,41135,71253
3375,"Kth Smallest Amount With Single Denomination Combination",kth-smallest-amount-with-single-denomination-combination,false,Hard,227,19,Algorithms,17.2%,3116,false,Array;Math;Binary Search;Bit Manipulation;Combinatorics;Number Theory;,false,false,17.216445673948297,9024,52415
3364,"Minimum Sum of Values by Dividing Array",minimum-sum-of-values-by-dividing-array,false,Hard,118,4,Algorithms,27.0%,3117,false,Array;Binary Search;Dynamic Programming;Bit Manipulation;Segment Tree;Queue;,false,false,27.014265122520996,5435,20119
3424,"Friday Purchase III ",friday-purchase-iii,true,Medium,4,5,Database,58.6%,3118,true,Database;,false,false,58.63657300783049,1273,2171
3425,"Maximum Number of Potholes That Can Be Fixed",maximum-number-of-potholes-that-can-be-fixed,true,Medium,14,2,Algorithms,54.9%,3119,true,String;Greedy;Sorting;,false,false,54.92785522132551,2246,4089
3408,"Count the Number of Special Characters I",count-the-number-of-special-characters-i,false,Easy,140,5,Algorithms,65.7%,3120,false,Hash Table;String;,false,false,65.72542761168097,51068,77699
3405,"Count the Number of Special Characters II",count-the-number-of-special-characters-ii,false,Medium,157,14,Algorithms,41.7%,3121,false,Hash Table;String;,false,false,41.68631119426255,33422,80175
3404,"Minimum Number of Operations to Satisfy Conditions",minimum-number-of-operations-to-satisfy-conditions,false,Medium,235,11,Algorithms,40.8%,3122,false,Array;Dynamic Programming;Matrix;,false,false,40.767834118359076,15491,38001
3386,"Find Edges in Shortest Paths",find-edges-in-shortest-paths,false,Hard,251,5,Algorithms,46.0%,3123,false,Depth-First Search;Breadth-First Search;Graph;Heap (Priority Queue);Shortest Path;,false,false,45.958966411750836,13642,29683
3432,"Find Longest Calls",find-longest-calls,true,Medium,6,5,Database,62.5%,3124,true,Database;,false,false,62.483884830253544,1454,2327
3433,"Maximum Number That Makes Result of Bitwise AND Zero",maximum-number-that-makes-result-of-bitwise-and-zero,true,Medium,11,2,Algorithms,68.7%,3125,true,String;Greedy;Sorting;,false,false,68.72937293729373,833,1212
3440,"Server Utilization Time",server-utilization-time,true,Medium,6,13,Database,60.9%,3126,true,Database;,false,false,60.8609794628752,1541,2532
3398,"Make a Square with the Same Color",make-a-square-with-the-same-color,false,Easy,77,8,Algorithms,51.6%,3127,false,Array;Matrix;Enumeration;,false,false,51.64138432191842,28425,55044
3388,"Right Triangles",right-triangles,false,Medium,113,20,Algorithms,46.9%,3128,false,Array;Hash Table;Math;Combinatorics;Counting;,false,false,46.94980150806887,19987,42571
3406,"Find All Possible Stable Binary Arrays I",find-all-possible-stable-binary-arrays-i,false,Medium,120,36,Algorithms,26.4%,3129,false,Dynamic Programming;Prefix Sum;,false,false,26.41527206505699,8413,31849
3407,"Find All Possible Stable Binary Arrays II",find-all-possible-stable-binary-arrays-ii,false,Hard,65,12,Algorithms,26.7%,3130,false,Dynamic Programming;Prefix Sum;,false,false,26.7072881221809,3375,12637
3397,"Find the Integer Added to Array I",find-the-integer-added-to-array-i,false,Easy,140,7,Algorithms,81.9%,3131,false,Array;,false,false,81.88322654668745,63516,77569
3399,"Find the Integer Added to Array II",find-the-integer-added-to-array-ii,false,Medium,162,41,Algorithms,31.4%,3132,false,Array;Two Pointers;Sorting;Enumeration;,false,false,31.443084353401616,22656,72054
3394,"Minimum Array End",minimum-array-end,false,Medium,762,89,Algorithms,56.1%,3133,false,Bit Manipulation;,true,false,56.05039073616006,102422,182732
3362,"Find the Median of the Uniqueness Array",find-the-median-of-the-uniqueness-array,false,Hard,154,12,Algorithms,28.6%,3134,false,Array;Hash Table;Binary Search;Sliding Window;,false,false,28.614624590094117,6719,23481
3441,"Equalize Strings by Adding or Removing Characters at Ends",equalize-strings-by-adding-or-removing-characters-at-ends,true,Medium,15,2,Algorithms,55.5%,3135,true,String;Binary Search;Dynamic Programming;Sliding Window;Hash Function;,false,false,55.51425030978935,896,1614
3396,"Valid Word",valid-word,false,Easy,113,108,Algorithms,38.2%,3136,false,String;,false,false,38.17250695592564,47332,123995
3384,"Minimum Number of Operations to Make Word K-Periodic",minimum-number-of-operations-to-make-word-k-periodic,false,Medium,115,13,Algorithms,61.3%,3137,false,Hash Table;String;Counting;,false,false,61.30917733798991,25278,41231
3395,"Minimum Length of Anagram Concatenation",minimum-length-of-anagram-concatenation,false,Medium,178,95,Algorithms,41.4%,3138,false,Hash Table;String;Counting;,false,false,41.4173206119799,29345,70852
3402,"Minimum Cost to Equalize Array",minimum-cost-to-equalize-array,false,Hard,131,24,Algorithms,17.5%,3139,false,Array;Greedy;Enumeration;,false,false,17.524132442998997,5065,28903
3448,"Consecutive Available Seats II",consecutive-available-seats-ii,true,Medium,7,2,Database,58.6%,3140,true,Database;,false,false,58.61076859843814,1426,2433
3449,"Maximum Hamming Distances",maximum-hamming-distances,true,Hard,13,2,Algorithms,54.7%,3141,true,Array;Bit Manipulation;Breadth-First Search;,false,false,54.73204104903079,480,877
3415,"Check if Grid Satisfies Conditions",check-if-grid-satisfies-conditions,false,Easy,79,2,Algorithms,43.5%,3142,false,Array;Matrix;,false,false,43.516795612574676,35548,81688
3419,"Maximum Points Inside the Square",maximum-points-inside-the-square,false,Medium,154,22,Algorithms,38.8%,3143,false,Array;Hash Table;String;Binary Search;Sorting;,false,false,38.767730118839715,18203,46954
3403,"Minimum Substring Partition of Equal Character Frequency",minimum-substring-partition-of-equal-character-frequency,false,Medium,142,32,Algorithms,40.0%,3144,false,Hash Table;String;Dynamic Programming;Counting;,false,false,40.02772341813438,14727,36792
3411,"Find Products of Elements of Big Array",find-products-of-elements-of-big-array,false,Hard,58,15,Algorithms,22.3%,3145,false,Array;Binary Search;Bit Manipulation;,false,false,22.32913401448269,2251,10081
3412,"Permutation Difference between Two Strings",permutation-difference-between-two-strings,false,Easy,139,16,Algorithms,87.9%,3146,false,Hash Table;String;,false,false,87.926455566905,81776,93005
3383,"Taking Maximum Energy From the Mystic Dungeon",taking-maximum-energy-from-the-mystic-dungeon,false,Medium,153,14,Algorithms,40.8%,3147,false,Array;Prefix Sum;,false,false,40.80849141824751,30719,75276
3391,"Maximum Difference Score in a Grid",maximum-difference-score-in-a-grid,false,Medium,243,21,Algorithms,46.9%,3148,false,Array;Dynamic Programming;Matrix;,false,false,46.9316630922207,19257,41032
3431,"Find the Minimum Cost Array Permutation",find-the-minimum-cost-array-permutation,false,Hard,114,6,Algorithms,22.6%,3149,false,Array;Dynamic Programming;Bit Manipulation;Bitmask;,false,false,22.63843648208469,4726,20876
3457,"Invalid Tweets II",invalid-tweets-ii,true,Easy,8,2,Database,87.1%,3150,true,Database;,false,false,87.14343109682603,2169,2489
3429,"Special Array I",special-array-i,false,Easy,122,9,Algorithms,75.4%,3151,false,Array;,false,false,75.437477622628,67423,89376
3427,"Special Array II",special-array-ii,false,Medium,848,59,Algorithms,45.7%,3152,false,Array;Binary Search;Prefix Sum;,true,false,45.71107584214562,128166,280384
3416,"Sum of Digit Differences of All Pairs",sum-of-digit-differences-of-all-pairs,false,Medium,190,19,Algorithms,42.9%,3153,false,Array;Hash Table;Math;Counting;,false,false,42.851981211610266,24906,58121
3414,"Find Number of Ways to Reach the K-th Stair",find-number-of-ways-to-reach-the-k-th-stair,false,Hard,147,11,Algorithms,35.5%,3154,false,Math;Dynamic Programming;Bit Manipulation;Memoization;Combinatorics;,false,false,35.50987034224974,12160,34244
3458,"Maximum Number of Upgradable Servers",maximum-number-of-upgradable-servers,true,Medium,8,2,Algorithms,44.6%,3155,true,Array;Math;Binary Search;,false,false,44.610951008645536,1548,3470
3465,"Employee Task Duration and Concurrent Tasks",employee-task-duration-and-concurrent-tasks,true,Hard,8,1,Database,53.8%,3156,true,Database;,false,false,53.75939849624061,858,1596
3467,"Find the Level of Tree with Minimum Sum",find-the-level-of-tree-with-minimum-sum,true,Medium,15,3,Algorithms,69.0%,3157,true,Tree;Depth-First Search;Breadth-First Search;Binary Tree;,false,false,68.95943562610229,1955,2835
3428,"Find the XOR of Numbers Which Appear Twice",find-the-xor-of-numbers-which-appear-twice,false,Easy,113,11,Algorithms,81.0%,3158,false,Array;Hash Table;Bit Manipulation;,false,false,81.02336334874666,53268,65744
3420,"Find Occurrences of an Element in an Array",find-occurrences-of-an-element-in-an-array,false,Medium,125,16,Algorithms,73.2%,3159,false,Array;Hash Table;,false,false,73.19924235591233,40578,55435
3434,"Find the Number of Distinct Colors Among the Balls",find-the-number-of-distinct-colors-among-the-balls,false,Medium,118,9,Algorithms,41.1%,3160,false,Array;Hash Table;Simulation;,false,false,41.06507190659263,25956,63207
3435,"Block Placement Queries",block-placement-queries,false,Hard,111,18,Algorithms,15.2%,3161,false,Array;Binary Search;Binary Indexed Tree;Segment Tree;,false,false,15.187940770181518,6267,41263
3446,"Find the Number of Good Pairs I",find-the-number-of-good-pairs-i,false,Easy,118,13,Algorithms,85.9%,3162,false,Array;Hash Table;,false,false,85.91379412286408,72651,84563
3451,"String Compression III",string-compression-iii,false,Medium,589,48,Algorithms,68.1%,3163,false,String;,true,false,68.056003350121,183643,269841
3444,"Find the Number of Good Pairs II",find-the-number-of-good-pairs-ii,false,Medium,228,39,Algorithms,25.9%,3164,false,Array;Hash Table;,false,false,25.913149151778274,26441,102037
3423,"Maximum Sum of Subsequence With Non-adjacent Elements",maximum-sum-of-subsequence-with-non-adjacent-elements,false,Hard,122,27,Algorithms,16.5%,3165,false,Array;Divide and Conquer;Dynamic Programming;Segment Tree;,false,false,16.517328389721406,6415,38838
3473,"Calculate Parking Fees and Duration",calculate-parking-fees-and-duration,true,Medium,10,3,Database,53.0%,3166,true,Database;,false,false,52.98039215686274,1351,2550
3474,"Better Compression of String",better-compression-of-string,true,Medium,13,3,Algorithms,74.6%,3167,true,Hash Table;String;Sorting;Counting;,false,false,74.58804844153266,3757,5037
3426,"Minimum Number of Chairs in a Waiting Room",minimum-number-of-chairs-in-a-waiting-room,false,Easy,123,11,Algorithms,80.0%,3168,false,String;Simulation;,false,false,80.00910244386826,58012,72507
3430,"Count Days Without Meetings",count-days-without-meetings,false,Medium,209,5,Algorithms,34.2%,3169,false,Array;Sorting;,false,false,34.215326187442216,41082,120069
3445,"Lexicographically Minimum String After Removing Stars",lexicographically-minimum-string-after-removing-stars,false,Medium,209,28,Algorithms,35.7%,3170,false,Hash Table;String;Stack;Greedy;Heap (Priority Queue);,false,false,35.69607805080031,27587,77283
3436,"Find Subarray With Bitwise OR Closest to K",find-subarray-with-bitwise-or-closest-to-k,false,Hard,184,7,Algorithms,30.2%,3171,false,Array;Binary Search;Bit Manipulation;Segment Tree;,false,false,30.232395024782566,12931,42772
3481,"Second Day Verification",second-day-verification,true,Easy,6,0,Database,70.1%,3172,true,Database;,false,false,70.07589447054572,1939,2767
3472,"Bitwise OR of Adjacent Elements",bitwise-or-of-adjacent-elements,true,Easy,14,1,Algorithms,95.5%,3173,true,Array;Bit Manipulation;,false,false,95.46925566343042,3540,3708
3447,"Clear Digits",clear-digits,false,Easy,111,3,Algorithms,73.2%,3174,false,String;Stack;Simulation;,false,false,73.17550241517084,61353,83844
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,123,13,Algorithms,39.4%,3175,false,Array;Simulation;,false,false,39.39645896507874,32220,81784
3456,"Find the Maximum Length of a Good Subsequence I",find-the-maximum-length-of-a-good-subsequence-i,false,Medium,143,81,Algorithms,30.8%,3176,false,Array;Hash Table;Dynamic Programming;,false,false,30.79711317518366,19032,61796
3452,"Find the Maximum Length of a Good Subsequence II",find-the-maximum-length-of-a-good-subsequence-ii,false,Hard,120,6,Algorithms,24.0%,3177,false,Array;Hash Table;Dynamic Programming;,false,false,23.99569934512755,7365,30693
3450,"Find the Child Who Has the Ball After K Seconds",find-the-child-who-has-the-ball-after-k-seconds,false,Easy,150,9,Algorithms,61.9%,3178,false,Math;Simulation;,false,false,61.89211354150091,50564,81697
3422,"Find the N-th Value After K Seconds",find-the-n-th-value-after-k-seconds,false,Medium,104,17,Algorithms,54.0%,3179,false,Array;Math;Simulation;Combinatorics;Prefix Sum;,false,false,54.03655594477081,39645,73367
3442,"Maximum Total Reward Using Operations I",maximum-total-reward-using-operations-i,false,Medium,183,17,Algorithms,29.7%,3180,false,Array;Dynamic Programming;,false,false,29.700132704381478,26633,89673
3443,"Maximum Total Reward Using Operations II",maximum-total-reward-using-operations-ii,false,Hard,122,32,Algorithms,20.7%,3181,false,Array;Dynamic Programming;Bit Manipulation;,false,false,20.729217586335796,7209,34777
3488,"Find Top Scoring Students",find-top-scoring-students,true,Medium,8,2,Database,50.1%,3182,true,Database;,false,false,50.13764624913971,1457,2906
3489,"The Number of Ways to Make the Sum",the-number-of-ways-to-make-the-sum,true,Medium,17,1,Algorithms,54.2%,3183,true,Array;Dynamic Programming;,false,false,54.238143289606455,1075,1982
3421,"Count Pairs That Form a Complete Day I",count-pairs-that-form-a-complete-day-i,false,Easy,129,9,Algorithms,78.1%,3184,false,Array;Hash Table;Counting;,false,false,78.08367440876802,62764,80381
3418,"Count Pairs That Form a Complete Day II",count-pairs-that-form-a-complete-day-ii,false,Medium,178,12,Algorithms,43.0%,3185,false,Array;Hash Table;Counting;,false,false,43.020225082334875,42584,98986
3437,"Maximum Total Damage With Spell Casting",maximum-total-damage-with-spell-casting,false,Medium,249,30,Algorithms,26.9%,3186,false,Array;Hash Table;Two Pointers;Binary Search;Dynamic Programming;Sorting;Counting;,false,false,26.93035095431358,26343,97818
3438,"Peaks in Array",peaks-in-array,false,Hard,122,10,Algorithms,26.3%,3187,false,Array;Binary Indexed Tree;Segment Tree;,false,false,26.329612606697307,9624,36552
3503,"Find Top Scoring Students II",find-top-scoring-students-ii,true,Hard,5,6,Database,38.5%,3188,true,Database;,false,false,38.45446182152714,1254,3261
3504,"Minimum Moves to Get a Peaceful Board",minimum-moves-to-get-a-peaceful-board,true,Medium,56,11,Algorithms,76.6%,3189,true,Array;Greedy;Sorting;Counting Sort;,true,false,76.5757790368272,4325,5648
3476,"Find Minimum Operations to Make All Elements Divisible by Three",find-minimum-operations-to-make-all-elements-divisible-by-three,false,Easy,172,15,Algorithms,89.1%,3190,false,Array;Math;,false,false,89.10076493209448,106348,119357
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,155,8,Algorithms,70.2%,3191,false,Array;Bit Manipulation;Queue;Sliding Window;Prefix Sum;,false,false,70.21858745001353,46708,66518
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,127,8,Algorithms,64.5%,3192,false,Array;Dynamic Programming;Greedy;,false,false,64.50490351154697,36702,56898
3460,"Count the Number of Inversions",count-the-number-of-inversions,false,Hard,110,22,Algorithms,32.9%,3193,false,Array;Dynamic Programming;,false,false,32.85864256698161,7199,21909
3471,"Minimum Average of Smallest and Largest Elements",minimum-average-of-smallest-and-largest-elements,false,Easy,137,13,Algorithms,85.0%,3194,false,Array;Two Pointers;Sorting;,false,false,84.96536312849162,76043,89499
3461,"Find the Minimum Area to Cover All Ones I",find-the-minimum-area-to-cover-all-ones-i,false,Medium,106,11,Algorithms,73.0%,3195,false,Array;Matrix;,false,false,73.0119510741948,41665,57066
3464,"Maximize Total Cost of Alternating Subarrays",maximize-total-cost-of-alternating-subarrays,false,Medium,171,27,Algorithms,28.7%,3196,false,Array;Dynamic Programming;,false,false,28.72261275591359,22391,77956
3459,"Find the Minimum Area to Cover All Ones II",find-the-minimum-area-to-cover-all-ones-ii,false,Hard,73,9,Algorithms,35.7%,3197,false,Array;Matrix;Enumeration;,false,false,35.689020428787984,4944,13853
3505,"Find Cities in Each State",find-cities-in-each-state,true,Easy,5,2,Database,83.4%,3198,true,Database;,false,false,83.37019018133569,1885,2261
3506,"Count Triplets with Even XOR Set Bits I",count-triplets-with-even-xor-set-bits-i,true,Easy,8,3,Algorithms,83.2%,3199,true,Array;Bit Manipulation;,false,false,83.16831683168317,1008,1212
3469,"Maximum Height of a Triangle",maximum-height-of-a-triangle,false,Easy,144,23,Algorithms,43.1%,3200,false,Array;Enumeration;,false,false,43.11006921187765,38618,89580
3490,"Find the Maximum Length of Valid Subsequence I",find-the-maximum-length-of-valid-subsequence-i,false,Medium,137,16,Algorithms,37.5%,3201,false,Array;Dynamic Programming;,false,false,37.532677704469066,27135,72297
3491,"Find the Maximum Length of Valid Subsequence II",find-the-maximum-length-of-valid-subsequence-ii,false,Medium,195,15,Algorithms,39.6%,3202,false,Array;Dynamic Programming;,false,false,39.56200596086562,18318,46302
3439,"Find Minimum Diameter After Merging Two Trees",find-minimum-diameter-after-merging-two-trees,false,Hard,618,38,Algorithms,58.0%,3203,false,Tree;Depth-First Search;Breadth-First Search;Graph;,true,false,58.03556198165853,71447,123108
3512,"Bitwise User Permissions Analysis",bitwise-user-permissions-analysis,true,Medium,5,3,Database,94.4%,3204,true,Database;,false,false,94.4015444015444,978,1036
3513,"Maximum Array Hopping Score I",maximum-array-hopping-score-i,true,Medium,19,1,Algorithms,78.6%,3205,true,Array;Dynamic Programming;Stack;Greedy;Monotonic Stack;,false,false,78.59007832898173,1505,1915
3463,"Alternating Groups I",alternating-groups-i,false,Easy,97,7,Algorithms,67.0%,3206,false,Array;Sliding Window;,false,false,66.96601378028954,51900,77502
3264,"Maximum Points After Enemy Battles",maximum-points-after-enemy-battles,false,Medium,108,40,Algorithms,32.1%,3207,false,Array;Greedy;,false,false,32.11854707547738,26660,83005
3483,"Alternating Groups II",alternating-groups-ii,false,Medium,153,8,Algorithms,41.1%,3208,false,Array;Sliding Window;,false,false,41.11585406523044,24658,59972
3466,"Number of Subarrays With AND Value of K",number-of-subarrays-with-and-value-of-k,false,Hard,151,7,Algorithms,33.8%,3209,false,Array;Binary Search;Bit Manipulation;Segment Tree;,false,false,33.75303087844352,11554,34231
3468,"Find the Encrypted String",find-the-encrypted-string,false,Easy,96,9,Algorithms,68.5%,3210,false,String;,false,false,68.45696623870661,57585,84119
3453,"Generate Binary Strings Without Adjacent Zeros",generate-binary-strings-without-adjacent-zeros,false,Medium,172,32,Algorithms,86.7%,3211,false,String;Backtracking;Bit Manipulation;,false,false,86.74265253305917,48935,56414
3492,"Count Submatrices With Equal Frequency of X and Y",count-submatrices-with-equal-frequency-of-x-and-y,false,Medium,138,25,Algorithms,51.3%,3212,false,Array;Matrix;Prefix Sum;,false,false,51.32468205471466,23770,46313
3482,"Construct String with Minimum Cost",construct-string-with-minimum-cost,false,Hard,154,28,Algorithms,19.7%,3213,false,Array;String;Dynamic Programming;Suffix Array;,false,false,19.72865651886168,11924,60440
3520,"Year on Year Growth Rate",year-on-year-growth-rate,true,Hard,3,1,Database,52.2%,3214,true,Database;,false,false,52.22278998467041,1022,1957
3521,"Count Triplets with Even XOR Set Bits II",count-triplets-with-even-xor-set-bits-ii,true,Medium,14,3,Algorithms,73.4%,3215,true,Array;Bit Manipulation;,false,false,73.37031900138696,529,721
3484,"Lexicographically Smallest String After a Swap",lexicographically-smallest-string-after-a-swap,false,Easy,84,27,Algorithms,53.7%,3216,false,String;Greedy;,false,false,53.68346805795024,47948,89317
3501,"Delete Nodes From Linked List Present in Array",delete-nodes-from-linked-list-present-in-array,false,Medium,625,27,Algorithms,68.7%,3217,false,Array;Hash Table;Linked List;,true,false,68.65669950441195,181759,264736
3494,"Minimum Cost for Cutting Cake I",minimum-cost-for-cutting-cake-i,false,Medium,172,8,Algorithms,58.0%,3218,false,Array;Dynamic Programming;Greedy;Sorting;,false,false,57.960899816451104,27157,46854
3500,"Minimum Cost for Cutting Cake II",minimum-cost-for-cutting-cake-ii,false,Hard,105,18,Algorithms,55.1%,3219,false,Array;Greedy;Sorting;,false,false,55.114397608986906,21391,38812
3530,"Odd and Even Transactions",odd-and-even-transactions,false,Medium,35,12,Database,70.1%,3220,false,Database;,false,false,70.06399146780429,10511,15002
3529,"Maximum Array Hopping Score II",maximum-array-hopping-score-ii,true,Medium,14,1,Algorithms,64.1%,3221,true,Array;Stack;Greedy;Monotonic Stack;,false,false,64.08952187182095,630,983
3511,"Find the Winning Player in Coin Game",find-the-winning-player-in-coin-game,false,Easy,94,8,Algorithms,52.0%,3222,false,Math;Simulation;Game Theory;,false,false,51.97028938433819,42401,81584
3455,"Minimum Length of String After Operations",minimum-length-of-string-after-operations,false,Medium,96,2,Algorithms,54.8%,3223,false,Hash Table;String;Counting;,false,false,54.78101270378234,30444,55574
3498,"Minimum Array Changes to Make Differences Equal",minimum-array-changes-to-make-differences-equal,false,Medium,218,23,Algorithms,23.2%,3224,false,Array;Hash Table;Prefix Sum;,false,false,23.206512121748364,13114,56510
3470,"Maximum Score From Grid Operations",maximum-score-from-grid-operations,false,Hard,63,8,Algorithms,23.9%,3225,false,Array;Dynamic Programming;Matrix;Prefix Sum;,false,false,23.936545240893068,2037,8510
3508,"Number of Bit Changes to Make Two Integers Equal",number-of-bit-changes-to-make-two-integers-equal,false,Easy,89,6,Algorithms,64.5%,3226,false,Bit Manipulation;,false,false,64.54170350722075,43798,67860
3462,"Vowels Game in a String",vowels-game-in-a-string,false,Medium,135,33,Algorithms,62.7%,3227,false,Math;String;Brainteaser;Game Theory;,false,false,62.70937923340505,39347,62745
3493,"Maximum Number of Operations to Move Ones to the End",maximum-number-of-operations-to-move-ones-to-the-end,false,Medium,163,12,Algorithms,53.8%,3228,false,String;Greedy;Counting;,false,false,53.831277342796525,28670,53259
3454,"Minimum Operations to Make Array Equal to Target",minimum-operations-to-make-array-equal-to-target,false,Hard,214,8,Algorithms,38.3%,3229,false,Array;Dynamic Programming;Stack;Greedy;Monotonic Stack;,false,false,38.27877633615046,16079,42005
3539,"Customer Purchasing Behavior Analysis",customer-purchasing-behavior-analysis,true,Medium,6,0,Database,37.5%,3230,true,Database;,false,false,37.52577319587629,1092,2910
3545,"Minimum Number of Increasing Subsequence to Be Removed",minimum-number-of-increasing-subsequence-to-be-removed,true,Hard,8,1,Algorithms,53.2%,3231,true,Array;Binary Search;,false,false,53.185185185185176,359,675
3515,"Find if Digit Game Can Be Won",find-if-digit-game-can-be-won,false,Easy,120,7,Algorithms,82.3%,3232,false,Array;Math;,false,false,82.34817532610332,71146,86397
3507,"Find the Count of Numbers Which Are Not Special",find-the-count-of-numbers-which-are-not-special,false,Medium,175,23,Algorithms,26.8%,3233,false,Array;Math;Number Theory;,false,false,26.78747888176979,33614,125484
3479,"Count the Number of Substrings With Dominant Ones",count-the-number-of-substrings-with-dominant-ones,false,Medium,247,45,Algorithms,16.4%,3234,false,String;Sliding Window;Enumeration;,false,false,16.42148265830359,7958,48465
3478,"Check if the Rectangle Corner Is Reachable",check-if-the-rectangle-corner-is-reachable,false,Hard,107,28,Algorithms,26.2%,3235,false,Array;Math;Depth-First Search;Breadth-First Search;Union Find;Geometry;,false,false,26.242007863071365,6608,25181
3549,"CEO Subordinate Hierarchy",ceo-subordinate-hierarchy,true,Hard,6,0,Database,72.7%,3236,true,Database;,false,false,72.68993839835728,708,974
3538,"Alt and Tab Simulation",alt-and-tab-simulation,true,Medium,12,6,Algorithms,75.2%,3237,true,Array;Hash Table;Simulation;,false,false,75.21697203471552,780,1037
3519,"Find the Number of Winning Players",find-the-number-of-winning-players,false,Easy,84,17,Algorithms,61.2%,3238,false,Array;Hash Table;Counting;,false,false,61.16398954053044,40934,66925
3526,"Minimum Number of Flips to Make Binary Grid Palindromic I",minimum-number-of-flips-to-make-binary-grid-palindromic-i,false,Medium,66,7,Algorithms,76.5%,3239,false,Array;Two Pointers;Matrix;,false,false,76.52391230262411,33682,44015
3524,"Minimum Number of Flips to Make Binary Grid Palindromic II",minimum-number-of-flips-to-make-binary-grid-palindromic-ii,false,Medium,125,52,Algorithms,23.5%,3240,false,Array;Two Pointers;Matrix;,false,false,23.528862320194282,10076,42824
3532,"Time Taken to Mark All Nodes",time-taken-to-mark-all-nodes,false,Hard,102,4,Algorithms,24.6%,3241,false,Dynamic Programming;Tree;Depth-First Search;Graph;,false,false,24.6460028988739,4421,17938
3516,"Design Neighbor Sum Service",design-neighbor-sum-service,false,Easy,85,15,Algorithms,82.8%,3242,false,Array;Hash Table;Design;Matrix;Simulation;,false,false,82.84268426842685,37652,45450
3517,"Shortest Distance After Road Addition Queries I",shortest-distance-after-road-addition-queries-i,false,Medium,574,26,Algorithms,62.6%,3243,false,Array;Breadth-First Search;Graph;,true,false,62.55386207818942,107571,171963
3514,"Shortest Distance After Road Addition Queries II",shortest-distance-after-road-addition-queries-ii,false,Hard,181,6,Algorithms,24.9%,3244,false,Array;Greedy;Graph;Ordered Set;,false,false,24.938464543856224,12766,51190
3527,"Alternating Groups III",alternating-groups-iii,false,Hard,53,8,Algorithms,13.9%,3245,false,Array;Binary Indexed Tree;,false,false,13.853530950305142,1589,11470
3554,"Premier League Table Ranking",premier-league-table-ranking,true,Easy,6,0,Database,82.9%,3246,true,Database;,false,false,82.8901154039137,1652,1993
3537,"Number of Subsequences with Odd Sum",number-of-subsequences-with-odd-sum,true,Medium,9,2,Algorithms,53.7%,3247,true,Array;Math;Dynamic Programming;Combinatorics;,false,false,53.660565723793674,645,1202
3533,"Snake in Matrix",snake-in-matrix,false,Easy,126,3,Algorithms,82.6%,3248,false,Array;String;Simulation;,false,false,82.64855981316495,57330,69366
3486,"Count the Number of Good Nodes",count-the-number-of-good-nodes,false,Medium,157,40,Algorithms,55.9%,3249,false,Tree;Depth-First Search;,false,false,55.88702851126205,27070,48437
3535,"Find the Count of Monotonic Pairs I",find-the-count-of-monotonic-pairs-i,false,Hard,129,8,Algorithms,46.0%,3250,false,Array;Math;Dynamic Programming;Combinatorics;Prefix Sum;,false,false,45.98290598290598,16409,35685
3536,"Find the Count of Monotonic Pairs II",find-the-count-of-monotonic-pairs-ii,false,Hard,89,6,Algorithms,23.0%,3251,false,Array;Math;Dynamic Programming;Combinatorics;Prefix Sum;,false,false,22.951697547392097,6429,28011
3564,"Premier League Table Ranking II",premier-league-table-ranking-ii,true,Medium,5,8,Database,58.5%,3252,true,Database;,false,false,58.536585365853654,864,1476
3480,"Construct String with Minimum Cost (Easy)",construct-string-with-minimum-cost-easy,true,Medium,8,2,Algorithms,58.6%,3253,true,,false,false,58.57461024498887,526,898
3522,"Find the Power of K-Size Subarrays I",find-the-power-of-k-size-subarrays-i,false,Medium,605,51,Algorithms,63.1%,3254,false,Array;Sliding Window;,true,false,63.08475248595873,139951,221846
3523,"Find the Power of K-Size Subarrays II",find-the-power-of-k-size-subarrays-ii,false,Medium,139,9,Algorithms,28.8%,3255,false,Array;Sliding Window;,false,false,28.76695258468504,27702,96298
3550,"Maximum Value Sum by Placing Three Rooks I",maximum-value-sum-by-placing-three-rooks-i,false,Hard,95,11,Algorithms,14.7%,3256,false,Array;Dynamic Programming;Matrix;Enumeration;,false,false,14.70990208376238,7857,53413
3542,"Maximum Value Sum by Placing Three Rooks II",maximum-value-sum-by-placing-three-rooks-ii,false,Hard,51,9,Algorithms,27.1%,3257,false,Array;Dynamic Programming;Matrix;Enumeration;,false,false,27.119648997984108,4574,16866
3543,"Count Substrings That Satisfy K-Constraint I",count-substrings-that-satisfy-k-constraint-i,false,Easy,119,17,Algorithms,80.3%,3258,false,String;Sliding Window;,false,false,80.30689099561584,42863,53374
3525,"Maximum Energy Boost From Two Drinks",maximum-energy-boost-from-two-drinks,false,Medium,151,12,Algorithms,49.3%,3259,false,Array;Dynamic Programming;,false,false,49.267622102485504,31180,63287
3552,"Find the Largest Palindrome Divisible by K",find-the-largest-palindrome-divisible-by-k,false,Hard,89,66,Algorithms,15.1%,3260,false,Math;String;Dynamic Programming;Greedy;Number Theory;,false,false,15.053199303267508,7173,47651
3546,"Count Substrings That Satisfy K-Constraint II",count-substrings-that-satisfy-k-constraint-ii,false,Hard,122,10,Algorithms,22.1%,3261,false,Array;String;Binary Search;Sliding Window;Prefix Sum;,false,false,22.060546875,4518,20480
3574,"Find Overlapping Shifts",find-overlapping-shifts,true,Medium,7,1,Database,64.2%,3262,true,Database;,false,false,64.19243986254295,934,1455
3577,"Convert Doubly Linked List to Array I",convert-doubly-linked-list-to-array-i,true,Easy,11,3,Algorithms,95.6%,3263,true,Array;Linked List;Doubly-Linked List;,false,false,95.58504875406284,3529,3692
3555,"Final Array State After K Multiplication Operations I",final-array-state-after-k-multiplication-operations-i,false,Easy,465,10,Algorithms,87.7%,3264,false,Array;Math;Heap (Priority Queue);Simulation;,true,false,87.65040416298156,170458,194475
3534,"Count Almost Equal Pairs I",count-almost-equal-pairs-i,false,Medium,146,22,Algorithms,37.3%,3265,false,Array;Hash Table;Sorting;Counting;Enumeration;,false,false,37.329357094257134,25786,69077
3556,"Final Array State After K Multiplication Operations II",final-array-state-after-k-multiplication-operations-ii,false,Hard,162,21,Algorithms,11.4%,3266,false,Array;Heap (Priority Queue);Simulation;,false,false,11.423240520863235,8755,76642
3544,"Count Almost Equal Pairs II",count-almost-equal-pairs-ii,false,Hard,77,22,Algorithms,21.0%,3267,false,Array;Hash Table;Sorting;Counting;Enumeration;,false,false,21.030958709242693,5618,26713
3585,"Find Overlapping Shifts II",find-overlapping-shifts-ii,true,Hard,4,3,Database,64.4%,3268,true,Database;,false,false,64.39665471923537,539,837
3586,"Constructing Two Increasing Arrays",constructing-two-increasing-arrays,true,Hard,9,1,Algorithms,64.2%,3269,true,Array;Dynamic Programming;,false,false,64.24116424116424,309,481
3568,"Find the Key of the Numbers",find-the-key-of-the-numbers,false,Easy,81,11,Algorithms,76.7%,3270,false,Math;,false,false,76.7451889386017,42711,55653
3540,"Hash Divided String",hash-divided-string,false,Medium,77,11,Algorithms,84.6%,3271,false,String;Simulation;,false,false,84.6430325490021,37915,44794
3548,"Find the Count of Good Integers",find-the-count-of-good-integers,false,Hard,88,14,Algorithms,30.4%,3272,false,Hash Table;Math;Combinatorics;Enumeration;,false,false,30.427206633419456,5064,16643
3531,"Minimum Amount of Damage Dealt to Bob",minimum-amount-of-damage-dealt-to-bob,false,Hard,145,23,Algorithms,37.9%,3273,false,Array;Greedy;Sorting;,false,false,37.93149141986351,11450,30186
3553,"Check if Two Chessboard Squares Have the Same Color",check-if-two-chessboard-squares-have-the-same-color,false,Easy,102,4,Algorithms,70.5%,3274,false,Math;String;,false,false,70.45364730250876,51701,73383
3495,"K-th Nearest Obstacle Queries",k-th-nearest-obstacle-queries,false,Medium,92,14,Algorithms,48.1%,3275,false,Array;Heap (Priority Queue);,false,false,48.062354092928686,31910,66394
3563,"Select Cells in Grid With Maximum Score",select-cells-in-grid-with-maximum-score,false,Hard,204,6,Algorithms,13.9%,3276,false,Array;Dynamic Programming;Bit Manipulation;Matrix;Bitmask;,false,false,13.880545366461346,10028,72245
3551,"Maximum XOR Score Subarray Queries",maximum-xor-score-subarray-queries,false,Hard,98,15,Algorithms,45.2%,3277,false,Array;Dynamic Programming;,false,false,45.18902123252201,4363,9655
3589,"Find Candidates for Data Scientist Position II",find-candidates-for-data-scientist-position-ii,true,Medium,4,2,Database,45.4%,3278,true,Database;,false,false,45.39509536784741,833,1835
3590,"Maximum Total Area Occupied by Pistons",maximum-total-area-occupied-by-pistons,true,Hard,5,3,Algorithms,54.9%,3279,true,Array;Hash Table;String;Simulation;Counting;Prefix Sum;,false,false,54.86381322957199,282,514
3567,"Convert Date to Binary",convert-date-to-binary,false,Easy,93,6,Algorithms,88.5%,3280,false,Math;String;,false,false,88.46939275620394,54150,61208
3485,"Maximize Score of Numbers in Ranges",maximize-score-of-numbers-in-ranges,false,Medium,198,37,Algorithms,34.4%,3281,false,Array;Binary Search;Greedy;Sorting;,false,false,34.405589627073475,20140,58537
3528,"Reach End of Array With Max Score",reach-end-of-array-with-max-score,false,Medium,197,13,Algorithms,31.9%,3282,false,Array;Greedy;,false,false,31.922400868531252,24699,77372
3560,"Maximum Number of Moves to Kill All Pawns",maximum-number-of-moves-to-kill-all-pawns,false,Hard,113,10,Algorithms,32.3%,3283,false,Array;Math;Bit Manipulation;Breadth-First Search;Game Theory;Bitmask;,false,false,32.31350011268875,5735,17748
3602,"Sum of Consecutive Subarrays",sum-of-consecutive-subarrays,true,Medium,9,3,Algorithms,46.9%,3284,true,Array;Two Pointers;Dynamic Programming;,false,false,46.88398849472675,489,1043
3582,"Find Indices of Stable Mountains",find-indices-of-stable-mountains,false,Easy,69,18,Algorithms,86.9%,3285,false,Array;,false,false,86.93076360636682,46365,53336
3558,"Find a Safe Walk Through a Grid",find-a-safe-walk-through-a-grid,false,Medium,149,12,Algorithms,29.3%,3286,false,Array;Breadth-First Search;Graph;Heap (Priority Queue);Matrix;Shortest Path;,false,false,29.277940369489663,25610,87472
3575,"Find the Maximum Sequence Value of Array",find-the-maximum-sequence-value-of-array,false,Hard,74,7,Algorithms,17.3%,3287,false,Array;Dynamic Programming;Bit Manipulation;,false,false,17.29669289984088,4022,23253
3571,"Length of the Longest Increasing Path",length-of-the-longest-increasing-path,false,Hard,89,1,Algorithms,16.6%,3288,false,Array;Binary Search;Sorting;,false,false,16.558317399617593,4330,26150
3581,"The Two Sneaky Numbers of Digitville",the-two-sneaky-numbers-of-digitville,false,Easy,120,7,Algorithms,89.1%,3289,false,Array;Hash Table;Math;,false,false,89.10688604187833,67533,75789
3518,"Maximum Multiplication Score",maximum-multiplication-score,false,Medium,161,12,Algorithms,41.3%,3290,false,Array;Dynamic Programming;,false,false,41.31410501619361,32401,78426
3559,"Minimum Number of Valid Strings to Form Target I",minimum-number-of-valid-strings-to-form-target-i,false,Medium,144,14,Algorithms,19.2%,3291,false,Array;String;Binary Search;Dynamic Programming;Trie;Segment Tree;Rolling Hash;String Matching;Hash Function;,false,false,19.241805060429527,11065,57505
3557,"Minimum Number of Valid Strings to Form Target II",minimum-number-of-valid-strings-to-form-target-ii,false,Hard,67,10,Algorithms,17.5%,3292,false,Array;String;Binary Search;Dynamic Programming;Segment Tree;Rolling Hash;String Matching;Hash Function;,false,false,17.491810086282474,3791,21673
3609,"Calculate Product Final Price",calculate-product-final-price,true,Medium,8,0,Database,78.9%,3293,true,Database;,false,false,78.87896019496344,971,1231
3615,"Convert Doubly Linked List to Array II",convert-doubly-linked-list-to-array-ii,true,Medium,4,5,Algorithms,82.3%,3294,true,Array;Linked List;Doubly-Linked List;,false,false,82.335148215366,1361,1653
3541,"Report Spam Message",report-spam-message,false,Medium,80,13,Algorithms,47.4%,3295,false,Array;Hash Table;String;,false,false,47.408304055583436,48173,101613
3496,"Minimum Number of Seconds to Make Mountain Height Zero",minimum-number-of-seconds-to-make-mountain-height-zero,false,Medium,211,22,Algorithms,35.6%,3296,false,Array;Math;Binary Search;Greedy;Heap (Priority Queue);,false,false,35.57944885872314,21807,61291
3573,"Count Substrings That Can Be Rearranged to Contain a String I",count-substrings-that-can-be-rearranged-to-contain-a-string-i,false,Medium,103,21,Algorithms,41.6%,3297,false,Hash Table;String;Sliding Window;,false,false,41.641154460057045,15914,38217
3572,"Count Substrings That Can Be Rearranged to Contain a String II",count-substrings-that-can-be-rearranged-to-contain-a-string-ii,false,Hard,78,4,Algorithms,58.8%,3298,false,Hash Table;String;Sliding Window;,false,false,58.77045032889189,13938,23716
3623,"Sum of Consecutive Subsequences",sum-of-consecutive-subsequences,true,Hard,7,1,Algorithms,48.0%,3299,true,Array;Hash Table;Dynamic Programming;,false,false,48.006644518272424,289,602
3606,"Minimum Element After Replacement With Digit Sum",minimum-element-after-replacement-with-digit-sum,false,Easy,58,2,Algorithms,83.9%,3300,false,Array;Math;,false,false,83.8850840522992,47156,56215
3510,"Maximize the Total Height of Unique Towers",maximize-the-total-height-of-unique-towers,false,Medium,106,7,Algorithms,36.1%,3301,false,Array;Greedy;Sorting;,false,false,36.14006395391412,29610,81933
3584,"Find the Lexicographically Smallest Valid Sequence",find-the-lexicographically-smallest-valid-sequence,false,Medium,130,28,Algorithms,19.9%,3302,false,Two Pointers;String;Dynamic Programming;Greedy;,false,false,19.892699347780347,5673,28518
3580,"Find the Occurrence of First Almost Equal Substring",find-the-occurrence-of-first-almost-equal-substring,false,Hard,56,6,Algorithms,12.4%,3303,false,String;String Matching;,false,false,12.43199606893405,3542,28491
3600,"Find the K-th Character in String Game I",find-the-k-th-character-in-string-game-i,false,Easy,114,29,Algorithms,72.3%,3304,false,Math;Bit Manipulation;Recursion;Simulation;,false,false,72.32648809054031,45820,63352
3570,"Count of Substrings Containing Every Vowel and K Consonants I",count-of-substrings-containing-every-vowel-and-k-consonants-i,false,Medium,103,9,Algorithms,40.5%,3305,false,Hash Table;String;Sliding Window;,false,false,40.54133980824306,26047,64248
3569,"Count of Substrings Containing Every Vowel and K Consonants II",count-of-substrings-containing-every-vowel-and-k-consonants-ii,false,Medium,176,9,Algorithms,21.7%,3306,false,Hash Table;String;Sliding Window;,false,false,21.711727631501443,11058,50931
3601,"Find the K-th Character in String Game II",find-the-k-th-character-in-string-game-ii,false,Hard,87,5,Algorithms,29.9%,3307,false,Math;Bit Manipulation;Recursion;,false,false,29.867769184160814,8380,28057
3624,"Find Top Performing Driver",find-top-performing-driver,true,Medium,5,0,Database,52.3%,3308,true,Database;,false,false,52.29576624925462,877,1677
3579,"Maximum Possible Number by Binary Concatenation",maximum-possible-number-by-binary-concatenation,false,Medium,98,6,Algorithms,65.6%,3309,false,Array;Bit Manipulation;Enumeration;,false,false,65.5879763048351,32773,49968
3561,"Remove Methods From Project",remove-methods-from-project,false,Medium,127,43,Algorithms,51.3%,3310,false,Depth-First Search;Breadth-First Search;Graph;,false,false,51.276393115142504,22075,43051
3578,"Construct 2D Grid Matching Graph Layout",construct-2d-grid-matching-graph-layout,false,Hard,71,11,Algorithms,31.0%,3311,false,Array;Hash Table;Graph;Matrix;,false,false,30.994525547445257,3397,10960
3583,"Sorted GCD Pair Queries",sorted-gcd-pair-queries,false,Hard,85,5,Algorithms,19.4%,3312,false,Array;Hash Table;Math;Binary Search;Combinatorics;Counting;Number Theory;Prefix Sum;,false,false,19.43091281584339,4268,21965
3497,"Find the Last Marked Nodes in Tree",find-the-last-marked-nodes-in-tree,true,Hard,4,1,Algorithms,68.9%,3313,true,Tree;Depth-First Search;,false,false,68.90243902439023,339,492
3605,"Construct the Minimum Bitwise Array I",construct-the-minimum-bitwise-array-i,false,Easy,65,10,Algorithms,75.1%,3314,false,Array;Bit Manipulation;,false,false,75.05758185369837,25744,34299
3611,"Construct the Minimum Bitwise Array II",construct-the-minimum-bitwise-array-ii,false,Medium,76,6,Algorithms,35.0%,3315,false,Array;Bit Manipulation;,false,false,34.95629868896067,14718,42104
3487,"Find Maximum Removals From Source String",find-maximum-removals-from-source-string,false,Medium,128,17,Algorithms,37.8%,3316,false,Array;Hash Table;Two Pointers;String;Dynamic Programming;,false,false,37.79826902855294,9346,24726
3604,"Find the Number of Possible Ways for an Event",find-the-number-of-possible-ways-for-an-event,false,Hard,64,11,Algorithms,37.2%,3317,false,Math;Dynamic Programming;Combinatorics;,false,false,37.20721529211164,4146,11143
3610,"Find X-Sum of All K-Long Subarrays I",find-x-sum-of-all-k-long-subarrays-i,false,Easy,93,53,Algorithms,63.8%,3318,false,Array;Hash Table;Sliding Window;Heap (Priority Queue);,false,false,63.763074073237405,28226,44265
3509,"K-th Largest Perfect Subtree Size in Binary Tree",k-th-largest-perfect-subtree-size-in-binary-tree,false,Medium,98,11,Algorithms,62.5%,3319,false,Tree;Depth-First Search;Sorting;Binary Tree;,false,false,62.50393115475884,21862,34973
3588,"Count The Number of Winning Sequences",count-the-number-of-winning-sequences,false,Hard,92,5,Algorithms,32.0%,3320,false,String;Dynamic Programming;,false,false,32.02475621604117,8900,27791
3592,"Find X-Sum of All K-Long Subarrays II",find-x-sum-of-all-k-long-subarrays-ii,false,Hard,73,4,Algorithms,15.7%,3321,false,Array;Hash Table;Sliding Window;Heap (Priority Queue);,false,false,15.656630365150544,3666,23415
3642,"Premier League Table Ranking III",premier-league-table-ranking-iii,true,Medium,3,0,Database,73.6%,3322,true,Database;,false,false,73.61419068736141,664,902
3565,"Minimize Connected Groups by Inserting Interval",minimize-connected-groups-by-inserting-interval,true,Medium,12,2,Algorithms,57.0%,3323,true,Array;Binary Search;Sliding Window;Sorting;,false,false,57.03125,657,1152
3566,"Find the Sequence of Strings Appeared on the Screen",find-the-sequence-of-strings-appeared-on-the-screen,false,Medium,109,9,Algorithms,80.4%,3324,false,String;Simulation;,false,false,80.37796076980015,34749,43232
3502,"Count Substrings With K-Frequency Characters I",count-substrings-with-k-frequency-characters-i,false,Medium,102,9,Algorithms,55.2%,3325,false,Hash Table;String;Sliding Window;,false,false,55.1731338750095,29063,52676
3607,"Minimum Division Operations to Make Array Non Decreasing",minimum-division-operations-to-make-array-non-decreasing,false,Medium,111,25,Algorithms,28.7%,3326,false,Array;Math;Greedy;Number Theory;,false,false,28.677307385911003,20159,70296
3603,"Check if DFS Strings Are Palindromes",check-if-dfs-strings-are-palindromes,false,Hard,70,11,Algorithms,19.8%,3327,false,Array;Hash Table;String;Tree;Depth-First Search;Hash Function;,false,false,19.772659288064613,4627,23401
3650,"Find Cities in Each State II",find-cities-in-each-state-ii,true,Medium,5,2,Database,71.0%,3328,true,Database;,false,false,70.98166127292342,658,927
3499,"Count Substrings With K-Frequency Characters II",count-substrings-with-k-frequency-characters-ii,true,Hard,5,1,Algorithms,73.5%,3329,true,Hash Table;String;Sliding Window;,false,false,73.54948805460751,431,586
3617,"Find the Original Typed String I",find-the-original-typed-string-i,false,Easy,63,6,Algorithms,56.6%,3330,false,String;,false,false,56.63191948238677,28359,50076
3576,"Find Subtree Sizes After Changes",find-subtree-sizes-after-changes,false,Medium,82,32,Algorithms,58.0%,3331,false,Array;Hash Table;String;Tree;Depth-First Search;,false,false,58.05010044688614,14157,24389
3587,"Maximum Points Tourist Can Earn",maximum-points-tourist-can-earn,false,Medium,75,13,Algorithms,49.0%,3332,false,Array;Dynamic Programming;Matrix;,false,false,49.03825465811782,11396,23239
3618,"Find the Original Typed String II",find-the-original-typed-string-ii,false,Hard,47,5,Algorithms,15.1%,3333,false,String;Dynamic Programming;Prefix Sum;,false,false,15.077590741714886,2293,15208
3593,"Find the Maximum Factor Score of Array",find-the-maximum-factor-score-of-array,false,Medium,74,12,Algorithms,40.4%,3334,false,Array;Math;Number Theory;,false,false,40.426315279527174,20862,51605
3629,"Total Characters in String After Transformations I",total-characters-in-string-after-transformations-i,false,Medium,113,7,Algorithms,26.4%,3335,false,Hash Table;Math;String;Dynamic Programming;Counting;,false,false,26.381474034528186,15220,57692
3608,"Find the Number of Subsequences With Equal GCD",find-the-number-of-subsequences-with-equal-gcd,false,Hard,77,7,Algorithms,38.6%,3336,false,Array;Math;Dynamic Programming;Number Theory;,false,false,38.57837585770435,5791,15011
3630,"Total Characters in String After Transformations II",total-characters-in-string-after-transformations-ii,false,Hard,53,6,Algorithms,32.2%,3337,false,Hash Table;Math;String;Dynamic Programming;Counting;,false,false,32.201665124884364,3481,10810
3660,"Second Highest Salary II",second-highest-salary-ii,true,Medium,2,0,Database,92.3%,3338,true,Database;,false,false,92.2566371681416,834,904
3614,"Find the Number of K-Even Arrays",find-the-number-of-k-even-arrays,true,Medium,4,3,Algorithms,58.4%,3339,true,Dynamic Programming;,false,false,58.362989323843415,328,562
3636,"Check Balanced String",check-balanced-string,false,Easy,72,0,Algorithms,83.4%,3340,false,String;,false,false,83.39699074074073,43228,51835
3627,"Find Minimum Time to Reach Last Room I",find-minimum-time-to-reach-last-room-i,false,Medium,119,34,Algorithms,34.6%,3341,false,Array;Graph;Heap (Priority Queue);Matrix;Shortest Path;,false,false,34.61701751282505,19569,56530
3628,"Find Minimum Time to Reach Last Room II",find-minimum-time-to-reach-last-room-ii,false,Medium,85,13,Algorithms,49.5%,3342,false,Array;Graph;Heap (Priority Queue);Matrix;Shortest Path;,false,false,49.511736088917296,13942,28159
3637,"Count Number of Balanced Permutations",count-number-of-balanced-permutations,false,Hard,67,3,Algorithms,15.6%,3343,false,Math;String;Dynamic Programming;Combinatorics;,false,false,15.609169743281532,3636,23294
3679,"Maximum Sized Array",maximum-sized-array,true,Medium,6,1,Algorithms,52.6%,3344,true,Binary Search;Bit Manipulation;,false,false,52.623456790123456,341,648
3626,"Smallest Divisible Digit Product I",smallest-divisible-digit-product-i,false,Easy,45,9,Algorithms,65.1%,3345,false,Math;Enumeration;,false,false,65.14781062458323,29310,44990
3622,"Maximum Frequency of an Element After Performing Operations I",maximum-frequency-of-an-element-after-performing-operations-i,false,Medium,116,25,Algorithms,20.0%,3346,false,Array;Binary Search;Sliding Window;Sorting;Prefix Sum;,false,false,19.989245209229566,12267,61368
3640,"Maximum Frequency of an Element After Performing Operations II",maximum-frequency-of-an-element-after-performing-operations-ii,false,Hard,55,4,Algorithms,38.8%,3347,false,Array;Binary Search;Sliding Window;Sorting;Prefix Sum;,false,false,38.76031802299084,7654,19747
3635,"Smallest Divisible Digit Product II",smallest-divisible-digit-product-ii,false,Hard,34,14,Algorithms,9.0%,3348,false,Math;String;Backtracking;Greedy;Number Theory;,false,false,9.042384190125183,1423,15737
3612,"Adjacent Increasing Subarrays Detection I",adjacent-increasing-subarrays-detection-i,false,Easy,78,15,Algorithms,39.8%,3349,false,Array;,false,false,39.778050275904356,32439,81550
3619,"Adjacent Increasing Subarrays Detection II",adjacent-increasing-subarrays-detection-ii,false,Medium,97,4,Algorithms,41.0%,3350,false,Array;Binary Search;,false,false,41.01558014010642,21429,52246
3646,"Sum of Good Subsequences",sum-of-good-subsequences,false,Hard,124,7,Algorithms,29.6%,3351,false,Array;Hash Table;Dynamic Programming;,false,false,29.554539349557096,9241,31270
3631,"Count K-Reducible Numbers Less Than N",count-k-reducible-numbers-less-than-n,false,Hard,54,2,Algorithms,27.9%,3352,false,Math;String;Dynamic Programming;Combinatorics;,false,false,27.87331110721179,3177,11398
3694,"Minimum Total Operations",minimum-total-operations,true,Easy,12,0,Algorithms,67.9%,3353,true,Array;,false,false,67.89087093389297,647,953
3616,"Make Array Elements Equal to Zero",make-array-elements-equal-to-zero,false,Easy,80,33,Algorithms,56.4%,3354,false,Array;Simulation;Prefix Sum;,false,false,56.35682401646738,24367,43237
3639,"Zero Array Transformation I",zero-array-transformation-i,false,Medium,149,19,Algorithms,41.4%,3355,false,Array;Prefix Sum;,false,false,41.35713006236871,25397,61409
3643,"Zero Array Transformation II",zero-array-transformation-ii,false,Medium,125,4,Algorithms,36.9%,3356,false,Array;Binary Search;Prefix Sum;,false,false,36.93554179010683,16457,44556
3658,"Minimize the Maximum Adjacent Element Difference",minimize-the-maximum-adjacent-element-difference,false,Hard,37,12,Algorithms,15.0%,3357,false,Array;Binary Search;Greedy;,false,false,14.991008664377963,1834,12234
3695,"Books with NULL Ratings",books-with-null-ratings,true,Easy,5,0,Database,91.9%,3358,true,Database;,false,false,91.93706981317601,935,1017
3652,"Find Sorted Submatrices With Maximum Element at Most K",find-sorted-submatrices-with-maximum-element-at-most-k,true,Hard,4,2,Algorithms,53.1%,3359,true,Array;Stack;Matrix;Monotonic Stack;,false,false,53.06666666666666,199,375
3625,"Stone Removal Game",stone-removal-game,false,Easy,50,4,Algorithms,41.6%,3360,false,Math;Simulation;,false,false,41.60283887288314,23682,56924
3591,"Shift Distance Between Two Strings",shift-distance-between-two-strings,false,Medium,49,31,Algorithms,53.4%,3361,false,Array;String;Prefix Sum;,false,false,53.379112352576044,13759,25772
3647,"Zero Array Transformation III",zero-array-transformation-iii,false,Medium,112,23,Algorithms,23.9%,3362,false,Array;Greedy;Sorting;Heap (Priority Queue);Prefix Sum;,false,false,23.915893505445744,4743,19832
3648,"Find the Maximum Number of Fruits Collected",find-the-maximum-number-of-fruits-collected,false,Hard,54,4,Algorithms,40.0%,3363,false,Array;Dynamic Programming;Matrix;,false,false,40.04854368932039,2805,7004
3644,"Minimum Positive Sum Subarray ",minimum-positive-sum-subarray,false,Easy,71,11,Algorithms,47.6%,3364,false,Array;Sliding Window;Prefix Sum;,false,false,47.558460050017345,26052,54780
3595,"Rearrange K Substrings to Form Target String",rearrange-k-substrings-to-form-target-string,false,Medium,65,6,Algorithms,51.7%,3365,false,Hash Table;String;Sorting;,false,false,51.702440618871215,18981,36709
3654,"Minimum Array Sum",minimum-array-sum,false,Medium,136,11,Algorithms,28.6%,3366,false,Array;Dynamic Programming;,false,false,28.6416638780921,11127,38849
3675,"Maximize Sum of Weights after Edge Removals",maximize-sum-of-weights-after-edge-removals,false,Hard,76,3,Algorithms,28.9%,3367,false,Dynamic Programming;Tree;Depth-First Search;,false,false,28.93343026274795,2786,9629
3703,"First Letter Capitalization",first-letter-capitalization,true,Hard,2,1,Database,87.5%,3368,true,Database;,false,false,87.5,343,392
3710,"Design an Array Statistics Tracker ",design-an-array-statistics-tracker,true,Hard,9,2,Algorithms,30.9%,3369,true,Hash Table;Binary Search;Design;Queue;Heap (Priority Queue);Data Stream;Ordered Set;,false,false,30.90560613320556,645,2087
3676,"Smallest Number With All Set Bits",smallest-number-with-all-set-bits,false,Easy,52,1,Algorithms,76.3%,3370,false,Math;Bit Manipulation;,false,false,76.34148226383988,29635,38819
3594,"Identify the Largest Outlier in an Array",identify-the-largest-outlier-in-an-array,false,Medium,129,18,Algorithms,29.3%,3371,false,Array;Hash Table;Counting;Enumeration;,false,false,29.260049584941967,23719,81069
3633,"Maximize the Number of Target Nodes After Connecting Trees I",maximize-the-number-of-target-nodes-after-connecting-trees-i,false,Medium,79,19,Algorithms,50.7%,3372,false,Tree;Depth-First Search;Breadth-First Search;,false,false,50.736174287766346,8477,16708
3645,"Maximize the Number of Target Nodes After Connecting Trees II",maximize-the-number-of-target-nodes-after-connecting-trees-ii,false,Hard,68,5,Algorithms,57.7%,3373,false,Tree;Depth-First Search;Breadth-First Search;,false,false,57.741761210156675,5344,9255
3711,"First Letter Capitalization II",first-letter-capitalization-ii,false,Hard,11,1,Database,77.4%,3374,false,Database;,false,false,77.44408945686901,1212,1565
3621,"Minimum Operations to Make Array Values Equal to K",minimum-operations-to-make-array-values-equal-to-k,false,Easy,37,44,Algorithms,51.8%,3375,false,Array;Hash Table;,false,false,51.79836876587779,19369,37394
3649,"Minimum Time to Break Locks I",minimum-time-to-break-locks-i,false,Medium,69,17,Algorithms,29.1%,3376,false,Array;Dynamic Programming;Backtracking;Bit Manipulation;Bitmask;,false,false,29.064561734213008,9868,33952
3655,"Digit Operations to Make Two Integers Equal",digit-operations-to-make-two-integers-equal,false,Medium,94,31,Algorithms,32.1%,3377,false,Math;Graph;Heap (Priority Queue);Number Theory;Shortest Path;,false,false,32.07226595684431,5663,17657
3680,"Count Connected Components in LCM Graph",count-connected-components-in-lcm-graph,false,Hard,56,1,Algorithms,27.7%,3378,false,Array;Hash Table;Math;Union Find;Number Theory;,false,false,27.675138328800525,2951,10663
3651,"Transformed Array",transformed-array,false,Easy,63,4,Algorithms,56.4%,3379,false,Array;Simulation;,false,false,56.34934162867005,26445,46927
3681,"Maximum Area Rectangle With Point Constraints I",maximum-area-rectangle-with-point-constraints-i,false,Medium,52,17,Algorithms,50.1%,3380,false,Array;Math;Binary Indexed Tree;Segment Tree;Geometry;Sorting;Enumeration;,false,false,50.09184682775187,10635,21231
3653,"Maximum Subarray Sum With Length Divisible by K",maximum-subarray-sum-with-length-divisible-by-k,false,Medium,141,5,Algorithms,27.0%,3381,false,Array;Hash Table;Prefix Sum;,false,false,27.039245597004573,9749,36055
3689,"Maximum Area Rectangle With Point Constraints II",maximum-area-rectangle-with-point-constraints-ii,false,Hard,37,9,Algorithms,19.9%,3382,false,Array;Math;Binary Indexed Tree;Segment Tree;Geometry;Sorting;,false,false,19.91812865497076,1703,8550
3718,"Minimum Runes to Add to Cast Spell",minimum-runes-to-add-to-cast-spell,true,Hard,7,2,Algorithms,52.6%,3383,true,Array;Depth-First Search;Breadth-First Search;Graph;Topological Sort;,false,false,52.595155709342556,304,578
3719,"Team Dominance by Pass Success",team-dominance-by-pass-success,true,Hard,1,0,Database,85.7%,3384,true,Database;,false,false,85.68181818181819,377,440
3693,"Minimum Time to Break Locks II",minimum-time-to-break-locks-ii,true,Hard,4,1,Algorithms,56.3%,3385,true,Array;Depth-First Search;Graph;,false,false,56.29370629370629,161,286
3632,"Button with Longest Push Time",button-with-longest-push-time,false,Easy,60,47,Algorithms,40.6%,3386,false,Array;,false,false,40.584000238003156,27283,67226
3613,"Maximize Amount After Two Days of Conversions",maximize-amount-after-two-days-of-conversions,false,Medium,91,29,Algorithms,57.6%,3387,false,Array;String;Depth-First Search;Breadth-First Search;Graph;,false,false,57.60881422493728,10562,18333
3686,"Count Beautiful Splits in an Array",count-beautiful-splits-in-an-array,false,Medium,78,19,Algorithms,14.8%,3388,false,Array;Dynamic Programming;,false,false,14.841873498799037,4449,29976
3638,"Minimum Operations to Make Character Frequencies Equal",minimum-operations-to-make-character-frequencies-equal,false,Hard,47,2,Algorithms,21.2%,3389,false,Hash Table;String;Dynamic Programming;Counting;Enumeration;,false,false,21.2058014977723,2236,10547
3726,"Longest Team Pass Streak",longest-team-pass-streak,true,Hard,2,1,Database,50.2%,3390,true,Database;,false,false,50.24630541871922,204,406
3735,"Design a 3D Binary Matrix with Efficient Layer Tracking",design-a-3d-binary-matrix-with-efficient-layer-tracking,true,Medium,5,1,Algorithms,73.4%,3391,true,,false,false,73.4375,329,448
3685,"Count Subarrays of Length Three With a Condition",count-subarrays-of-length-three-with-a-condition,false,Easy,32,5,Algorithms,52.9%,3392,false,,false,false,52.94498643889406,26158,49406
3659,"Count Paths With the Given XOR Value",count-paths-with-the-given-xor-value,false,Medium,59,7,Algorithms,38.4%,3393,false,,false,false,38.365463593757546,15881,41394
3657,"Check if Grid can be Cut into Sections",check-if-grid-can-be-cut-into-sections,false,Medium,69,2,Algorithms,39.2%,3394,false,,false,false,39.206716030750364,8313,21203
3700,"Subsequences with a Unique Middle Mode I",subsequences-with-a-unique-middle-mode-i,false,Hard,21,22,Algorithms,15.4%,3395,false,,false,false,15.415578764142731,1417,9192
3656,"Minimum Number of Operations to Make Elements in Array Distinct",minimum-number-of-operations-to-make-elements-in-array-distinct,false,Easy,75,5,Algorithms,56.0%,3396,false,,false,false,55.96430172726691,26212,46837
3620,"Maximum Number of Distinct Elements After Operations",maximum-number-of-distinct-elements-after-operations,false,Medium,129,7,Algorithms,29.2%,3397,false,,false,false,29.159648480410105,15927,54620
3690,"Smallest Substring With Identical Characters I",smallest-substring-with-identical-characters-i,false,Hard,74,3,Algorithms,18.0%,3398,false,,false,false,17.956577266922093,4920,27403
3706,"Smallest Substring With Identical Characters II",smallest-substring-with-identical-characters-ii,false,Hard,38,3,Algorithms,44.1%,3399,false,,false,false,44.0601077402892,4662,10581
3740,"Maximum Number of Matching Indices After Right Shifts",maximum-number-of-matching-indices-after-right-shifts,true,Medium,5,1,Algorithms,91.9%,3400,true,,false,false,91.87279151943463,520,566
3746,"Find Circular Gift Exchange Chains",find-circular-gift-exchange-chains,true,Hard,0,0,Database,74.0%,3401,true,,false,false,73.9795918367347,145,196
3691,"Minimum Operations to Make Columns Strictly Increasing",minimum-operations-to-make-columns-strictly-increasing,false,Easy,40,3,Algorithms,72.9%,3402,false,,false,false,72.89090488847798,25223,34606
3683,"Find the Lexicographically Largest String From the Box I",find-the-lexicographically-largest-string-from-the-box-i,false,Medium,83,22,Algorithms,22.4%,3403,false,,false,false,22.40440689465777,13868,61900
3699,"Count Special Subsequences",count-special-subsequences,false,Medium,115,12,Algorithms,22.2%,3404,false,,false,false,22.254392575258795,5609,25211
3682,"Count the Number of Arrays with K Matching Adjacent Elements",count-the-number-of-arrays-with-k-matching-adjacent-elements,false,Hard,48,5,Algorithms,35.1%,3405,false,,false,false,35.116256817529425,3669,10449
3749,"Find the Lexicographically Largest String From the Box II",find-the-lexicographically-largest-string-from-the-box-ii,true,Hard,3,1,Algorithms,56.4%,3406,true,,false,false,56.437768240343345,263,466
3684,"Substring Matching Pattern",substring-matching-pattern,false,Easy,33,22,Algorithms,21.9%,3407,false,,false,false,21.91711750998215,16053,73278
3678,"Design Task Manager",design-task-manager,false,Medium,37,8,Algorithms,29.7%,3408,false,,false,false,29.724777503552463,7928,26693
3716,"Longest Subsequence With Decreasing Adjacent Difference",longest-subsequence-with-decreasing-adjacent-difference,false,Medium,42,7,Algorithms,7.7%,3409,false,,false,false,7.741964608161791,1703,22099
3688,"Maximize Subarray Sum After Removing All Occurrences of One Element",maximize-subarray-sum-after-removing-all-occurrences-of-one-element,false,Hard,8,1,Algorithms,6.6%,3410,false,,false,false,6.641965143406066,479,7268
3702,"Maximum Subarray With Equal Products",maximum-subarray-with-equal-products,false,Easy,20,12,Algorithms,42.3%,3411,false,,false,false,42.37890236926875,14005,33073
3634,"Find Mirror Score of a String",find-mirror-score-of-a-string,false,Medium,24,3,Algorithms,30.5%,3412,false,,false,false,30.616241862517928,11009,36042
3715,"Maximum Coins From K Consecutive Bags",maximum-coins-from-k-consecutive-bags,false,Medium,40,5,Algorithms,13.5%,3413,false,,false,false,13.578348454559434,1746,12926
3562,"Maximum Score of Non-overlapping Intervals",maximum-score-of-non-overlapping-intervals,false,Hard,8,2,Algorithms,21.8%,3414,false,,false,false,21.83491355270496,778,3571