acRate,difficulty,frontendQuestionId,isFavor,paidOnly,title,titleSlug,topicTags,hasSolution,hasVideoSolution
55.32585431246137,Easy,1,False,False,Two Sum,two-sum,"['Array', 'Hash Table']",True,True
45.704411110949664,Medium,2,False,False,Add Two Numbers,add-two-numbers,"['Linked List', 'Math', 'Recursion']",True,True
36.53266195940197,Medium,3,False,False,Longest Substring Without Repeating Characters,longest-substring-without-repeating-characters,"['Hash Table', 'String', 'Sliding Window']",True,True
43.21953807396498,Hard,4,False,False,Median of Two Sorted Arrays,median-of-two-sorted-arrays,"['Array', 'Binary Search', 'Divide and Conquer']",True,True
35.481251820068806,Medium,5,False,False,Longest Palindromic Substring,longest-palindromic-substring,"['Two Pointers', 'String', 'Dynamic Programming']",True,True
51.05351030920713,Medium,6,False,False,Zigzag Conversion,zigzag-conversion,['String'],True,True
29.998962373693704,Medium,7,False,False,Reverse Integer,reverse-integer,['Math'],True,True
18.883423761472542,Medium,8,False,False,String to Integer (atoi),string-to-integer-atoi,['String'],True,False
58.85029573775268,Easy,9,False,False,Palindrome Number,palindrome-number,['Math'],True,True
29.05733389816218,Hard,10,False,False,Regular Expression Matching,regular-expression-matching,"['String', 'Dynamic Programming', 'Recursion']",True,False
57.38637078890165,Medium,11,False,False,Container With Most Water,container-with-most-water,"['Array', 'Two Pointers', 'Greedy']",True,True
68.0793132571126,Medium,12,False,False,Integer to Roman,integer-to-roman,"['Hash Table', 'Math', 'String']",True,True
64.40139450155587,Easy,13,False,False,Roman to Integer,roman-to-integer,"['Hash Table', 'Math', 'String']",True,True
45.09105460550747,Easy,14,False,False,Longest Common Prefix,longest-common-prefix,"['String', 'Trie']",True,True
36.65510003440354,Medium,15,False,False,3Sum,3sum,"['Array', 'Two Pointers', 'Sorting']",True,True
46.68625194837994,Medium,16,False,False,3Sum Closest,3sum-closest,"['Array', 'Two Pointers', 'Sorting']",True,True
63.35228021426222,Medium,17,False,False,Letter Combinations of a Phone Number,letter-combinations-of-a-phone-number,"['Hash Table', 'String', 'Backtracking']",True,False
37.795272452845,Medium,18,False,False,4Sum,4sum,"['Array', 'Two Pointers', 'Sorting']",True,False
48.39138170474623,Medium,19,False,False,Remove Nth Node From End of List,remove-nth-node-from-end-of-list,"['Linked List', 'Two Pointers']",True,True
42.014175046505926,Easy,20,False,False,Valid Parentheses,valid-parentheses,"['String', 'Stack']",True,True
66.47977328505019,Easy,21,False,False,Merge Two Sorted Lists,merge-two-sorted-lists,"['Linked List', 'Recursion']",True,True
76.73858637694374,Medium,22,False,False,Generate Parentheses,generate-parentheses,"['String', 'Dynamic Programming', 'Backtracking']",True,True
56.13993332098537,Hard,23,False,False,Merge k Sorted Lists,merge-k-sorted-lists,"['Linked List', 'Divide and Conquer', 'Heap (Priority Queue)', 'Merge Sort']",True,True
66.73748832489265,Medium,24,False,False,Swap Nodes in Pairs,swap-nodes-in-pairs,"['Linked List', 'Recursion']",True,False
62.38060257554574,Hard,25,False,False,Reverse Nodes in k-Group,reverse-nodes-in-k-group,"['Linked List', 'Recursion']",True,False
59.790431572862026,Easy,26,False,False,Remove Duplicates from Sorted Array,remove-duplicates-from-sorted-array,"['Array', 'Two Pointers']",True,True
59.670013626256214,Easy,27,False,False,Remove Element,remove-element,"['Array', 'Two Pointers']",True,True
44.64272830268887,Easy,28,False,False,Find the Index of the First Occurrence in a String,find-the-index-of-the-first-occurrence-in-a-string,"['Two Pointers', 'String', 'String Matching']",True,True
18.22850544373474,Medium,29,False,False,Divide Two Integers,divide-two-integers,"['Math', 'Bit Manipulation']",True,False
32.85574702797397,Hard,30,False,False,Substring with Concatenation of All Words,substring-with-concatenation-of-all-words,"['Hash Table', 'String', 'Sliding Window']",True,True
42.57286061559552,Medium,31,False,False,Next Permutation,next-permutation,"['Array', 'Two Pointers']",True,True
35.88470902571685,Hard,32,False,False,Longest Valid Parentheses,longest-valid-parentheses,"['String', 'Dynamic Programming', 'Stack']",True,False
42.49761626349072,Medium,33,False,False,Search in Rotated Sorted Array,search-in-rotated-sorted-array,"['Array', 'Binary Search']",True,False
46.37332727775251,Medium,34,False,False,Find First and Last Position of Element in Sorted Array,find-first-and-last-position-of-element-in-sorted-array,"['Array', 'Binary Search']",True,False
48.56338276522516,Easy,35,False,False,Search Insert Position,search-insert-position,"['Array', 'Binary Search']",True,True
61.88105753166876,Medium,36,False,False,Valid Sudoku,valid-sudoku,"['Array', 'Hash Table', 'Matrix']",True,False
63.70636136418608,Hard,37,False,False,Sudoku Solver,sudoku-solver,"['Array', 'Hash Table', 'Backtracking', 'Matrix']",True,False
58.163839917040924,Medium,38,False,False,Count and Say,count-and-say,['String'],True,False
74.17482928987673,Medium,39,False,False,Combination Sum,combination-sum,"['Array', 'Backtracking']",True,True
57.334587336001306,Medium,40,False,False,Combination Sum II,combination-sum-ii,"['Array', 'Backtracking']",True,False
40.79074752537147,Hard,41,False,False,First Missing Positive,first-missing-positive,"['Array', 'Hash Table']",True,False
64.54800550101851,Hard,42,False,False,Trapping Rain Water,trapping-rain-water,"['Array', 'Two Pointers', 'Dynamic Programming', 'Stack', 'Monotonic Stack']",True,False
41.99278377903678,Medium,43,False,False,Multiply Strings,multiply-strings,"['Math', 'String', 'Simulation']",True,False
29.521067360840892,Hard,44,False,False,Wildcard Matching,wildcard-matching,"['String', 'Dynamic Programming', 'Greedy', 'Recursion']",True,False
41.23835732745089,Medium,45,False,False,Jump Game II,jump-game-ii,"['Array', 'Dynamic Programming', 'Greedy']",True,False
80.32223826088229,Medium,46,False,False,Permutations,permutations,"['Array', 'Backtracking']",True,False
61.19496695115565,Medium,47,False,False,Permutations II,permutations-ii,"['Array', 'Backtracking', 'Sorting']",True,False
77.41395736655889,Medium,48,False,False,Rotate Image,rotate-image,"['Array', 'Math', 'Matrix']",True,False
70.5572662582935,Medium,49,False,False,Group Anagrams,group-anagrams,"['Array', 'Hash Table', 'String', 'Sorting']",True,True
36.68207784402375,Medium,50,False,False,"Pow(x, n)",powx-n,"['Math', 'Recursion']",True,False
72.03651046667065,Hard,51,False,False,N-Queens,n-queens,"['Array', 'Backtracking']",True,False
76.26205612975849,Hard,52,False,False,N-Queens II,n-queens-ii,['Backtracking'],True,False
51.856984162877914,Medium,53,False,False,Maximum Subarray,maximum-subarray,"['Array', 'Divide and Conquer', 'Dynamic Programming']",True,True
53.28543732754548,Medium,54,False,False,Spiral Matrix,spiral-matrix,"['Array', 'Matrix', 'Simulation']",True,False
39.208807028620676,Medium,55,False,False,Jump Game,jump-game,"['Array', 'Dynamic Programming', 'Greedy']",True,False
49.017818618218996,Medium,56,False,False,Merge Intervals,merge-intervals,"['Array', 'Sorting']",True,True
43.11610116029291,Medium,57,False,False,Insert Interval,insert-interval,['Array'],True,False
55.75914509337545,Easy,58,False,False,Length of Last Word,length-of-last-word,['String'],True,False
73.11256996271193,Medium,59,False,False,Spiral Matrix II,spiral-matrix-ii,"['Array', 'Matrix', 'Simulation']",True,False
49.39853883875239,Hard,60,False,False,Permutation Sequence,permutation-sequence,"['Math', 'Recursion']",True,False
39.58616466769273,Medium,61,False,False,Rotate List,rotate-list,"['Linked List', 'Two Pointers']",True,False
65.53006461580337,Medium,62,False,False,Unique Paths,unique-paths,"['Math', 'Dynamic Programming', 'Combinatorics']",True,False
42.8798137338955,Medium,63,False,False,Unique Paths II,unique-paths-ii,"['Array', 'Dynamic Programming', 'Matrix']",True,False
66.05915402258931,Medium,64,False,False,Minimum Path Sum,minimum-path-sum,"['Array', 'Dynamic Programming', 'Matrix']",True,False
21.254069053844923,Hard,65,False,False,Valid Number,valid-number,['String'],True,False
47.21795386110077,Easy,66,False,False,Plus One,plus-one,"['Array', 'Math']",True,False
55.35535152388873,Easy,67,False,False,Add Binary,add-binary,"['Math', 'String', 'Bit Manipulation', 'Simulation']",True,False
47.47001920612862,Hard,68,False,False,Text Justification,text-justification,"['Array', 'String', 'Simulation']",True,False
40.14846281542911,Easy,69,False,False,Sqrt(x),sqrtx,"['Math', 'Binary Search']",True,True
53.40586674556813,Easy,70,False,False,Climbing Stairs,climbing-stairs,"['Math', 'Dynamic Programming', 'Memoization']",True,False
47.03654259964322,Medium,71,False,False,Simplify Path,simplify-path,"['String', 'Stack']",True,True
58.37253922779719,Medium,72,False,False,Edit Distance,edit-distance,"['String', 'Dynamic Programming']",True,False
59.237687013872254,Medium,73,False,False,Set Matrix Zeroes,set-matrix-zeroes,"['Array', 'Hash Table', 'Matrix']",True,False
51.93615839678244,Medium,74,False,False,Search a 2D Matrix,search-a-2d-matrix,"['Array', 'Binary Search', 'Matrix']",True,False
66.62584948187974,Medium,75,False,False,Sort Colors,sort-colors,"['Array', 'Two Pointers', 'Sorting']",True,False
44.88927254672343,Hard,76,False,False,Minimum Window Substring,minimum-window-substring,"['Hash Table', 'String', 'Sliding Window']",True,False
72.48905682866528,Medium,77,False,False,Combinations,combinations,['Backtracking'],True,False
80.46166932893514,Medium,78,False,False,Subsets,subsets,"['Array', 'Backtracking', 'Bit Manipulation']",True,True
44.8280685348205,Medium,79,False,False,Word Search,word-search,"['Array', 'String', 'Backtracking', 'Depth-First Search', 'Matrix']",True,False
62.47353691493218,Medium,80,False,False,Remove Duplicates from Sorted Array II,remove-duplicates-from-sorted-array-ii,"['Array', 'Two Pointers']",True,False
38.67160389142475,Medium,81,False,False,Search in Rotated Sorted Array II,search-in-rotated-sorted-array-ii,"['Array', 'Binary Search']",True,False
49.453778952208424,Medium,82,False,False,Remove Duplicates from Sorted List II,remove-duplicates-from-sorted-list-ii,"['Linked List', 'Two Pointers']",True,False
54.526305790167086,Easy,83,False,False,Remove Duplicates from Sorted List,remove-duplicates-from-sorted-list,['Linked List'],True,True
46.827894581957295,Hard,84,False,False,Largest Rectangle in Histogram,largest-rectangle-in-histogram,"['Array', 'Stack', 'Monotonic Stack']",True,True
53.11206834635055,Hard,85,False,False,Maximal Rectangle,maximal-rectangle,"['Array', 'Dynamic Programming', 'Stack', 'Matrix', 'Monotonic Stack']",True,False
58.53383111010804,Medium,86,False,False,Partition List,partition-list,"['Linked List', 'Two Pointers']",True,False
41.82100960823774,Hard,87,False,False,Scramble String,scramble-string,"['String', 'Dynamic Programming']",True,False
52.48448426066158,Easy,88,False,False,Merge Sorted Array,merge-sorted-array,"['Array', 'Two Pointers', 'Sorting']",True,True
61.38800864241988,Medium,89,False,False,Gray Code,gray-code,"['Math', 'Backtracking', 'Bit Manipulation']",True,False
59.08220843912342,Medium,90,False,False,Subsets II,subsets-ii,"['Array', 'Backtracking', 'Bit Manipulation']",True,False
36.24152581776716,Medium,91,False,False,Decode Ways,decode-ways,"['String', 'Dynamic Programming']",True,True
49.26211551521298,Medium,92,False,False,Reverse Linked List II,reverse-linked-list-ii,['Linked List'],True,True
52.6022539191415,Medium,93,False,False,Restore IP Addresses,restore-ip-addresses,"['String', 'Backtracking']",True,False
78.20589737717746,Easy,94,False,False,Binary Tree Inorder Traversal,binary-tree-inorder-traversal,"['Stack', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
59.960737412385825,Medium,95,False,False,Unique Binary Search Trees II,unique-binary-search-trees-ii,"['Dynamic Programming', 'Backtracking', 'Tree', 'Binary Search Tree', 'Binary Tree']",True,False
62.223596180654795,Medium,96,False,False,Unique Binary Search Trees,unique-binary-search-trees,"['Math', 'Dynamic Programming', 'Tree', 'Binary Search Tree', 'Binary Tree']",True,False
41.579849037848646,Medium,97,False,False,Interleaving String,interleaving-string,"['String', 'Dynamic Programming']",True,False
34.11056802559829,Medium,98,False,False,Validate Binary Search Tree,validate-binary-search-tree,"['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",True,True
55.70758076477843,Medium,99,False,False,Recover Binary Search Tree,recover-binary-search-tree,"['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",True,False
64.63721997383307,Easy,100,False,False,Same Tree,same-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,True
58.84787078991024,Easy,101,False,False,Symmetric Tree,symmetric-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,True
70.08174453677458,Medium,102,False,False,Binary Tree Level Order Traversal,binary-tree-level-order-traversal,"['Tree', 'Breadth-First Search', 'Binary Tree']",True,False
61.23410984474313,Medium,103,False,False,Binary Tree Zigzag Level Order Traversal,binary-tree-zigzag-level-order-traversal,"['Tree', 'Breadth-First Search', 'Binary Tree']",True,False
76.88843143428716,Easy,104,False,False,Maximum Depth of Binary Tree,maximum-depth-of-binary-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,True
66.35663492855096,Medium,105,False,False,Construct Binary Tree from Preorder and Inorder Traversal,construct-binary-tree-from-preorder-and-inorder-traversal,"['Array', 'Hash Table', 'Divide and Conquer', 'Tree', 'Binary Tree']",True,False
65.87913731814055,Medium,106,False,False,Construct Binary Tree from Inorder and Postorder Traversal,construct-binary-tree-from-inorder-and-postorder-traversal,"['Array', 'Hash Table', 'Divide and Conquer', 'Tree', 'Binary Tree']",True,False
65.56805089892934,Medium,107,False,False,Binary Tree Level Order Traversal II,binary-tree-level-order-traversal-ii,"['Tree', 'Breadth-First Search', 'Binary Tree']",True,False
73.73837506858537,Easy,108,False,False,Convert Sorted Array to Binary Search Tree,convert-sorted-array-to-binary-search-tree,"['Array', 'Divide and Conquer', 'Tree', 'Binary Search Tree', 'Binary Tree']",True,True
64.07128232055696,Medium,109,False,False,Convert Sorted List to Binary Search Tree,convert-sorted-list-to-binary-search-tree,"['Linked List', 'Divide and Conquer', 'Tree', 'Binary Search Tree', 'Binary Tree']",True,True
54.84580778050731,Easy,110,False,False,Balanced Binary Tree,balanced-binary-tree,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
50.22250152802686,Easy,111,False,False,Minimum Depth of Binary Tree,minimum-depth-of-binary-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
52.585529755016516,Easy,112,False,False,Path Sum,path-sum,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
60.15894522241499,Medium,113,False,False,Path Sum II,path-sum-ii,"['Backtracking', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
67.95135671662553,Medium,114,False,False,Flatten Binary Tree to Linked List,flatten-binary-tree-to-linked-list,"['Linked List', 'Stack', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
49.64461157136712,Hard,115,False,False,Distinct Subsequences,distinct-subsequences,"['String', 'Dynamic Programming']",True,False
65.05375516072644,Medium,116,False,False,Populating Next Right Pointers in Each Node,populating-next-right-pointers-in-each-node,"['Linked List', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
55.114076489344455,Medium,117,False,False,Populating Next Right Pointers in Each Node II,populating-next-right-pointers-in-each-node-ii,"['Linked List', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
76.62019793551134,Easy,118,False,False,Pascal's Triangle,pascals-triangle,"['Array', 'Dynamic Programming']",True,True
65.64332740247664,Easy,119,False,False,Pascal's Triangle II,pascals-triangle-ii,"['Array', 'Dynamic Programming']",True,False
58.81466283479497,Medium,120,False,False,Triangle,triangle,"['Array', 'Dynamic Programming']",True,False
54.917541416626605,Easy,121,False,False,Best Time to Buy and Sell Stock,best-time-to-buy-and-sell-stock,"['Array', 'Dynamic Programming']",True,True
69.08096981252993,Medium,122,False,False,Best Time to Buy and Sell Stock II,best-time-to-buy-and-sell-stock-ii,"['Array', 'Dynamic Programming', 'Greedy']",True,True
50.49674341834229,Hard,123,False,False,Best Time to Buy and Sell Stock III,best-time-to-buy-and-sell-stock-iii,"['Array', 'Dynamic Programming']",True,False
41.01705434340362,Hard,124,False,False,Binary Tree Maximum Path Sum,binary-tree-maximum-path-sum,"['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
50.43772738389903,Easy,125,False,False,Valid Palindrome,valid-palindrome,"['Two Pointers', 'String']",True,False
27.128707140135987,Hard,126,False,False,Word Ladder II,word-ladder-ii,"['Hash Table', 'String', 'Backtracking', 'Breadth-First Search']",True,False
42.170272147323686,Hard,127,False,False,Word Ladder,word-ladder,"['Hash Table', 'String', 'Breadth-First Search']",True,True
47.13009989735594,Medium,128,False,False,Longest Consecutive Sequence,longest-consecutive-sequence,"['Array', 'Hash Table', 'Union Find']",True,False
68.13143482468416,Medium,129,False,False,Sum Root to Leaf Numbers,sum-root-to-leaf-numbers,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
42.326444279887085,Medium,130,False,False,Surrounded Regions,surrounded-regions,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']",True,False
71.61107069454218,Medium,131,False,False,Palindrome Partitioning,palindrome-partitioning,"['String', 'Dynamic Programming', 'Backtracking']",True,False
34.983781488068374,Hard,132,False,False,Palindrome Partitioning II,palindrome-partitioning-ii,"['String', 'Dynamic Programming']",True,False
61.58938834133822,Medium,133,False,False,Clone Graph,clone-graph,"['Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Graph']",True,False
46.09316555148453,Medium,134,False,False,Gas Station,gas-station,"['Array', 'Greedy']",True,False
44.502524582756216,Hard,135,False,False,Candy,candy,"['Array', 'Greedy']",True,False
75.55385607802721,Easy,136,False,False,Single Number,single-number,"['Array', 'Bit Manipulation']",True,False
64.86222066956945,Medium,137,False,False,Single Number II,single-number-ii,"['Array', 'Bit Manipulation']",True,False
59.858387632279296,Medium,138,False,False,Copy List with Random Pointer,copy-list-with-random-pointer,"['Hash Table', 'Linked List']",True,False
48.01360441257331,Medium,139,False,False,Word Break,word-break,"['Array', 'Hash Table', 'String', 'Dynamic Programming', 'Trie', 'Memoization']",True,True
53.1695277538508,Hard,140,False,False,Word Break II,word-break-ii,"['Array', 'Hash Table', 'String', 'Dynamic Programming', 'Backtracking', 'Trie', 'Memoization']",True,False
52.170690714296505,Easy,141,False,False,Linked List Cycle,linked-list-cycle,"['Hash Table', 'Linked List', 'Two Pointers']",True,True
54.30016759480062,Medium,142,False,False,Linked List Cycle II,linked-list-cycle-ii,"['Hash Table', 'Linked List', 'Two Pointers']",True,False
61.89578500602961,Medium,143,False,False,Reorder List,reorder-list,"['Linked List', 'Two Pointers', 'Stack', 'Recursion']",True,False
72.61416965380624,Easy,144,False,False,Binary Tree Preorder Traversal,binary-tree-preorder-traversal,"['Stack', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
75.17174123703069,Easy,145,False,False,Binary Tree Postorder Traversal,binary-tree-postorder-traversal,"['Stack', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
44.7034071213883,Medium,146,False,False,LRU Cache,lru-cache,"['Hash Table', 'Linked List', 'Design', 'Doubly-Linked List']",True,False
56.001725328273075,Medium,147,False,False,Insertion Sort List,insertion-sort-list,"['Linked List', 'Sorting']",True,True
61.171883322252306,Medium,148,False,False,Sort List,sort-list,"['Linked List', 'Two Pointers', 'Divide and Conquer', 'Sorting', 'Merge Sort']",True,False
28.603217601087582,Hard,149,False,False,Max Points on a Line,max-points-on-a-line,"['Array', 'Hash Table', 'Math', 'Geometry']",True,False
54.36149392828603,Medium,150,False,False,Evaluate Reverse Polish Notation,evaluate-reverse-polish-notation,"['Array', 'Math', 'Stack']",True,False
50.76627963532967,Medium,151,False,False,Reverse Words in a String,reverse-words-in-a-string,"['Two Pointers', 'String']",True,False
34.661621126663164,Medium,152,False,False,Maximum Product Subarray,maximum-product-subarray,"['Array', 'Dynamic Programming']",True,False
52.32178284315621,Medium,153,False,False,Find Minimum in Rotated Sorted Array,find-minimum-in-rotated-sorted-array,"['Array', 'Binary Search']",True,False
44.03912973299012,Hard,154,False,False,Find Minimum in Rotated Sorted Array II,find-minimum-in-rotated-sorted-array-ii,"['Array', 'Binary Search']",True,False
56.100879422758545,Medium,155,False,False,Min Stack,min-stack,"['Stack', 'Design']",True,False
64.27365991428556,Medium,156,False,True,Binary Tree Upside Down,binary-tree-upside-down,"['Tree', 'Depth-First Search', 'Binary Tree']",False,False
42.13558441776017,Easy,157,False,True,Read N Characters Given Read4,read-n-characters-given-read4,"['Array', 'Simulation', 'Interactive']",True,False
42.792484346129584,Hard,158,False,True,Read N Characters Given read4 II - Call Multiple Times,read-n-characters-given-read4-ii-call-multiple-times,"['Array', 'Simulation', 'Interactive']",False,False
56.166546472829836,Medium,159,False,True,Longest Substring with At Most Two Distinct Characters,longest-substring-with-at-most-two-distinct-characters,"['Hash Table', 'String', 'Sliding Window']",True,True
60.54281906473524,Easy,160,False,False,Intersection of Two Linked Lists,intersection-of-two-linked-lists,"['Hash Table', 'Linked List', 'Two Pointers']",True,True
34.462399533226,Medium,161,False,True,One Edit Distance,one-edit-distance,"['Two Pointers', 'String']",True,False
46.396559377413055,Medium,162,False,False,Find Peak Element,find-peak-element,"['Array', 'Binary Search']",True,True
35.07924348265546,Easy,163,False,True,Missing Ranges,missing-ranges,['Array'],True,False
48.81446594023468,Medium,164,False,False,Maximum Gap,maximum-gap,"['Array', 'Sorting', 'Bucket Sort', 'Radix Sort']",True,False
42.07519055086168,Medium,165,False,False,Compare Version Numbers,compare-version-numbers,"['Two Pointers', 'String']",True,False
25.99917039660628,Medium,166,False,False,Fraction to Recurring Decimal,fraction-to-recurring-decimal,"['Hash Table', 'Math', 'String']",True,False
63.05176932826424,Medium,167,False,False,Two Sum II - Input Array Is Sorted,two-sum-ii-input-array-is-sorted,"['Array', 'Two Pointers', 'Binary Search']",True,False
43.06426068203262,Easy,168,False,False,Excel Sheet Column Title,excel-sheet-column-title,"['Math', 'String']",True,False
65.56892143374714,Easy,169,False,False,Majority Element,majority-element,"['Array', 'Hash Table', 'Divide and Conquer', 'Sorting', 'Counting']",True,False
38.60033521325587,Easy,170,False,True,Two Sum III - Data structure design,two-sum-iii-data-structure-design,"['Array', 'Hash Table', 'Two Pointers', 'Design', 'Data Stream']",True,False
65.41758504708174,Easy,171,False,False,Excel Sheet Column Number,excel-sheet-column-number,"['Math', 'String']",True,False
44.57352967694449,Medium,172,False,False,Factorial Trailing Zeroes,factorial-trailing-zeroes,['Math'],True,False
74.47714020382705,Medium,173,False,False,Binary Search Tree Iterator,binary-search-tree-iterator,"['Stack', 'Tree', 'Design', 'Binary Search Tree', 'Binary Tree', 'Iterator']",True,False
39.23273823626422,Hard,174,False,False,Dungeon Game,dungeon-game,"['Array', 'Dynamic Programming', 'Matrix']",True,False
77.72856386610518,Easy,175,False,False,Combine Two Tables,combine-two-tables,['Database'],True,False
43.23549375846015,Medium,176,False,False,Second Highest Salary,second-highest-salary,['Database'],True,False
37.87709693858367,Medium,177,False,False,Nth Highest Salary,nth-highest-salary,['Database'],True,False
64.76711239521113,Medium,178,False,False,Rank Scores,rank-scores,['Database'],True,False
40.98636892858161,Medium,179,False,False,Largest Number,largest-number,"['Array', 'String', 'Greedy', 'Sorting']",True,False
45.63540555897164,Medium,180,False,False,Consecutive Numbers,consecutive-numbers,['Database'],True,False
71.20616161597785,Easy,181,False,False,Employees Earning More Than Their Managers,employees-earning-more-than-their-managers,['Database'],True,False
72.20110760250282,Easy,182,False,False,Duplicate Emails,duplicate-emails,['Database'],True,False
70.41864947195337,Easy,183,False,False,Customers Who Never Order,customers-who-never-order,['Database'],True,False
54.14050839284484,Medium,184,False,False,Department Highest Salary,department-highest-salary,['Database'],True,False
57.12175650176692,Hard,185,False,False,Department Top Three Salaries,department-top-three-salaries,['Database'],True,False
55.875064699792965,Medium,186,False,True,Reverse Words in a String II,reverse-words-in-a-string-ii,"['Two Pointers', 'String']",True,True
50.91627661023838,Medium,187,False,False,Repeated DNA Sequences,repeated-dna-sequences,"['Hash Table', 'String', 'Bit Manipulation', 'Sliding Window', 'Rolling Hash', 'Hash Function']",True,False
46.34749636596209,Hard,188,False,False,Best Time to Buy and Sell Stock IV,best-time-to-buy-and-sell-stock-iv,"['Array', 'Dynamic Programming']",True,False
42.64457806431453,Medium,189,False,False,Rotate Array,rotate-array,"['Array', 'Math', 'Two Pointers']",True,False
62.512268694533766,Easy,190,False,False,Reverse Bits,reverse-bits,"['Divide and Conquer', 'Bit Manipulation']",True,False
74.00448077055407,Easy,191,False,False,Number of 1 Bits,number-of-1-bits,"['Divide and Conquer', 'Bit Manipulation']",True,False
26.98886307613187,Medium,192,False,False,Word Frequency,word-frequency,['Shell'],False,False
27.104746100770523,Easy,193,False,False,Valid Phone Numbers,valid-phone-numbers,['Shell'],False,False
28.09624785953207,Medium,194,False,False,Transpose File,transpose-file,['Shell'],False,False
34.31058686803683,Easy,195,False,False,Tenth Line,tenth-line,['Shell'],False,False
63.97106716208014,Easy,196,False,False,Delete Duplicate Emails,delete-duplicate-emails,['Database'],True,False
49.95328567006882,Easy,197,False,False,Rising Temperature,rising-temperature,['Database'],True,False
52.08982086559484,Medium,198,False,False,House Robber,house-robber,"['Array', 'Dynamic Programming']",True,False
66.16452373604615,Medium,199,False,False,Binary Tree Right Side View,binary-tree-right-side-view,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,True
61.84977470033564,Medium,200,False,False,Number of Islands,number-of-islands,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']",True,True
47.53928504251297,Medium,201,False,False,Bitwise AND of Numbers Range,bitwise-and-of-numbers-range,['Bit Manipulation'],True,False
57.72668627820219,Easy,202,False,False,Happy Number,happy-number,"['Hash Table', 'Math', 'Two Pointers']",True,False
51.39575568570777,Easy,203,False,False,Remove Linked List Elements,remove-linked-list-elements,"['Linked List', 'Recursion']",True,False
34.54131075943778,Medium,204,False,False,Count Primes,count-primes,"['Array', 'Math', 'Enumeration', 'Number Theory']",True,False
46.556533060501,Easy,205,False,False,Isomorphic Strings,isomorphic-strings,"['Hash Table', 'String']",True,False
78.84051756162391,Easy,206,False,False,Reverse Linked List,reverse-linked-list,"['Linked List', 'Recursion']",True,True
48.70314668601601,Medium,207,False,False,Course Schedule,course-schedule,"['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']",True,False
67.66522747109457,Medium,208,False,False,Implement Trie (Prefix Tree),implement-trie-prefix-tree,"['Hash Table', 'String', 'Design', 'Trie']",True,False
48.95424548715766,Medium,209,False,False,Minimum Size Subarray Sum,minimum-size-subarray-sum,"['Array', 'Binary Search', 'Sliding Window', 'Prefix Sum']",True,False
52.89729193659325,Medium,210,False,False,Course Schedule II,course-schedule-ii,"['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']",True,True
46.86278290181542,Medium,211,False,False,Design Add and Search Words Data Structure,design-add-and-search-words-data-structure,"['String', 'Depth-First Search', 'Design', 'Trie']",True,False
37.11179144883208,Hard,212,False,False,Word Search II,word-search-ii,"['Array', 'String', 'Backtracking', 'Trie', 'Matrix']",True,True
43.275162095278205,Medium,213,False,False,House Robber II,house-robber-ii,"['Array', 'Dynamic Programming']",True,False
40.42999468614901,Hard,214,False,False,Shortest Palindrome,shortest-palindrome,"['String', 'Rolling Hash', 'String Matching', 'Hash Function']",True,False
67.73325921332224,Medium,215,False,False,Kth Largest Element in an Array,kth-largest-element-in-an-array,"['Array', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Quickselect']",True,True
71.53218707429487,Medium,216,False,False,Combination Sum III,combination-sum-iii,"['Array', 'Backtracking']",True,False
62.94722457476656,Easy,217,False,False,Contains Duplicate,contains-duplicate,"['Array', 'Hash Table', 'Sorting']",True,False
43.74420708679064,Hard,218,False,False,The Skyline Problem,the-skyline-problem,"['Array', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Line Sweep', 'Heap (Priority Queue)', 'Ordered Set']",True,False
48.46467380118596,Easy,219,False,False,Contains Duplicate II,contains-duplicate-ii,"['Array', 'Hash Table', 'Sliding Window']",True,False
23.483085492748994,Hard,220,False,False,Contains Duplicate III,contains-duplicate-iii,"['Array', 'Sliding Window', 'Sorting', 'Bucket Sort', 'Ordered Set']",True,False
48.40551354537252,Medium,221,False,False,Maximal Square,maximal-square,"['Array', 'Dynamic Programming', 'Matrix']",True,False
69.28048692231879,Easy,222,False,False,Count Complete Tree Nodes,count-complete-tree-nodes,"['Binary Search', 'Bit Manipulation', 'Tree', 'Binary Tree']",True,False
47.11721496446171,Medium,223,False,False,Rectangle Area,rectangle-area,"['Math', 'Geometry']",True,False
45.1385610507106,Hard,224,False,False,Basic Calculator,basic-calculator,"['Math', 'String', 'Stack', 'Recursion']",True,False
66.7974011994464,Easy,225,False,False,Implement Stack using Queues,implement-stack-using-queues,"['Stack', 'Design', 'Queue']",True,False
78.7443480498189,Easy,226,False,False,Invert Binary Tree,invert-binary-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,True
45.44387110481266,Medium,227,False,False,Basic Calculator II,basic-calculator-ii,"['Math', 'String', 'Stack']",True,False
52.74872911876093,Easy,228,False,False,Summary Ranges,summary-ranges,['Array'],True,False
53.90763215521856,Medium,229,False,False,Majority Element II,majority-element-ii,"['Array', 'Hash Table', 'Sorting', 'Counting']",True,False
74.92560818931577,Medium,230,False,False,Kth Smallest Element in a BST,kth-smallest-element-in-a-bst,"['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",True,False
48.248587403964855,Easy,231,False,False,Power of Two,power-of-two,"['Math', 'Bit Manipulation', 'Recursion']",True,False
67.89577265860983,Easy,232,False,False,Implement Queue using Stacks,implement-queue-using-stacks,"['Stack', 'Design', 'Queue']",True,False
35.681223265019476,Hard,233,False,False,Number of Digit One,number-of-digit-one,"['Math', 'Dynamic Programming', 'Recursion']",True,False
55.38666761272927,Easy,234,False,False,Palindrome Linked List,palindrome-linked-list,"['Linked List', 'Two Pointers', 'Stack', 'Recursion']",True,True
67.72613210156695,Medium,235,False,False,Lowest Common Ancestor of a Binary Search Tree,lowest-common-ancestor-of-a-binary-search-tree,"['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",True,False
66.04760957285092,Medium,236,False,False,Lowest Common Ancestor of a Binary Tree,lowest-common-ancestor-of-a-binary-tree,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
81.91876620289827,Medium,237,False,False,Delete Node in a Linked List,delete-node-in-a-linked-list,['Linked List'],True,False
67.50065303456216,Medium,238,False,False,Product of Array Except Self,product-of-array-except-self,"['Array', 'Prefix Sum']",True,True
47.35889002165485,Hard,239,False,False,Sliding Window Maximum,sliding-window-maximum,"['Array', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Monotonic Queue']",True,False
54.66706004301156,Medium,240,False,False,Search a 2D Matrix II,search-a-2d-matrix-ii,"['Array', 'Binary Search', 'Divide and Conquer', 'Matrix']",True,True
72.18222288673297,Medium,241,False,False,Different Ways to Add Parentheses,different-ways-to-add-parentheses,"['Math', 'String', 'Dynamic Programming', 'Recursion', 'Memoization']",True,False
66.32064504096365,Easy,242,False,False,Valid Anagram,valid-anagram,"['Hash Table', 'String', 'Sorting']",True,True
65.85981428755383,Easy,243,False,True,Shortest Word Distance,shortest-word-distance,"['Array', 'String']",True,False
61.97912179700873,Medium,244,False,True,Shortest Word Distance II,shortest-word-distance-ii,"['Array', 'Hash Table', 'Two Pointers', 'String', 'Design']",True,True
58.95278923670091,Medium,245,False,True,Shortest Word Distance III,shortest-word-distance-iii,"['Array', 'String']",True,False
47.5990531547051,Easy,246,False,True,Strobogrammatic Number,strobogrammatic-number,"['Hash Table', 'Two Pointers', 'String']",True,True
53.033251072924024,Medium,247,False,True,Strobogrammatic Number II,strobogrammatic-number-ii,"['Array', 'String', 'Recursion']",True,False
42.38593875314876,Hard,248,False,True,Strobogrammatic Number III,strobogrammatic-number-iii,"['Array', 'String', 'Recursion']",False,False
67.12163160700757,Medium,249,False,True,Group Shifted Strings,group-shifted-strings,"['Array', 'Hash Table', 'String']",True,True
57.05799894865954,Medium,250,False,True,Count Univalue Subtrees,count-univalue-subtrees,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
50.043678018077955,Medium,251,False,True,Flatten 2D Vector,flatten-2d-vector,"['Array', 'Two Pointers', 'Design', 'Iterator']",True,False
58.83551958118572,Easy,252,False,True,Meeting Rooms,meeting-rooms,"['Array', 'Sorting']",True,True
52.00140062117144,Medium,253,False,True,Meeting Rooms II,meeting-rooms-ii,"['Array', 'Two Pointers', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Prefix Sum']",True,True
50.1685131669389,Medium,254,False,True,Factor Combinations,factor-combinations,['Backtracking'],True,False
50.73289949892711,Medium,255,False,True,Verify Preorder Sequence in Binary Search Tree,verify-preorder-sequence-in-binary-search-tree,"['Array', 'Stack', 'Tree', 'Binary Search Tree', 'Recursion', 'Monotonic Stack', 'Binary Tree']",True,False
63.550267525569424,Medium,256,False,True,Paint House,paint-house,"['Array', 'Dynamic Programming']",True,False
66.01837245552262,Easy,257,False,False,Binary Tree Paths,binary-tree-paths,"['String', 'Backtracking', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
67.69678326844932,Easy,258,False,False,Add Digits,add-digits,"['Math', 'Simulation', 'Number Theory']",True,False
50.95213603377009,Medium,259,False,True,3Sum Smaller,3sum-smaller,"['Array', 'Two Pointers', 'Binary Search', 'Sorting']",True,False
70.68501939123767,Medium,260,False,False,Single Number III,single-number-iii,"['Array', 'Bit Manipulation']",True,False
49.16038689338437,Medium,261,False,True,Graph Valid Tree,graph-valid-tree,"['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
37.04776966991315,Hard,262,False,False,Trips and Users,trips-and-users,['Database'],True,False
42.23867050767646,Easy,263,False,False,Ugly Number,ugly-number,['Math'],True,False
49.185055242041344,Medium,264,False,False,Ugly Number II,ugly-number-ii,"['Hash Table', 'Math', 'Dynamic Programming', 'Heap (Priority Queue)']",True,False
56.17428294236176,Hard,265,False,True,Paint House II,paint-house-ii,"['Array', 'Dynamic Programming']",True,False
68.43759680740565,Easy,266,False,True,Palindrome Permutation,palindrome-permutation,"['Hash Table', 'String', 'Bit Manipulation']",True,False
42.07398646126993,Medium,267,False,True,Palindrome Permutation II,palindrome-permutation-ii,"['Hash Table', 'String', 'Backtracking']",True,False
69.5899247391063,Easy,268,False,False,Missing Number,missing-number,"['Array', 'Hash Table', 'Math', 'Binary Search', 'Bit Manipulation', 'Sorting']",True,True
36.52223320490321,Hard,269,False,True,Alien Dictionary,alien-dictionary,"['Array', 'String', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']",True,False
50.01564987321158,Easy,270,False,True,Closest Binary Search Tree Value,closest-binary-search-tree-value,"['Binary Search', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",True,False
49.199585328528414,Medium,271,False,True,Encode and Decode Strings,encode-and-decode-strings,"['Array', 'String', 'Design']",True,False
60.075555534724145,Hard,272,False,True,Closest Binary Search Tree Value II,closest-binary-search-tree-value-ii,"['Two Pointers', 'Stack', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Heap (Priority Queue)', 'Binary Tree']",True,False
34.27135723277101,Hard,273,False,False,Integer to English Words,integer-to-english-words,"['Math', 'String', 'Recursion']",True,False
40.0377540174332,Medium,274,False,False,H-Index,h-index,"['Array', 'Sorting', 'Counting Sort']",True,False
38.721477037000305,Medium,275,False,False,H-Index II,h-index-ii,"['Array', 'Binary Search']",True,False
47.5702325654078,Medium,276,False,True,Paint Fence,paint-fence,['Dynamic Programming'],True,False
48.290689444546786,Medium,277,False,True,Find the Celebrity,find-the-celebrity,"['Two Pointers', 'Graph', 'Interactive']",True,True
45.68210452193819,Easy,278,False,False,First Bad Version,first-bad-version,"['Binary Search', 'Interactive']",True,True
55.51255922288981,Medium,279,False,False,Perfect Squares,perfect-squares,"['Math', 'Dynamic Programming', 'Breadth-First Search']",True,False
68.15219695227272,Medium,280,False,True,Wiggle Sort,wiggle-sort,"['Array', 'Greedy', 'Sorting']",True,True
65.38765067525425,Medium,281,False,True,Zigzag Iterator,zigzag-iterator,"['Array', 'Design', 'Queue', 'Iterator']",True,False
41.29862654444492,Hard,282,False,False,Expression Add Operators,expression-add-operators,"['Math', 'String', 'Backtracking']",True,False
62.6359904682904,Easy,283,False,False,Move Zeroes,move-zeroes,"['Array', 'Two Pointers']",True,True
60.48991740303611,Medium,284,False,False,Peeking Iterator,peeking-iterator,"['Array', 'Design', 'Iterator']",True,False
50.54622601615527,Medium,285,False,True,Inorder Successor in BST,inorder-successor-in-bst,"['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",True,False
62.6936554854404,Medium,286,False,True,Walls and Gates,walls-and-gates,"['Array', 'Breadth-First Search', 'Matrix']",True,False
62.5021138926519,Medium,287,False,False,Find the Duplicate Number,find-the-duplicate-number,"['Array', 'Two Pointers', 'Binary Search', 'Bit Manipulation']",True,False
26.935724230572795,Medium,288,False,True,Unique Word Abbreviation,unique-word-abbreviation,"['Array', 'Hash Table', 'String', 'Design']",True,False
71.0935182248775,Medium,289,False,False,Game of Life,game-of-life,"['Array', 'Matrix', 'Simulation']",True,True
42.900180730874524,Easy,290,False,False,Word Pattern,word-pattern,"['Hash Table', 'String']",True,False
48.577986888516335,Medium,291,False,True,Word Pattern II,word-pattern-ii,"['Hash Table', 'String', 'Backtracking']",True,False
57.91995690391413,Easy,292,False,False,Nim Game,nim-game,"['Math', 'Brainteaser', 'Game Theory']",True,False
64.85861639694114,Easy,293,False,True,Flip Game,flip-game,['String'],True,False
52.21387927911289,Medium,294,False,True,Flip Game II,flip-game-ii,"['Math', 'Dynamic Programming', 'Backtracking', 'Memoization', 'Game Theory']",False,False
53.107500079157376,Hard,295,False,False,Find Median from Data Stream,find-median-from-data-stream,"['Two Pointers', 'Design', 'Sorting', 'Heap (Priority Queue)', 'Data Stream']",True,False
61.22718025590235,Hard,296,False,True,Best Meeting Point,best-meeting-point,"['Array', 'Math', 'Sorting', 'Matrix']",True,False
58.532124062619516,Hard,297,False,False,Serialize and Deserialize Binary Tree,serialize-and-deserialize-binary-tree,"['String', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Design', 'Binary Tree']",True,False
54.02912976652272,Medium,298,False,True,Binary Tree Longest Consecutive Sequence,binary-tree-longest-consecutive-sequence,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
51.17797690409807,Medium,299,False,False,Bulls and Cows,bulls-and-cows,"['Hash Table', 'String', 'Counting']",True,False
57.37412610365313,Medium,300,False,False,Longest Increasing Subsequence,longest-increasing-subsequence,"['Array', 'Binary Search', 'Dynamic Programming']",True,False
48.99606721861761,Hard,301,False,False,Remove Invalid Parentheses,remove-invalid-parentheses,"['String', 'Backtracking', 'Breadth-First Search']",True,False
59.485780177876215,Hard,302,False,True,Smallest Rectangle Enclosing Black Pixels,smallest-rectangle-enclosing-black-pixels,"['Array', 'Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Matrix']",True,False
67.69789807654175,Easy,303,False,False,Range Sum Query - Immutable,range-sum-query-immutable,"['Array', 'Design', 'Prefix Sum']",True,True
56.21715045907574,Medium,304,False,False,Range Sum Query 2D - Immutable,range-sum-query-2d-immutable,"['Array', 'Design', 'Matrix', 'Prefix Sum']",True,True
40.0245613772343,Hard,305,False,True,Number of Islands II,number-of-islands-ii,"['Array', 'Hash Table', 'Union Find']",True,False
32.373543806656066,Medium,306,False,False,Additive Number,additive-number,"['String', 'Backtracking']",False,False
41.63221603431853,Medium,307,False,False,Range Sum Query - Mutable,range-sum-query-mutable,"['Array', 'Design', 'Binary Indexed Tree', 'Segment Tree']",True,False
44.75811840171055,Medium,308,False,True,Range Sum Query 2D - Mutable,range-sum-query-2d-mutable,"['Array', 'Design', 'Binary Indexed Tree', 'Segment Tree', 'Matrix']",True,True
59.981675786937096,Medium,309,False,False,Best Time to Buy and Sell Stock with Cooldown,best-time-to-buy-and-sell-stock-with-cooldown,"['Array', 'Dynamic Programming']",True,False
41.92250688121956,Medium,310,False,False,Minimum Height Trees,minimum-height-trees,"['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']",True,False
68.63625715337506,Medium,311,False,True,Sparse Matrix Multiplication,sparse-matrix-multiplication,"['Array', 'Hash Table', 'Matrix']",True,False
60.833299761258765,Hard,312,False,False,Burst Balloons,burst-balloons,"['Array', 'Dynamic Programming']",True,False
45.40176736539252,Medium,313,False,False,Super Ugly Number,super-ugly-number,"['Array', 'Math', 'Dynamic Programming']",False,False
56.80982692340844,Medium,314,False,True,Binary Tree Vertical Order Traversal,binary-tree-vertical-order-traversal,"['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Sorting', 'Binary Tree']",True,False
42.73045536201494,Hard,315,False,False,Count of Smaller Numbers After Self,count-of-smaller-numbers-after-self,"['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']",True,False
50.977576253398006,Medium,316,False,False,Remove Duplicate Letters,remove-duplicate-letters,"['String', 'Stack', 'Greedy', 'Monotonic Stack']",True,False
44.144788706268926,Hard,317,False,True,Shortest Distance from All Buildings,shortest-distance-from-all-buildings,"['Array', 'Breadth-First Search', 'Matrix']",True,False
60.43503928304861,Medium,318,False,False,Maximum Product of Word Lengths,maximum-product-of-word-lengths,"['Array', 'String', 'Bit Manipulation']",True,False
53.82091645383957,Medium,319,False,False,Bulb Switcher,bulb-switcher,"['Math', 'Brainteaser']",True,False
59.96544339530809,Medium,320,False,True,Generalized Abbreviation,generalized-abbreviation,"['String', 'Backtracking', 'Bit Manipulation']",True,False
31.998009341484686,Hard,321,False,False,Create Maximum Number,create-maximum-number,"['Array', 'Two Pointers', 'Stack', 'Greedy', 'Monotonic Stack']",False,False
46.03576243829789,Medium,322,False,False,Coin Change,coin-change,"['Array', 'Dynamic Programming', 'Breadth-First Search']",True,True
63.96052450829048,Medium,323,False,True,Number of Connected Components in an Undirected Graph,number-of-connected-components-in-an-undirected-graph,"['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,True
35.423376321831256,Medium,324,False,False,Wiggle Sort II,wiggle-sort-ii,"['Array', 'Divide and Conquer', 'Greedy', 'Sorting', 'Quickselect']",False,False
50.27830542916464,Medium,325,False,True,Maximum Size Subarray Sum Equals k,maximum-size-subarray-sum-equals-k,"['Array', 'Hash Table', 'Prefix Sum']",True,False
47.73102538015498,Easy,326,False,False,Power of Three,power-of-three,"['Math', 'Recursion']",True,False
36.75610790029254,Hard,327,False,False,Count of Range Sum,count-of-range-sum,"['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']",False,False
61.87786272317343,Medium,328,False,False,Odd Even Linked List,odd-even-linked-list,['Linked List'],True,False
55.036278141690666,Hard,329,False,False,Longest Increasing Path in a Matrix,longest-increasing-path-in-a-matrix,"['Array', 'Dynamic Programming', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort', 'Memoization', 'Matrix']",True,False
53.39261482463002,Hard,330,False,False,Patching Array,patching-array,"['Array', 'Greedy']",True,False
45.96882363603408,Medium,331,False,False,Verify Preorder Serialization of a Binary Tree,verify-preorder-serialization-of-a-binary-tree,"['String', 'Stack', 'Tree', 'Binary Tree']",True,False
43.45414064562518,Hard,332,False,False,Reconstruct Itinerary,reconstruct-itinerary,"['Depth-First Search', 'Graph', 'Eulerian Circuit']",False,False
45.20626782117352,Medium,333,False,True,Largest BST Subtree,largest-bst-subtree,"['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",True,False
39.1440390434756,Medium,334,False,False,Increasing Triplet Subsequence,increasing-triplet-subsequence,"['Array', 'Greedy']",True,False
31.764972189884876,Hard,335,False,False,Self Crossing,self-crossing,"['Array', 'Math', 'Geometry']",False,False
36.08990649373454,Hard,336,False,False,Palindrome Pairs,palindrome-pairs,"['Array', 'Hash Table', 'String', 'Trie']",True,False
54.77449626114394,Medium,337,False,False,House Robber III,house-robber-iii,"['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
79.49642858419,Easy,338,False,False,Counting Bits,counting-bits,"['Dynamic Programming', 'Bit Manipulation']",True,False
85.3247377366231,Medium,339,False,True,Nested List Weight Sum,nested-list-weight-sum,"['Depth-First Search', 'Breadth-First Search']",True,True
49.38406875880823,Medium,340,False,True,Longest Substring with At Most K Distinct Characters,longest-substring-with-at-most-k-distinct-characters,"['Hash Table', 'String', 'Sliding Window']",True,True
65.23699688156745,Medium,341,False,False,Flatten Nested List Iterator,flatten-nested-list-iterator,"['Stack', 'Tree', 'Depth-First Search', 'Design', 'Queue', 'Iterator']",True,False
49.19951493754727,Easy,342,False,False,Power of Four,power-of-four,"['Math', 'Bit Manipulation', 'Recursion']",True,False
60.989199757634815,Medium,343,False,False,Integer Break,integer-break,"['Math', 'Dynamic Programming']",True,False
79.57238409120183,Easy,344,False,False,Reverse String,reverse-string,"['Two Pointers', 'String']",True,True
57.427146392895224,Easy,345,False,False,Reverse Vowels of a String,reverse-vowels-of-a-string,"['Two Pointers', 'String']",True,True
79.74698908924164,Easy,346,False,True,Moving Average from Data Stream,moving-average-from-data-stream,"['Array', 'Design', 'Queue', 'Data Stream']",True,True
64.24105582807094,Medium,347,False,False,Top K Frequent Elements,top-k-frequent-elements,"['Array', 'Hash Table', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Bucket Sort', 'Counting', 'Quickselect']",True,True
58.49560781261116,Medium,348,False,True,Design Tic-Tac-Toe,design-tic-tac-toe,"['Array', 'Hash Table', 'Design', 'Matrix', 'Simulation']",True,False
76.15756459509657,Easy,349,False,False,Intersection of Two Arrays,intersection-of-two-arrays,"['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Sorting']",True,False
58.93756112149418,Easy,350,False,False,Intersection of Two Arrays II,intersection-of-two-arrays-ii,"['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Sorting']",True,False
53.23735735175574,Medium,351,False,True,Android Unlock Patterns,android-unlock-patterns,"['Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']",True,False
60.34710073924352,Hard,352,False,False,Data Stream as Disjoint Intervals,data-stream-as-disjoint-intervals,"['Binary Search', 'Design', 'Ordered Set']",True,False
39.06955281483346,Medium,353,False,True,Design Snake Game,design-snake-game,"['Array', 'Hash Table', 'Design', 'Queue', 'Simulation']",True,False
37.20578368374363,Hard,354,False,False,Russian Doll Envelopes,russian-doll-envelopes,"['Array', 'Binary Search', 'Dynamic Programming', 'Sorting']",True,False
41.754525355810415,Medium,355,False,False,Design Twitter,design-twitter,"['Hash Table', 'Linked List', 'Design', 'Heap (Priority Queue)']",False,False
35.89878929832086,Medium,356,False,True,Line Reflection,line-reflection,"['Array', 'Hash Table', 'Math']",False,False
54.071848978816895,Medium,357,False,False,Count Numbers with Unique Digits,count-numbers-with-unique-digits,"['Math', 'Dynamic Programming', 'Backtracking']",False,False
39.308741387620856,Hard,358,False,True,Rearrange String k Distance Apart,rearrange-string-k-distance-apart,"['Hash Table', 'String', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Counting']",True,False
76.40069152962225,Easy,359,False,True,Logger Rate Limiter,logger-rate-limiter,"['Hash Table', 'Design', 'Data Stream']",True,True
56.87767921053266,Medium,360,False,True,Sort Transformed Array,sort-transformed-array,"['Array', 'Math', 'Two Pointers', 'Sorting']",True,False
52.04007671535141,Medium,361,False,True,Bomb Enemy,bomb-enemy,"['Array', 'Dynamic Programming', 'Matrix']",True,False
69.06353970009,Medium,362,False,True,Design Hit Counter,design-hit-counter,"['Array', 'Binary Search', 'Design', 'Queue', 'Data Stream']",True,False
44.54356239555348,Hard,363,False,False,Max Sum of Rectangle No Larger Than K,max-sum-of-rectangle-no-larger-than-k,"['Array', 'Binary Search', 'Matrix', 'Prefix Sum', 'Ordered Set']",True,False
65.22345401004677,Medium,364,False,True,Nested List Weight Sum II,nested-list-weight-sum-ii,"['Stack', 'Depth-First Search', 'Breadth-First Search']",True,False
42.689623047660724,Medium,365,False,False,Water and Jug Problem,water-and-jug-problem,"['Math', 'Depth-First Search', 'Breadth-First Search']",False,False
80.99992899492314,Medium,366,False,True,Find Leaves of Binary Tree,find-leaves-of-binary-tree,"['Tree', 'Depth-First Search', 'Binary Tree']",True,True
44.08741754341279,Easy,367,False,False,Valid Perfect Square,valid-perfect-square,"['Math', 'Binary Search']",True,False
48.69399156310569,Medium,368,False,False,Largest Divisible Subset,largest-divisible-subset,"['Array', 'Math', 'Dynamic Programming', 'Sorting']",True,False
61.13677634924094,Medium,369,False,True,Plus One Linked List,plus-one-linked-list,"['Linked List', 'Math']",True,True
72.18731320435626,Medium,370,False,True,Range Addition,range-addition,"['Array', 'Prefix Sum']",True,False
53.348406076036845,Medium,371,False,False,Sum of Two Integers,sum-of-two-integers,"['Math', 'Bit Manipulation']",True,False
35.32843769835098,Medium,372,False,False,Super Pow,super-pow,"['Math', 'Divide and Conquer']",False,False
40.511750031073,Medium,373,False,False,Find K Pairs with Smallest Sums,find-k-pairs-with-smallest-sums,"['Array', 'Heap (Priority Queue)']",True,False
55.40466902977626,Easy,374,False,False,Guess Number Higher or Lower,guess-number-higher-or-lower,"['Binary Search', 'Interactive']",True,True
50.82335275305193,Medium,375,False,False,Guess Number Higher or Lower II,guess-number-higher-or-lower-ii,"['Math', 'Dynamic Programming', 'Game Theory']",True,False
48.782081912200056,Medium,376,False,False,Wiggle Subsequence,wiggle-subsequence,"['Array', 'Dynamic Programming', 'Greedy']",True,False
54.5740604281583,Medium,377,False,False,Combination Sum IV,combination-sum-iv,"['Array', 'Dynamic Programming']",True,False
63.345915377802,Medium,378,False,False,Kth Smallest Element in a Sorted Matrix,kth-smallest-element-in-a-sorted-matrix,"['Array', 'Binary Search', 'Sorting', 'Heap (Priority Queue)', 'Matrix']",True,False
52.254821654628046,Medium,379,False,True,Design Phone Directory,design-phone-directory,"['Array', 'Hash Table', 'Linked List', 'Design', 'Queue']",True,False
54.966186162631644,Medium,380,False,False,Insert Delete GetRandom O(1),insert-delete-getrandom-o1,"['Array', 'Hash Table', 'Math', 'Design', 'Randomized']",True,False
35.843902697757066,Hard,381,False,False,Insert Delete GetRandom O(1) - Duplicates allowed,insert-delete-getrandom-o1-duplicates-allowed,"['Array', 'Hash Table', 'Math', 'Design', 'Randomized']",True,False
63.833205144431574,Medium,382,False,False,Linked List Random Node,linked-list-random-node,"['Linked List', 'Math', 'Reservoir Sampling', 'Randomized']",True,False
64.13011488616434,Easy,383,False,False,Ransom Note,ransom-note,"['Hash Table', 'String', 'Counting']",True,True
58.89613873609125,Medium,384,False,False,Shuffle an Array,shuffle-an-array,"['Array', 'Math', 'Design', 'Randomized']",True,False
39.794066865484226,Medium,385,False,False,Mini Parser,mini-parser,"['String', 'Stack', 'Depth-First Search']",False,False
73.03693495038588,Medium,386,False,False,Lexicographical Numbers,lexicographical-numbers,"['Depth-First Search', 'Trie']",True,False
63.38082757812998,Easy,387,False,False,First Unique Character in a String,first-unique-character-in-a-string,"['Hash Table', 'String', 'Queue', 'Counting']",True,True
48.20986536255509,Medium,388,False,False,Longest Absolute File Path,longest-absolute-file-path,"['String', 'Stack', 'Depth-First Search']",False,False
59.63395014793521,Easy,389,False,False,Find the Difference,find-the-difference,"['Hash Table', 'String', 'Bit Manipulation', 'Sorting']",True,False
44.66201480514502,Medium,390,False,False,Elimination Game,elimination-game,"['Math', 'Recursion']",False,False
34.90926155505593,Hard,391,False,False,Perfect Rectangle,perfect-rectangle,"['Array', 'Line Sweep']",False,False
48.27304767923818,Easy,392,False,False,Is Subsequence,is-subsequence,"['Two Pointers', 'String', 'Dynamic Programming']",True,False
45.451955118961166,Medium,393,False,False,UTF-8 Validation,utf-8-validation,"['Array', 'Bit Manipulation']",True,False
60.832596682354456,Medium,394,False,False,Decode String,decode-string,"['String', 'Stack', 'Recursion']",True,False
45.3459167230001,Medium,395,False,False,Longest Substring with At Least K Repeating Characters,longest-substring-with-at-least-k-repeating-characters,"['Hash Table', 'String', 'Divide and Conquer', 'Sliding Window']",True,False
43.72939386254121,Medium,396,False,False,Rotate Function,rotate-function,"['Array', 'Math', 'Dynamic Programming']",False,False
36.373181975672395,Medium,397,False,False,Integer Replacement,integer-replacement,"['Dynamic Programming', 'Greedy', 'Bit Manipulation', 'Memoization']",False,False
64.37451857140172,Medium,398,False,False,Random Pick Index,random-pick-index,"['Hash Table', 'Math', 'Reservoir Sampling', 'Randomized']",True,False
62.88035525599997,Medium,399,False,False,Evaluate Division,evaluate-division,"['Array', 'String', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph', 'Shortest Path']",True,False
35.44544113831126,Medium,400,False,False,Nth Digit,nth-digit,"['Math', 'Binary Search']",False,False
56.15610537250693,Easy,401,False,False,Binary Watch,binary-watch,"['Backtracking', 'Bit Manipulation']",False,False
34.58090284072015,Medium,402,False,False,Remove K Digits,remove-k-digits,"['String', 'Stack', 'Greedy', 'Monotonic Stack']",True,False
46.43818977050692,Hard,403,False,False,Frog Jump,frog-jump,"['Array', 'Dynamic Programming']",True,False
61.438085478798435,Easy,404,False,False,Sum of Left Leaves,sum-of-left-leaves,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
50.48548513439257,Easy,405,False,False,Convert a Number to Hexadecimal,convert-a-number-to-hexadecimal,"['Math', 'Bit Manipulation']",False,False
74.04884949553829,Medium,406,False,False,Queue Reconstruction by Height,queue-reconstruction-by-height,"['Array', 'Binary Indexed Tree', 'Segment Tree', 'Sorting']",True,False
58.73706986669145,Hard,407,False,False,Trapping Rain Water II,trapping-rain-water-ii,"['Array', 'Breadth-First Search', 'Heap (Priority Queue)', 'Matrix']",True,False
36.71026446176076,Easy,408,False,True,Valid Word Abbreviation,valid-word-abbreviation,"['Two Pointers', 'String']",False,False
55.4812765912912,Easy,409,False,False,Longest Palindrome,longest-palindrome,"['Hash Table', 'String', 'Greedy']",True,False
57.60607620813847,Hard,410,False,False,Split Array Largest Sum,split-array-largest-sum,"['Array', 'Binary Search', 'Dynamic Programming', 'Greedy', 'Prefix Sum']",True,False
40.1079373436883,Hard,411,False,True,Minimum Unique Word Abbreviation,minimum-unique-word-abbreviation,"['Array', 'String', 'Backtracking', 'Bit Manipulation']",False,False
74.07704614543016,Easy,412,False,False,Fizz Buzz,fizz-buzz,"['Math', 'String', 'Simulation']",True,True
64.84263935469176,Medium,413,False,False,Arithmetic Slices,arithmetic-slices,"['Array', 'Dynamic Programming', 'Sliding Window']",True,False
36.825028464754446,Easy,414,False,False,Third Maximum Number,third-maximum-number,"['Array', 'Sorting']",True,False
51.784927712140636,Easy,415,False,False,Add Strings,add-strings,"['Math', 'String', 'Simulation']",True,False
48.180795091191804,Medium,416,False,False,Partition Equal Subset Sum,partition-equal-subset-sum,"['Array', 'Dynamic Programming']",True,True
57.1052919476019,Medium,417,False,False,Pacific Atlantic Water Flow,pacific-atlantic-water-flow,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix']",True,False
36.316944855784406,Medium,418,False,True,Sentence Screen Fitting,sentence-screen-fitting,"['Array', 'String', 'Dynamic Programming']",False,False
76.33467894134131,Medium,419,False,False,Battleships in a Board,battleships-in-a-board,"['Array', 'Depth-First Search', 'Matrix']",False,False
14.457352343147786,Hard,420,False,False,Strong Password Checker,strong-password-checker,"['String', 'Greedy', 'Heap (Priority Queue)']",False,False
53.19033094837662,Medium,421,False,False,Maximum XOR of Two Numbers in an Array,maximum-xor-of-two-numbers-in-an-array,"['Array', 'Hash Table', 'Bit Manipulation', 'Trie']",True,False
41.90232874206111,Easy,422,False,True,Valid Word Square,valid-word-square,"['Array', 'Matrix']",True,False
51.50729240178782,Medium,423,False,False,Reconstruct Original Digits from English,reconstruct-original-digits-from-english,"['Hash Table', 'Math', 'String']",True,False
56.676129737902414,Medium,424,False,False,Longest Repeating Character Replacement,longest-repeating-character-replacement,"['Hash Table', 'String', 'Sliding Window']",True,False
53.843555935404275,Hard,425,False,True,Word Squares,word-squares,"['Array', 'String', 'Backtracking', 'Trie']",True,False
65.40306379648926,Medium,426,False,True,Convert Binary Search Tree to Sorted Doubly Linked List,convert-binary-search-tree-to-sorted-doubly-linked-list,"['Linked List', 'Stack', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree', 'Doubly-Linked List']",True,False
76.7786004391846,Medium,427,False,False,Construct Quad Tree,construct-quad-tree,"['Array', 'Divide and Conquer', 'Tree', 'Matrix']",True,False
68.13071989623117,Hard,428,False,True,Serialize and Deserialize N-ary Tree,serialize-and-deserialize-n-ary-tree,"['String', 'Tree', 'Depth-First Search', 'Breadth-First Search']",True,False
71.18816930137685,Medium,429,False,False,N-ary Tree Level Order Traversal,n-ary-tree-level-order-traversal,"['Tree', 'Breadth-First Search']",True,False
61.063639545666426,Medium,430,False,False,Flatten a Multilevel Doubly Linked List,flatten-a-multilevel-doubly-linked-list,"['Linked List', 'Depth-First Search', 'Doubly-Linked List']",True,False
80.05614131178967,Hard,431,False,True,Encode N-ary Tree to Binary Tree,encode-n-ary-tree-to-binary-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Design', 'Binary Tree']",True,False
44.759211891480994,Hard,432,False,False,All O`one Data Structure,all-oone-data-structure,"['Hash Table', 'Linked List', 'Design', 'Doubly-Linked List']",True,False
55.182120446988826,Medium,433,False,False,Minimum Genetic Mutation,minimum-genetic-mutation,"['Hash Table', 'String', 'Breadth-First Search']",True,False
36.30344038130701,Easy,434,False,False,Number of Segments in a String,number-of-segments-in-a-string,['String'],True,False
55.1263280893878,Medium,435,False,False,Non-overlapping Intervals,non-overlapping-intervals,"['Array', 'Dynamic Programming', 'Greedy', 'Sorting']",True,False
53.50845844660116,Medium,436,False,False,Find Right Interval,find-right-interval,"['Array', 'Binary Search', 'Sorting']",False,False
46.042966721986,Medium,437,False,False,Path Sum III,path-sum-iii,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
51.94765991457042,Medium,438,False,False,Find All Anagrams in a String,find-all-anagrams-in-a-string,"['Hash Table', 'String', 'Sliding Window']",True,False
61.86973889488934,Medium,439,False,True,Ternary Expression Parser,ternary-expression-parser,"['String', 'Stack', 'Recursion']",True,False
41.96620544320625,Hard,440,False,False,K-th Smallest in Lexicographical Order,k-th-smallest-in-lexicographical-order,['Trie'],True,False
47.20566711338222,Easy,441,False,False,Arranging Coins,arranging-coins,"['Math', 'Binary Search']",True,False
76.29603682089213,Medium,442,False,False,Find All Duplicates in an Array,find-all-duplicates-in-an-array,"['Array', 'Hash Table']",True,False
57.573897816579255,Medium,443,False,False,String Compression,string-compression,"['Two Pointers', 'String']",True,False
29.254837948395217,Medium,444,False,True,Sequence Reconstruction,sequence-reconstruction,"['Array', 'Graph', 'Topological Sort']",False,False
61.602712125059625,Medium,445,False,False,Add Two Numbers II,add-two-numbers-ii,"['Linked List', 'Math', 'Stack']",True,False
54.52685031668181,Hard,446,False,False,Arithmetic Slices II - Subsequence,arithmetic-slices-ii-subsequence,"['Array', 'Dynamic Programming']",True,False
56.237187879799485,Medium,447,False,False,Number of Boomerangs,number-of-boomerangs,"['Array', 'Hash Table', 'Math']",False,False
62.13719720329636,Easy,448,False,False,Find All Numbers Disappeared in an Array,find-all-numbers-disappeared-in-an-array,"['Array', 'Hash Table']",True,False
58.417546657271856,Medium,449,False,False,Serialize and Deserialize BST,serialize-and-deserialize-bst,"['String', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Design', 'Binary Search Tree', 'Binary Tree']",True,False
52.69833768504626,Medium,450,False,False,Delete Node in a BST,delete-node-in-a-bst,"['Tree', 'Binary Search Tree', 'Binary Tree']",True,False
73.7827231674193,Medium,451,False,False,Sort Characters By Frequency,sort-characters-by-frequency,"['Hash Table', 'String', 'Sorting', 'Heap (Priority Queue)', 'Bucket Sort', 'Counting']",True,False
60.14997476252136,Medium,452,False,False,Minimum Number of Arrows to Burst Balloons,minimum-number-of-arrows-to-burst-balloons,"['Array', 'Greedy', 'Sorting']",True,False
57.59439695005809,Medium,453,False,False,Minimum Moves to Equal Array Elements,minimum-moves-to-equal-array-elements,"['Array', 'Math']",True,False
57.51089443383116,Medium,454,False,False,4Sum II,4sum-ii,"['Array', 'Hash Table']",True,False
53.57974178857312,Easy,455,False,False,Assign Cookies,assign-cookies,"['Array', 'Two Pointers', 'Greedy', 'Sorting']",True,False
33.94388241029804,Medium,456,False,False,132 Pattern,132-pattern,"['Array', 'Binary Search', 'Stack', 'Monotonic Stack', 'Ordered Set']",True,True
35.31794248683678,Medium,457,False,False,Circular Array Loop,circular-array-loop,"['Array', 'Hash Table', 'Two Pointers']",False,False
59.2706816299723,Hard,458,False,False,Poor Pigs,poor-pigs,"['Math', 'Dynamic Programming', 'Combinatorics']",True,False
46.691755027620715,Easy,459,False,False,Repeated Substring Pattern,repeated-substring-pattern,"['String', 'String Matching']",True,False
46.064146296276114,Hard,460,False,False,LFU Cache,lfu-cache,"['Hash Table', 'Linked List', 'Design', 'Doubly-Linked List']",True,False
75.92720399951224,Easy,461,False,False,Hamming Distance,hamming-distance,['Bit Manipulation'],True,False
60.82884964912915,Medium,462,False,False,Minimum Moves to Equal Array Elements II,minimum-moves-to-equal-array-elements-ii,"['Array', 'Math', 'Sorting']",True,False
73.37220382516922,Easy,463,False,False,Island Perimeter,island-perimeter,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix']",True,False
30.216130673465315,Medium,464,False,False,Can I Win,can-i-win,"['Math', 'Dynamic Programming', 'Bit Manipulation', 'Memoization', 'Game Theory', 'Bitmask']",False,False
49.761791329204385,Hard,465,False,True,Optimal Account Balancing,optimal-account-balancing,"['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']",True,False
31.48279481433151,Hard,466,False,False,Count The Repetitions,count-the-repetitions,"['String', 'Dynamic Programming']",True,False
40.920836463604914,Medium,467,False,False,Unique Substrings in Wraparound String,unique-substrings-in-wraparound-string,"['String', 'Dynamic Programming']",False,False
27.72043448043533,Medium,468,False,False,Validate IP Address,validate-ip-address,['String'],True,False
39.80226892848252,Medium,469,False,True,Convex Polygon,convex-polygon,"['Array', 'Math', 'Geometry']",False,False
45.830859029879925,Medium,470,False,False,Implement Rand10() Using Rand7(),implement-rand10-using-rand7,"['Math', 'Rejection Sampling', 'Randomized', 'Probability and Statistics']",True,False
50.46895291231783,Hard,471,False,True,Encode String with Shortest Length,encode-string-with-shortest-length,"['String', 'Dynamic Programming']",False,False
49.37657423092629,Hard,472,False,False,Concatenated Words,concatenated-words,"['Array', 'String', 'Dynamic Programming', 'Depth-First Search', 'Trie']",True,False
40.76708409755071,Medium,473,False,False,Matchsticks to Square,matchsticks-to-square,"['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']",True,False
48.572464236088685,Medium,474,False,False,Ones and Zeroes,ones-and-zeroes,"['Array', 'String', 'Dynamic Programming']",True,False
39.5729121125577,Medium,475,False,False,Heaters,heaters,"['Array', 'Two Pointers', 'Binary Search', 'Sorting']",False,False
70.29482495033501,Easy,476,False,False,Number Complement,number-complement,['Bit Manipulation'],True,False
53.56887191366945,Medium,477,False,False,Total Hamming Distance,total-hamming-distance,"['Array', 'Math', 'Bit Manipulation']",True,False
40.705569154353306,Medium,478,False,False,Generate Random Point in a Circle,generate-random-point-in-a-circle,"['Math', 'Geometry', 'Rejection Sampling', 'Randomized']",True,False
34.74241926102021,Hard,479,False,False,Largest Palindrome Product,largest-palindrome-product,"['Math', 'Enumeration']",False,False
38.56573409475909,Hard,480,False,False,Sliding Window Median,sliding-window-median,"['Array', 'Hash Table', 'Sliding Window', 'Heap (Priority Queue)']",True,False
52.18123072765022,Medium,481,False,False,Magical String,magical-string,"['Two Pointers', 'String']",False,False
44.53602852189841,Easy,482,False,False,License Key Formatting,license-key-formatting,['String'],True,False
42.91589280976386,Hard,483,False,False,Smallest Good Base,smallest-good-base,"['Math', 'Binary Search']",False,False
66.91754880062155,Medium,484,False,True,Find Permutation,find-permutation,"['Array', 'String', 'Stack', 'Greedy']",True,False
61.99948642656782,Easy,485,False,False,Max Consecutive Ones,max-consecutive-ones,['Array'],True,False
55.59290527124694,Medium,486,False,False,Predict the Winner,predict-the-winner,"['Array', 'Math', 'Dynamic Programming', 'Recursion', 'Game Theory']",True,True
51.404036433336074,Medium,487,False,True,Max Consecutive Ones II,max-consecutive-ones-ii,"['Array', 'Dynamic Programming', 'Sliding Window']",True,False
31.76209943939876,Hard,488,False,False,Zuma Game,zuma-game,"['String', 'Dynamic Programming', 'Stack', 'Breadth-First Search', 'Memoization']",False,False
77.30452238750141,Hard,489,False,True,Robot Room Cleaner,robot-room-cleaner,"['Backtracking', 'Interactive']",True,False
59.2120133620555,Medium,490,False,True,The Maze,the-maze,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix']",True,False
61.47382520223281,Medium,491,False,False,Non-decreasing Subsequences,non-decreasing-subsequences,"['Array', 'Hash Table', 'Backtracking', 'Bit Manipulation']",True,False
60.17399730914157,Easy,492,False,False,Construct the Rectangle,construct-the-rectangle,['Math'],False,False
31.820555200542728,Hard,493,False,False,Reverse Pairs,reverse-pairs,"['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']",True,False
50.44206525436068,Medium,494,False,False,Target Sum,target-sum,"['Array', 'Dynamic Programming', 'Backtracking']",True,False
56.870435829096024,Easy,495,False,False,Teemo Attacking,teemo-attacking,"['Array', 'Simulation']",True,False
74.10825592000054,Easy,496,False,False,Next Greater Element I,next-greater-element-i,"['Array', 'Hash Table', 'Stack', 'Monotonic Stack']",True,False
40.46071437995303,Medium,497,False,False,Random Point in Non-overlapping Rectangles,random-point-in-non-overlapping-rectangles,"['Array', 'Math', 'Binary Search', 'Reservoir Sampling', 'Prefix Sum', 'Ordered Set', 'Randomized']",True,False
62.70755743712121,Medium,498,False,False,Diagonal Traverse,diagonal-traverse,"['Array', 'Matrix', 'Simulation']",True,False
50.37443337643699,Hard,499,False,True,The Maze III,the-maze-iii,"['Array', 'String', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']",True,False
72.21104492744439,Easy,500,False,False,Keyboard Row,keyboard-row,"['Array', 'Hash Table', 'String']",False,False
57.27932162680492,Easy,501,False,False,Find Mode in Binary Search Tree,find-mode-in-binary-search-tree,"['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",True,False
53.001727988196755,Hard,502,False,False,IPO,ipo,"['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",True,False
65.77135702078594,Medium,503,False,False,Next Greater Element II,next-greater-element-ii,"['Array', 'Stack', 'Monotonic Stack']",True,False
51.640720562220885,Easy,504,False,False,Base 7,base-7,['Math'],False,False
54.03709740151501,Medium,505,False,True,The Maze II,the-maze-ii,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']",True,False
73.03056429342746,Easy,506,False,False,Relative Ranks,relative-ranks,"['Array', 'Sorting', 'Heap (Priority Queue)']",True,False
44.26236203428594,Easy,507,False,False,Perfect Number,perfect-number,['Math'],True,False
67.6024187713193,Medium,508,False,False,Most Frequent Subtree Sum,most-frequent-subtree-sum,"['Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
72.67757375418867,Easy,509,False,False,Fibonacci Number,fibonacci-number,"['Math', 'Dynamic Programming', 'Recursion', 'Memoization']",True,False
60.9408886652671,Medium,510,False,True,Inorder Successor in BST II,inorder-successor-in-bst-ii,"['Tree', 'Binary Search Tree', 'Binary Tree']",True,False
75.54848657257493,Easy,511,False,False,Game Play Analysis I,game-play-analysis-i,['Database'],True,False
53.79129317807377,Easy,512,False,True,Game Play Analysis II,game-play-analysis-ii,['Database'],True,False
71.6437940489049,Medium,513,False,False,Find Bottom Left Tree Value,find-bottom-left-tree-value,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
58.8318128941407,Hard,514,False,False,Freedom Trail,freedom-trail,"['String', 'Dynamic Programming', 'Depth-First Search', 'Breadth-First Search']",True,False
66.27736123122392,Medium,515,False,False,Find Largest Value in Each Tree Row,find-largest-value-in-each-tree-row,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
63.78187561949083,Medium,516,False,False,Longest Palindromic Subsequence,longest-palindromic-subsequence,"['String', 'Dynamic Programming']",True,False
42.20643071476101,Hard,517,False,False,Super Washing Machines,super-washing-machines,"['Array', 'Greedy']",True,False
62.90845696237639,Medium,518,False,False,Coin Change II,coin-change-ii,"['Array', 'Dynamic Programming']",True,False
43.26161790017212,Medium,519,False,False,Random Flip Matrix,random-flip-matrix,"['Hash Table', 'Math', 'Reservoir Sampling', 'Randomized']",True,False
56.131575456559226,Easy,520,False,False,Detect Capital,detect-capital,['String'],True,False
61.20318548520183,Easy,521,False,False,Longest Uncommon Subsequence I,longest-uncommon-subsequence-i,['String'],True,False
42.758941755835686,Medium,522,False,False,Longest Uncommon Subsequence II,longest-uncommon-subsequence-ii,"['Array', 'Hash Table', 'Two Pointers', 'String', 'Sorting']",False,False
30.778890984506212,Medium,523,False,False,Continuous Subarray Sum,continuous-subarray-sum,"['Array', 'Hash Table', 'Math', 'Prefix Sum']",True,False
51.64496145203541,Medium,524,False,False,Longest Word in Dictionary through Deleting,longest-word-in-dictionary-through-deleting,"['Array', 'Two Pointers', 'String', 'Sorting']",True,False
49.02217246929617,Medium,525,False,False,Contiguous Array,contiguous-array,"['Array', 'Hash Table', 'Prefix Sum']",True,False
64.46666711052818,Medium,526,False,False,Beautiful Arrangement,beautiful-arrangement,"['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']",True,False
61.728806498646115,Hard,527,False,True,Word Abbreviation,word-abbreviation,"['Array', 'String', 'Greedy', 'Trie', 'Sorting']",True,False
48.32145299263438,Medium,528,False,False,Random Pick with Weight,random-pick-with-weight,"['Array', 'Math', 'Binary Search', 'Prefix Sum', 'Randomized']",True,False
67.868367190966,Medium,529,False,False,Minesweeper,minesweeper,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix']",False,False
58.71897405182589,Easy,530,False,False,Minimum Absolute Difference in BST,minimum-absolute-difference-in-bst,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Search Tree', 'Binary Tree']",True,False
62.48634476731484,Medium,531,False,True,Lonely Pixel I,lonely-pixel-i,"['Array', 'Hash Table', 'Matrix']",True,True
44.3926619792077,Medium,532,False,False,K-diff Pairs in an Array,k-diff-pairs-in-an-array,"['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Sorting']",True,False
48.62746476398018,Medium,533,False,True,Lonely Pixel II,lonely-pixel-ii,"['Array', 'Hash Table', 'Matrix']",False,False
81.17395763740555,Medium,534,False,True,Game Play Analysis III,game-play-analysis-iii,['Database'],True,False
86.62732017133573,Medium,535,False,False,Encode and Decode TinyURL,encode-and-decode-tinyurl,"['Hash Table', 'String', 'Design', 'Hash Function']",True,False
58.14887616443038,Medium,536,False,True,Construct Binary Tree from String,construct-binary-tree-from-string,"['String', 'Stack', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
72.27089043999209,Medium,537,False,False,Complex Number Multiplication,complex-number-multiplication,"['Math', 'String', 'Simulation']",True,False
70.2844867349966,Medium,538,False,False,Convert BST to Greater Tree,convert-bst-to-greater-tree,"['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",True,False
62.29017841432945,Medium,539,False,False,Minimum Time Difference,minimum-time-difference,"['Array', 'Math', 'String', 'Sorting']",True,False
59.16954363626918,Medium,540,False,False,Single Element in a Sorted Array,single-element-in-a-sorted-array,"['Array', 'Binary Search']",True,False
51.881035565162804,Easy,541,False,False,Reverse String II,reverse-string-ii,"['Two Pointers', 'String']",True,False
50.93505427333438,Medium,542,False,False,01 Matrix,01-matrix,"['Array', 'Dynamic Programming', 'Breadth-First Search', 'Matrix']",True,False
63.0340818044819,Easy,543,False,False,Diameter of Binary Tree,diameter-of-binary-tree,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
77.36341910743066,Medium,544,False,True,Output Contest Matches,output-contest-matches,"['String', 'Recursion', 'Simulation']",True,False
46.9214373267799,Medium,545,False,True,Boundary of Binary Tree,boundary-of-binary-tree,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
48.19240394115963,Hard,546,False,False,Remove Boxes,remove-boxes,"['Array', 'Dynamic Programming', 'Memoization']",True,False
68.18497434980941,Medium,547,False,False,Number of Provinces,number-of-provinces,"['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
50.14018787221415,Hard,548,False,True,Split Array with Equal Sum,split-array-with-equal-sum,"['Array', 'Hash Table', 'Prefix Sum']",True,False
49.560746599399145,Medium,549,False,True,Binary Tree Longest Consecutive Sequence II,binary-tree-longest-consecutive-sequence-ii,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
39.1092398862759,Medium,550,False,False,Game Play Analysis IV,game-play-analysis-iv,['Database'],True,False
49.50213680277429,Easy,551,False,False,Student Attendance Record I,student-attendance-record-i,['String'],True,False
55.66980268087587,Hard,552,False,False,Student Attendance Record II,student-attendance-record-ii,['Dynamic Programming'],True,False
61.53740957017628,Medium,553,False,False,Optimal Division,optimal-division,"['Array', 'Math', 'Dynamic Programming']",True,False
55.79271886799867,Medium,554,False,False,Brick Wall,brick-wall,"['Array', 'Hash Table']",True,True
43.28539353116087,Medium,555,False,True,Split Concatenated Strings,split-concatenated-strings,"['Array', 'String', 'Greedy']",False,False
34.456542922583246,Medium,556,False,False,Next Greater Element III,next-greater-element-iii,"['Math', 'Two Pointers', 'String']",True,False
83.56493304890384,Easy,557,False,False,Reverse Words in a String III,reverse-words-in-a-string-iii,"['Two Pointers', 'String']",True,False
50.11477588498248,Medium,558,False,False,Logical OR of Two Binary Grids Represented as Quad-Trees,logical-or-of-two-binary-grids-represented-as-quad-trees,"['Divide and Conquer', 'Tree']",False,False
72.78079449958292,Easy,559,False,False,Maximum Depth of N-ary Tree,maximum-depth-of-n-ary-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search']",True,False
45.10859191060946,Medium,560,False,False,Subarray Sum Equals K,subarray-sum-equals-k,"['Array', 'Hash Table', 'Prefix Sum']",True,True
80.17155235816394,Easy,561,False,False,Array Partition,array-partition,"['Array', 'Greedy', 'Sorting', 'Counting Sort']",True,False
50.49869169401634,Medium,562,False,True,Longest Line of Consecutive One in Matrix,longest-line-of-consecutive-one-in-matrix,"['Array', 'Dynamic Programming', 'Matrix']",True,False
63.66346463453901,Easy,563,False,False,Binary Tree Tilt,binary-tree-tilt,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
31.5799273342123,Hard,564,False,False,Find the Closest Palindrome,find-the-closest-palindrome,"['Math', 'String']",True,False
55.908621912684595,Medium,565,False,False,Array Nesting,array-nesting,"['Array', 'Depth-First Search']",True,False
63.74774543038164,Easy,566,False,False,Reshape the Matrix,reshape-the-matrix,"['Array', 'Matrix', 'Simulation']",True,False
46.95832289823908,Medium,567,False,False,Permutation in String,permutation-in-string,"['Hash Table', 'Two Pointers', 'String', 'Sliding Window']",True,False
46.25267665952891,Hard,568,False,True,Maximum Vacation Days,maximum-vacation-days,"['Array', 'Dynamic Programming', 'Matrix']",True,False
66.2596805598255,Hard,569,False,True,Median Employee Salary,median-employee-salary,['Database'],True,False
49.034556082349766,Medium,570,False,False,Managers with at Least 5 Direct Reports,managers-with-at-least-5-direct-reports,['Database'],True,False
42.54910726024876,Hard,571,False,True,Find Median Given Frequency of Numbers,find-median-given-frequency-of-numbers,['Database'],False,False
49.626114749743095,Easy,572,False,False,Subtree of Another Tree,subtree-of-another-tree,"['Tree', 'Depth-First Search', 'String Matching', 'Binary Tree', 'Hash Function']",True,False
57.2397637987409,Medium,573,False,True,Squirrel Simulation,squirrel-simulation,"['Array', 'Math']",True,True
61.79507337526206,Medium,574,False,True,Winning Candidate,winning-candidate,['Database'],True,False
69.23647483922296,Easy,575,False,False,Distribute Candies,distribute-candies,"['Array', 'Hash Table']",True,False
48.11350756849633,Medium,576,False,False,Out of Boundary Paths,out-of-boundary-paths,['Dynamic Programming'],True,False
77.06963964445394,Easy,577,False,False,Employee Bonus,employee-bonus,['Database'],True,False
40.23674756403298,Medium,578,False,True,Get Highest Answer Rate Question,get-highest-answer-rate-question,['Database'],True,False
48.511227618953406,Hard,579,False,True,Find Cumulative Salary of an Employee,find-cumulative-salary-of-an-employee,['Database'],True,False
59.66042585937308,Medium,580,False,True,Count Student Number in Departments,count-student-number-in-departments,['Database'],True,False
37.30297982133318,Medium,581,False,False,Shortest Unsorted Continuous Subarray,shortest-unsorted-continuous-subarray,"['Array', 'Two Pointers', 'Stack', 'Greedy', 'Sorting', 'Monotonic Stack']",True,False
70.00442390127073,Medium,582,False,True,Kill Process,kill-process,"['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search']",True,True
63.268684419080564,Medium,583,False,False,Delete Operation for Two Strings,delete-operation-for-two-strings,"['String', 'Dynamic Programming']",True,False
71.66733744798674,Easy,584,False,False,Find Customer Referee,find-customer-referee,['Database'],True,False
49.83496750364755,Medium,585,False,False,Investments in 2016,investments-in-2016,['Database'],True,False
64.49056625777723,Easy,586,False,False,Customer Placing the Largest Number of Orders,customer-placing-the-largest-number-of-orders,['Database'],True,False
52.08965698003772,Hard,587,False,False,Erect the Fence,erect-the-fence,"['Array', 'Math', 'Geometry']",True,False
48.10249743635292,Hard,588,False,True,Design In-Memory File System,design-in-memory-file-system,"['Hash Table', 'String', 'Design', 'Trie', 'Sorting']",True,False
76.08884909497291,Easy,589,False,False,N-ary Tree Preorder Traversal,n-ary-tree-preorder-traversal,"['Stack', 'Tree', 'Depth-First Search']",True,False
80.58780086746123,Easy,590,False,False,N-ary Tree Postorder Traversal,n-ary-tree-postorder-traversal,"['Stack', 'Tree', 'Depth-First Search']",True,False
38.78923270885404,Hard,591,False,False,Tag Validator,tag-validator,"['String', 'Stack']",True,False
66.11253582742495,Medium,592,False,False,Fraction Addition and Subtraction,fraction-addition-and-subtraction,"['Math', 'String', 'Simulation']",True,False
44.19668082399386,Medium,593,False,False,Valid Square,valid-square,"['Math', 'Geometry']",True,False
56.7065908175419,Easy,594,False,False,Longest Harmonious Subsequence,longest-harmonious-subsequence,"['Array', 'Hash Table', 'Sliding Window', 'Sorting', 'Counting']",True,False
68.19410784886924,Easy,595,False,False,Big Countries,big-countries,['Database'],True,False
60.00944488907226,Easy,596,False,False,Classes More Than 5 Students,classes-more-than-5-students,['Database'],True,False
41.47216959393722,Easy,597,False,True,Friend Requests I: Overall Acceptance Rate,friend-requests-i-overall-acceptance-rate,['Database'],True,False
57.08122368623329,Easy,598,False,False,Range Addition II,range-addition-ii,"['Array', 'Math']",True,False
57.573610992574885,Easy,599,False,False,Minimum Index Sum of Two Lists,minimum-index-sum-of-two-lists,"['Array', 'Hash Table', 'String']",True,False
40.068163702828244,Hard,600,False,False,Non-negative Integers without Consecutive Ones,non-negative-integers-without-consecutive-ones,['Dynamic Programming'],True,False
49.58221555941297,Hard,601,False,False,Human Traffic of Stadium,human-traffic-of-stadium,['Database'],True,False
60.35286535259681,Medium,602,False,False,Friend Requests II: Who Has the Most Friends,friend-requests-ii-who-has-the-most-friends,['Database'],True,False
65.44768878214613,Easy,603,False,True,Consecutive Available Seats,consecutive-available-seats,['Database'],True,False
40.100731897336864,Easy,604,False,True,Design Compressed String Iterator,design-compressed-string-iterator,"['Array', 'String', 'Design', 'Iterator']",True,False
28.83821368230578,Easy,605,False,False,Can Place Flowers,can-place-flowers,"['Array', 'Greedy']",True,False
69.9567924081059,Medium,606,False,False,Construct String from Binary Tree,construct-string-from-binary-tree,"['String', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
65.8195923926261,Easy,607,False,False,Sales Person,sales-person,['Database'],True,False
73.63579114530569,Medium,608,False,False,Tree Node,tree-node,['Database'],True,False
67.55477584814217,Medium,609,False,False,Find Duplicate File in System,find-duplicate-file-in-system,"['Array', 'Hash Table', 'String']",True,False
73.41074321994266,Easy,610,False,False,Triangle Judgement,triangle-judgement,['Database'],True,False
52.04146610978967,Medium,611,False,False,Valid Triangle Number,valid-triangle-number,"['Array', 'Two Pointers', 'Binary Search', 'Greedy', 'Sorting']",True,False
61.27353206371758,Medium,612,False,True,Shortest Distance in a Plane,shortest-distance-in-a-plane,['Database'],True,False
79.98984410704311,Easy,613,False,True,Shortest Distance in a Line,shortest-distance-in-a-line,['Database'],True,False
39.764744546537585,Medium,614,False,True,Second Degree Follower,second-degree-follower,['Database'],False,False
56.59083211019532,Hard,615,False,True,Average Salary: Departments VS Company,average-salary-departments-vs-company,['Database'],True,False
50.78852862712908,Medium,616,False,True,Add Bold Tag in String,add-bold-tag-in-string,"['Array', 'Hash Table', 'String', 'Trie', 'String Matching']",True,False
79.23236300978202,Easy,617,False,False,Merge Two Binary Trees,merge-two-binary-trees,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
63.663570197280215,Hard,618,False,True,Students Report By Geography,students-report-by-geography,['Database'],True,False
68.95268077186009,Easy,619,False,False,Biggest Single Number,biggest-single-number,['Database'],True,False
74.82776987255748,Easy,620,False,False,Not Boring Movies,not-boring-movies,['Database'],True,False
61.107064242362554,Medium,621,False,False,Task Scheduler,task-scheduler,"['Array', 'Hash Table', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Counting']",True,False
52.46487152214073,Medium,622,False,False,Design Circular Queue,design-circular-queue,"['Array', 'Linked List', 'Design', 'Queue']",True,False
64.03230439342423,Medium,623,False,False,Add One Row to Tree,add-one-row-to-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
45.60368013045965,Medium,624,False,False,Maximum Distance in Arrays,maximum-distance-in-arrays,"['Array', 'Greedy']",True,False
33.759275706959286,Medium,625,False,True,Minimum Factorization,minimum-factorization,"['Math', 'Greedy']",True,True
72.27735289942508,Medium,626,False,False,Exchange Seats,exchange-seats,['Database'],True,False
83.88249927957307,Easy,627,False,False,Swap Salary,swap-salary,['Database'],True,False
45.25399369726912,Easy,628,False,False,Maximum Product of Three Numbers,maximum-product-of-three-numbers,"['Array', 'Math', 'Sorting']",True,False
49.098469787885975,Hard,629,False,False,K Inverse Pairs Array,k-inverse-pairs-array,['Dynamic Programming'],True,False
40.49810413636937,Hard,630,False,False,Course Schedule III,course-schedule-iii,"['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",True,False
43.66732774148942,Hard,631,False,True,Design Excel Sum Formula,design-excel-sum-formula,"['Array', 'Hash Table', 'String', 'Graph', 'Design', 'Topological Sort', 'Matrix']",True,False
69.71917772300593,Hard,632,False,False,Smallest Range Covering Elements from K Lists,smallest-range-covering-elements-from-k-lists,"['Array', 'Hash Table', 'Greedy', 'Sliding Window', 'Sorting', 'Heap (Priority Queue)']",True,False
36.41138579469463,Medium,633,False,False,Sum of Square Numbers,sum-of-square-numbers,"['Math', 'Two Pointers', 'Binary Search']",True,False
41.70134725259223,Medium,634,False,True,Find the Derangement of An Array,find-the-derangement-of-an-array,"['Math', 'Dynamic Programming', 'Combinatorics']",True,False
59.22479132687326,Medium,635,False,True,Design Log Storage System,design-log-storage-system,"['Hash Table', 'String', 'Design', 'Ordered Set']",True,False
64.32411114430833,Medium,636,False,False,Exclusive Time of Functions,exclusive-time-of-functions,"['Array', 'Stack']",True,False
73.88581744991289,Easy,637,False,False,Average of Levels in Binary Tree,average-of-levels-in-binary-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
51.82379623430647,Medium,638,False,False,Shopping Offers,shopping-offers,"['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Memoization', 'Bitmask']",True,False
31.09436510555355,Hard,639,False,False,Decode Ways II,decode-ways-ii,"['String', 'Dynamic Programming']",True,False
44.4375,Medium,640,False,False,Solve the Equation,solve-the-equation,"['Math', 'String', 'Simulation']",True,False
64.54989792421058,Medium,641,False,False,Design Circular Deque,design-circular-deque,"['Array', 'Linked List', 'Design', 'Queue']",True,False
49.30547070436846,Hard,642,False,True,Design Search Autocomplete System,design-search-autocomplete-system,"['String', 'Depth-First Search', 'Design', 'Trie', 'Sorting', 'Heap (Priority Queue)', 'Data Stream']",True,False
44.919525618617016,Easy,643,False,False,Maximum Average Subarray I,maximum-average-subarray-i,"['Array', 'Sliding Window']",True,False
37.35920006837022,Hard,644,False,True,Maximum Average Subarray II,maximum-average-subarray-ii,"['Array', 'Binary Search', 'Prefix Sum']",True,True
44.848395821272106,Easy,645,False,False,Set Mismatch,set-mismatch,"['Array', 'Hash Table', 'Bit Manipulation', 'Sorting']",True,False
60.671894349542434,Medium,646,False,False,Maximum Length of Pair Chain,maximum-length-of-pair-chain,"['Array', 'Dynamic Programming', 'Greedy', 'Sorting']",True,False
71.4070841609852,Medium,647,False,False,Palindromic Substrings,palindromic-substrings,"['Two Pointers', 'String', 'Dynamic Programming']",True,False
68.28298776382084,Medium,648,False,False,Replace Words,replace-words,"['Array', 'Hash Table', 'String', 'Trie']",True,False
48.63365372916413,Medium,649,False,False,Dota2 Senate,dota2-senate,"['String', 'Greedy', 'Queue']",True,False
59.51514464328156,Medium,650,False,False,2 Keys Keyboard,2-keys-keyboard,"['Math', 'Dynamic Programming']",True,False
55.86052764828104,Medium,651,False,True,4 Keys Keyboard,4-keys-keyboard,"['Math', 'Dynamic Programming']",True,False
59.966429482152925,Medium,652,False,False,Find Duplicate Subtrees,find-duplicate-subtrees,"['Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
62.004375077481434,Easy,653,False,False,Two Sum IV - Input is a BST,two-sum-iv-input-is-a-bst,"['Hash Table', 'Two Pointers', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Search Tree', 'Binary Tree']",True,False
85.83013061795897,Medium,654,False,False,Maximum Binary Tree,maximum-binary-tree,"['Array', 'Divide and Conquer', 'Stack', 'Tree', 'Monotonic Stack', 'Binary Tree']",True,False
65.33289658242414,Medium,655,False,False,Print Binary Tree,print-binary-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
32.366652804832675,Hard,656,False,True,Coin Path,coin-path,"['Array', 'Dynamic Programming']",True,False
76.07851446135942,Easy,657,False,False,Robot Return to Origin,robot-return-to-origin,"['String', 'Simulation']",True,False
48.45424383337746,Medium,658,False,False,Find K Closest Elements,find-k-closest-elements,"['Array', 'Two Pointers', 'Binary Search', 'Sliding Window', 'Sorting', 'Heap (Priority Queue)']",True,False
51.42034219539312,Medium,659,False,False,Split Array into Consecutive Subsequences,split-array-into-consecutive-subsequences,"['Array', 'Hash Table', 'Greedy', 'Heap (Priority Queue)']",True,False
57.35713914984169,Hard,660,False,True,Remove 9,remove-9,['Math'],True,False
68.16848242483134,Easy,661,False,False,Image Smoother,image-smoother,"['Array', 'Matrix']",True,False
43.86477249781565,Medium,662,False,False,Maximum Width of Binary Tree,maximum-width-of-binary-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
41.53211338356656,Medium,663,False,True,Equal Tree Partition,equal-tree-partition,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
60.783685372194476,Hard,664,False,False,Strange Printer,strange-printer,"['String', 'Dynamic Programming']",True,False
25.00771206382002,Medium,665,False,False,Non-decreasing Array,non-decreasing-array,['Array'],True,False
62.620038161969404,Medium,666,False,True,Path Sum IV,path-sum-iv,"['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
60.33140157013148,Medium,667,False,False,Beautiful Arrangement II,beautiful-arrangement-ii,"['Array', 'Math']",True,False
52.60673397281369,Hard,668,False,False,Kth Smallest Number in Multiplication Table,kth-smallest-number-in-multiplication-table,"['Math', 'Binary Search']",True,False
66.33987064643358,Medium,669,False,False,Trim a Binary Search Tree,trim-a-binary-search-tree,"['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",True,True
51.73960675118967,Medium,670,False,False,Maximum Swap,maximum-swap,"['Math', 'Greedy']",True,False
45.18470070503471,Easy,671,False,False,Second Minimum Node In a Binary Tree,second-minimum-node-in-a-binary-tree,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
49.45098558010319,Medium,672,False,False,Bulb Switcher II,bulb-switcher-ii,"['Math', 'Bit Manipulation', 'Depth-First Search', 'Breadth-First Search']",True,False
49.488572610764095,Medium,673,False,False,Number of Longest Increasing Subsequence,number-of-longest-increasing-subsequence,"['Array', 'Dynamic Programming', 'Binary Indexed Tree', 'Segment Tree']",True,False
50.96813047409546,Easy,674,False,False,Longest Continuous Increasing Subsequence,longest-continuous-increasing-subsequence,['Array'],True,False
35.145108023837196,Hard,675,False,False,Cut Off Trees for Golf Event,cut-off-trees-for-golf-event,"['Array', 'Breadth-First Search', 'Heap (Priority Queue)', 'Matrix']",True,False
58.03139792526941,Medium,676,False,False,Implement Magic Dictionary,implement-magic-dictionary,"['Hash Table', 'String', 'Depth-First Search', 'Design', 'Trie']",True,False
56.94442596559386,Medium,677,False,False,Map Sum Pairs,map-sum-pairs,"['Hash Table', 'String', 'Design', 'Trie']",True,False
38.68884684000984,Medium,678,False,False,Valid Parenthesis String,valid-parenthesis-string,"['String', 'Dynamic Programming', 'Stack', 'Greedy']",True,False
49.83728229642946,Hard,679,False,False,24 Game,24-game,"['Array', 'Math', 'Backtracking']",True,False
42.68425713866155,Easy,680,False,False,Valid Palindrome II,valid-palindrome-ii,"['Two Pointers', 'String', 'Greedy']",True,False
46.87925495374313,Medium,681,False,True,Next Closest Time,next-closest-time,"['Hash Table', 'String', 'Backtracking', 'Enumeration']",True,False
78.44021869711693,Easy,682,False,False,Baseball Game,baseball-game,"['Array', 'Stack', 'Simulation']",True,False
37.240114626696695,Hard,683,False,True,K Empty Slots,k-empty-slots,"['Array', 'Binary Indexed Tree', 'Segment Tree', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Ordered Set', 'Monotonic Queue']",True,False
66.15637837555394,Medium,684,False,False,Redundant Connection,redundant-connection,"['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
34.91414842734025,Hard,685,False,False,Redundant Connection II,redundant-connection-ii,"['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
36.418086583937765,Medium,686,False,False,Repeated String Match,repeated-string-match,"['String', 'String Matching']",True,False
42.387475123851466,Medium,687,False,False,Longest Univalue Path,longest-univalue-path,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
56.50177631425613,Medium,688,False,False,Knight Probability in Chessboard,knight-probability-in-chessboard,['Dynamic Programming'],True,False
59.43939577527364,Hard,689,False,False,Maximum Sum of 3 Non-Overlapping Subarrays,maximum-sum-of-3-non-overlapping-subarrays,"['Array', 'Dynamic Programming', 'Sliding Window', 'Prefix Sum']",True,False
68.14258656809471,Medium,690,False,False,Employee Importance,employee-importance,"['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search']",True,False
49.90412326684367,Hard,691,False,False,Stickers to Spell Word,stickers-to-spell-word,"['Array', 'Hash Table', 'String', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Memoization', 'Bitmask']",True,False
59.03600001714082,Medium,692,False,False,Top K Frequent Words,top-k-frequent-words,"['Array', 'Hash Table', 'String', 'Trie', 'Sorting', 'Heap (Priority Queue)', 'Bucket Sort', 'Counting']",True,False
63.35196229720148,Easy,693,False,False,Binary Number with Alternating Bits,binary-number-with-alternating-bits,['Bit Manipulation'],True,False
62.037624742871,Medium,694,False,True,Number of Distinct Islands,number-of-distinct-islands,"['Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Hash Function']",True,True
72.98250886832547,Medium,695,False,False,Max Area of Island,max-area-of-island,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']",True,False
65.79124559664551,Easy,696,False,False,Count Binary Substrings,count-binary-substrings,"['Two Pointers', 'String']",True,False
57.19244009065822,Easy,697,False,False,Degree of an Array,degree-of-an-array,"['Array', 'Hash Table']",True,False
38.080917184676615,Medium,698,False,False,Partition to K Equal Sum Subsets,partition-to-k-equal-sum-subsets,"['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Memoization', 'Bitmask']",True,False
46.01410302378392,Hard,699,False,False,Falling Squares,falling-squares,"['Array', 'Segment Tree', 'Ordered Set']",True,False
81.43042276761105,Easy,700,False,False,Search in a Binary Search Tree,search-in-a-binary-search-tree,"['Tree', 'Binary Search Tree', 'Binary Tree']",True,False
73.47122617523803,Medium,701,False,False,Insert into a Binary Search Tree,insert-into-a-binary-search-tree,"['Tree', 'Binary Search Tree', 'Binary Tree']",True,False
72.68419464560017,Medium,702,False,True,Search in a Sorted Array of Unknown Size,search-in-a-sorted-array-of-unknown-size,"['Array', 'Binary Search', 'Interactive']",True,False
59.77112815093658,Easy,703,False,False,Kth Largest Element in a Stream,kth-largest-element-in-a-stream,"['Tree', 'Design', 'Binary Search Tree', 'Heap (Priority Queue)', 'Binary Tree', 'Data Stream']",True,False
59.289560662581906,Easy,704,False,False,Binary Search,binary-search,"['Array', 'Binary Search']",True,False
67.31574089822914,Easy,705,False,False,Design HashSet,design-hashset,"['Array', 'Hash Table', 'Linked List', 'Design', 'Hash Function']",True,False
65.70470269025522,Easy,706,False,False,Design HashMap,design-hashmap,"['Array', 'Hash Table', 'Linked List', 'Design', 'Hash Function']",True,False
28.96404858688276,Medium,707,False,False,Design Linked List,design-linked-list,"['Linked List', 'Design']",True,False
37.832004596090904,Medium,708,False,True,Insert into a Sorted Circular Linked List,insert-into-a-sorted-circular-linked-list,['Linked List'],True,False
84.0535972124355,Easy,709,False,False,To Lower Case,to-lower-case,['String'],True,False
33.740486569698014,Hard,710,False,False,Random Pick with Blacklist,random-pick-with-blacklist,"['Array', 'Hash Table', 'Math', 'Binary Search', 'Sorting', 'Randomized']",False,False
54.45714524975924,Hard,711,False,True,Number of Distinct Islands II,number-of-distinct-islands-ii,"['Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Hash Function']",True,False
65.5785406885759,Medium,712,False,False,Minimum ASCII Delete Sum for Two Strings,minimum-ascii-delete-sum-for-two-strings,"['String', 'Dynamic Programming']",True,False
52.55095299712272,Medium,713,False,False,Subarray Product Less Than K,subarray-product-less-than-k,"['Array', 'Binary Search', 'Sliding Window', 'Prefix Sum']",True,False
70.07833422297651,Medium,714,False,False,Best Time to Buy and Sell Stock with Transaction Fee,best-time-to-buy-and-sell-stock-with-transaction-fee,"['Array', 'Dynamic Programming', 'Greedy']",True,False
44.11619944361224,Hard,715,False,False,Range Module,range-module,"['Design', 'Segment Tree', 'Ordered Set']",True,False
45.390095879509076,Hard,716,False,True,Max Stack,max-stack,"['Linked List', 'Stack', 'Design', 'Doubly-Linked List', 'Ordered Set']",True,False
45.11294985304147,Easy,717,False,False,1-bit and 2-bit Characters,1-bit-and-2-bit-characters,['Array'],True,False
50.9819525147189,Medium,718,False,False,Maximum Length of Repeated Subarray,maximum-length-of-repeated-subarray,"['Array', 'Binary Search', 'Dynamic Programming', 'Sliding Window', 'Rolling Hash', 'Hash Function']",True,False
45.64773124543938,Hard,719,False,False,Find K-th Smallest Pair Distance,find-k-th-smallest-pair-distance,"['Array', 'Two Pointers', 'Binary Search', 'Sorting']",True,False
53.253763664233624,Medium,720,False,False,Longest Word in Dictionary,longest-word-in-dictionary,"['Array', 'Hash Table', 'String', 'Trie', 'Sorting']",True,False
59.07550131808892,Medium,721,False,False,Accounts Merge,accounts-merge,"['Array', 'Hash Table', 'String', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Sorting']",True,False
39.28994967362599,Medium,722,False,False,Remove Comments,remove-comments,"['Array', 'String']",True,False
77.23536369012419,Medium,723,False,True,Candy Crush,candy-crush,"['Array', 'Two Pointers', 'Matrix', 'Simulation']",True,False
60.13174677981626,Easy,724,False,False,Find Pivot Index,find-pivot-index,"['Array', 'Prefix Sum']",True,False
70.12402627744079,Medium,725,False,False,Split Linked List in Parts,split-linked-list-in-parts,['Linked List'],True,False
65.01266936551649,Hard,726,False,False,Number of Atoms,number-of-atoms,"['Hash Table', 'String', 'Stack', 'Sorting']",True,False
43.58935886768604,Hard,727,False,True,Minimum Window Subsequence,minimum-window-subsequence,"['String', 'Dynamic Programming', 'Sliding Window']",True,False
79.46549936643244,Easy,728,False,False,Self Dividing Numbers,self-dividing-numbers,['Math'],True,False
58.3575715717079,Medium,729,False,False,My Calendar I,my-calendar-i,"['Array', 'Binary Search', 'Design', 'Segment Tree', 'Ordered Set']",True,False
46.209835102114624,Hard,730,False,False,Count Different Palindromic Subsequences,count-different-palindromic-subsequences,"['String', 'Dynamic Programming']",True,False
62.83527152633106,Medium,731,False,False,My Calendar II,my-calendar-ii,"['Array', 'Binary Search', 'Design', 'Segment Tree', 'Prefix Sum', 'Ordered Set']",True,False
72.04105757864083,Hard,732,False,False,My Calendar III,my-calendar-iii,"['Binary Search', 'Design', 'Segment Tree', 'Prefix Sum', 'Ordered Set']",True,False
66.01359837217258,Easy,733,False,False,Flood Fill,flood-fill,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix']",True,False
44.54864378158434,Easy,734,False,True,Sentence Similarity,sentence-similarity,"['Array', 'Hash Table', 'String']",True,False
45.19997519084202,Medium,735,False,False,Asteroid Collision,asteroid-collision,"['Array', 'Stack', 'Simulation']",True,False
52.38860669967209,Hard,736,False,False,Parse Lisp Expression,parse-lisp-expression,"['Hash Table', 'String', 'Stack', 'Recursion']",True,False
50.54071547039549,Medium,737,False,True,Sentence Similarity II,sentence-similarity-ii,"['Array', 'Hash Table', 'String', 'Depth-First Search', 'Breadth-First Search', 'Union Find']",True,False
48.543720394315706,Medium,738,False,False,Monotone Increasing Digits,monotone-increasing-digits,"['Math', 'Greedy']",True,False
67.09699820752796,Medium,739,False,False,Daily Temperatures,daily-temperatures,"['Array', 'Stack', 'Monotonic Stack']",True,False
56.668019421697224,Medium,740,False,False,Delete and Earn,delete-and-earn,"['Array', 'Hash Table', 'Dynamic Programming']",True,False
37.66223158788888,Hard,741,False,False,Cherry Pickup,cherry-pickup,"['Array', 'Dynamic Programming', 'Matrix']",True,False
46.99840428458759,Medium,742,False,True,Closest Leaf in a Binary Tree,closest-leaf-in-a-binary-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
56.696482077460885,Medium,743,False,False,Network Delay Time,network-delay-time,"['Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Shortest Path']",True,False
53.770863564519246,Easy,744,False,False,Find Smallest Letter Greater Than Target,find-smallest-letter-greater-than-target,"['Array', 'Binary Search']",True,False
41.22722415869954,Hard,745,False,False,Prefix and Suffix Search,prefix-and-suffix-search,"['Array', 'Hash Table', 'String', 'Design', 'Trie']",True,False
66.93432156897751,Easy,746,False,False,Min Cost Climbing Stairs,min-cost-climbing-stairs,"['Array', 'Dynamic Programming']",True,False
50.48574405011607,Easy,747,False,False,Largest Number At Least Twice of Others,largest-number-at-least-twice-of-others,"['Array', 'Sorting']",True,False
61.091957877791934,Easy,748,False,False,Shortest Completing Word,shortest-completing-word,"['Array', 'Hash Table', 'String']",True,False
52.28247602441151,Hard,749,False,False,Contain Virus,contain-virus,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix', 'Simulation']",True,False
67.80225409836066,Medium,750,False,True,Number Of Corner Rectangles,number-of-corner-rectangles,"['Array', 'Math', 'Dynamic Programming', 'Matrix']",True,False
55.33927347498286,Medium,751,False,True,IP to CIDR,ip-to-cidr,"['String', 'Bit Manipulation']",True,False
60.62998757349769,Medium,752,False,False,Open the Lock,open-the-lock,"['Array', 'Hash Table', 'String', 'Breadth-First Search']",True,False
57.632755229751474,Hard,753,False,False,Cracking the Safe,cracking-the-safe,"['Depth-First Search', 'Graph', 'Eulerian Circuit']",True,False
43.742325627612836,Medium,754,False,False,Reach a Number,reach-a-number,"['Math', 'Binary Search']",True,False
47.69748090732931,Medium,755,False,True,Pour Water,pour-water,"['Array', 'Simulation']",True,False
52.82553520985388,Medium,756,False,False,Pyramid Transition Matrix,pyramid-transition-matrix,"['Bit Manipulation', 'Depth-First Search', 'Breadth-First Search']",True,False
44.99751801578199,Hard,757,False,False,Set Intersection Size At Least Two,set-intersection-size-at-least-two,"['Array', 'Greedy', 'Sorting']",True,False
52.02289477810883,Medium,758,False,True,Bold Words in String,bold-words-in-string,"['Array', 'Hash Table', 'String', 'Trie', 'String Matching']",True,False
72.5462670919478,Hard,759,False,True,Employee Free Time,employee-free-time,"['Array', 'Sorting', 'Heap (Priority Queue)']",True,False
83.83671617032597,Easy,760,False,True,Find Anagram Mappings,find-anagram-mappings,"['Array', 'Hash Table']",True,True
63.13694713829251,Hard,761,False,False,Special Binary String,special-binary-string,"['String', 'Recursion']",True,False
70.66190402236371,Easy,762,False,False,Prime Number of Set Bits in Binary Representation,prime-number-of-set-bits-in-binary-representation,"['Math', 'Bit Manipulation']",True,False
81.43265850940335,Medium,763,False,False,Partition Labels,partition-labels,"['Hash Table', 'Two Pointers', 'String', 'Greedy']",True,False
48.46787932496543,Medium,764,False,False,Largest Plus Sign,largest-plus-sign,"['Array', 'Dynamic Programming']",True,False
58.19218267644513,Hard,765,False,False,Couples Holding Hands,couples-holding-hands,"['Greedy', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
69.51248417640954,Easy,766,False,False,Toeplitz Matrix,toeplitz-matrix,"['Array', 'Matrix']",True,False
55.9366002064432,Medium,767,False,False,Reorganize String,reorganize-string,"['Hash Table', 'String', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Counting']",True,False
54.007231944856414,Hard,768,False,False,Max Chunks To Make Sorted II,max-chunks-to-make-sorted-ii,"['Array', 'Stack', 'Greedy', 'Sorting', 'Monotonic Stack']",True,False
63.97788563681501,Medium,769,False,False,Max Chunks To Make Sorted,max-chunks-to-make-sorted,"['Array', 'Stack', 'Greedy', 'Sorting', 'Monotonic Stack']",True,False
54.62566965290595,Hard,770,False,False,Basic Calculator IV,basic-calculator-iv,"['Hash Table', 'Math', 'String', 'Stack', 'Recursion']",True,False
89.13535223998895,Easy,771,False,False,Jewels and Stones,jewels-and-stones,"['Hash Table', 'String']",True,False
52.13299553907146,Hard,772,False,True,Basic Calculator III,basic-calculator-iii,"['Math', 'String', 'Stack', 'Recursion']",True,False
73.0282944612453,Hard,773,False,False,Sliding Puzzle,sliding-puzzle,"['Array', 'Dynamic Programming', 'Backtracking', 'Breadth-First Search', 'Memoization', 'Matrix']",True,False
52.867216176186496,Hard,774,False,True,Minimize Max Distance to Gas Station,minimize-max-distance-to-gas-station,"['Array', 'Binary Search']",True,False
42.28475294018993,Medium,775,False,False,Global and Local Inversions,global-and-local-inversions,"['Array', 'Math']",True,False
82.45259674438017,Medium,776,False,True,Split BST,split-bst,"['Tree', 'Binary Search Tree', 'Recursion', 'Binary Tree']",True,False
37.42836440287201,Medium,777,False,False,Swap Adjacent in LR String,swap-adjacent-in-lr-string,"['Two Pointers', 'String']",True,False
62.38839087600958,Hard,778,False,False,Swim in Rising Water,swim-in-rising-water,"['Array', 'Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Heap (Priority Queue)', 'Matrix']",True,False
47.234436329308885,Medium,779,False,False,K-th Symbol in Grammar,k-th-symbol-in-grammar,"['Math', 'Bit Manipulation', 'Recursion']",True,False
33.544765138653084,Hard,780,False,False,Reaching Points,reaching-points,['Math'],True,False
52.64902676399027,Medium,781,False,False,Rabbits in Forest,rabbits-in-forest,"['Array', 'Hash Table', 'Math', 'Greedy']",True,False
50.43281603368946,Hard,782,False,False,Transform to Chessboard,transform-to-chessboard,"['Array', 'Math', 'Bit Manipulation', 'Matrix']",True,False
60.15531558987149,Easy,783,False,False,Minimum Distance Between BST Nodes,minimum-distance-between-bst-nodes,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Search Tree', 'Binary Tree']",True,False
74.90863890615289,Medium,784,False,False,Letter Case Permutation,letter-case-permutation,"['String', 'Backtracking', 'Bit Manipulation']",True,False
57.341464504163476,Medium,785,False,False,Is Graph Bipartite?,is-graph-bipartite,"['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,True
68.43292627692202,Medium,786,False,False,K-th Smallest Prime Fraction,k-th-smallest-prime-fraction,"['Array', 'Two Pointers', 'Binary Search', 'Sorting', 'Heap (Priority Queue)']",True,False
40.16093105214442,Medium,787,False,False,Cheapest Flights Within K Stops,cheapest-flights-within-k-stops,"['Dynamic Programming', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Shortest Path']",True,False
56.40553173221168,Medium,788,False,False,Rotated Digits,rotated-digits,"['Math', 'Dynamic Programming']",True,False
62.4516872305634,Medium,789,False,False,Escape The Ghosts,escape-the-ghosts,"['Array', 'Math']",True,False
48.49835644537631,Medium,790,False,False,Domino and Tromino Tiling,domino-and-tromino-tiling,['Dynamic Programming'],True,True
71.82988961222757,Medium,791,False,False,Custom Sort String,custom-sort-string,"['Hash Table', 'String', 'Sorting']",True,False
50.687434612008985,Medium,792,False,False,Number of Matching Subsequences,number-of-matching-subsequences,"['Array', 'Hash Table', 'String', 'Binary Search', 'Dynamic Programming', 'Trie', 'Sorting']",True,False
45.52537557573931,Hard,793,False,False,Preimage Size of Factorial Zeroes Function,preimage-size-of-factorial-zeroes-function,"['Math', 'Binary Search']",True,False
34.60564999226332,Medium,794,False,False,Valid Tic-Tac-Toe State,valid-tic-tac-toe-state,"['Array', 'Matrix']",True,False
53.63222710970682,Medium,795,False,False,Number of Subarrays with Bounded Maximum,number-of-subarrays-with-bounded-maximum,"['Array', 'Two Pointers']",True,False
63.68065043321861,Easy,796,False,False,Rotate String,rotate-string,"['String', 'String Matching']",True,False
82.98922606865055,Medium,797,False,False,All Paths From Source to Target,all-paths-from-source-to-target,"['Backtracking', 'Depth-First Search', 'Breadth-First Search', 'Graph']",True,False
51.869483288703755,Hard,798,False,False,Smallest Rotation with Highest Score,smallest-rotation-with-highest-score,"['Array', 'Prefix Sum']",True,False
58.22285233967178,Medium,799,False,False,Champagne Tower,champagne-tower,['Dynamic Programming'],True,False
67.7409615820062,Easy,800,False,True,Similar RGB Color,similar-rgb-color,"['Math', 'String', 'Enumeration']",True,False
40.62115181507497,Hard,801,False,False,Minimum Swaps To Make Sequences Increasing,minimum-swaps-to-make-sequences-increasing,"['Array', 'Dynamic Programming']",True,False
68.12969155688613,Medium,802,False,False,Find Eventual Safe States,find-eventual-safe-states,"['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']",True,False
35.37596657117626,Hard,803,False,False,Bricks Falling When Hit,bricks-falling-when-hit,"['Array', 'Union Find', 'Matrix']",True,False
83.17053656992641,Easy,804,False,False,Unique Morse Code Words,unique-morse-code-words,"['Array', 'Hash Table', 'String']",True,False
25.884467789436105,Hard,805,False,False,Split Array With Same Average,split-array-with-same-average,"['Array', 'Math', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']",True,False
70.359535161345,Easy,806,False,False,Number of Lines To Write String,number-of-lines-to-write-string,"['Array', 'String']",True,False
86.17387842175373,Medium,807,False,False,Max Increase to Keep City Skyline,max-increase-to-keep-city-skyline,"['Array', 'Greedy', 'Matrix']",True,False
53.31486542133044,Medium,808,False,False,Soup Servings,soup-servings,"['Math', 'Dynamic Programming', 'Probability and Statistics']",True,False
46.31948327104729,Medium,809,False,False,Expressive Words,expressive-words,"['Array', 'Two Pointers', 'String']",True,False
62.36200701329062,Hard,810,False,False,Chalkboard XOR Game,chalkboard-xor-game,"['Array', 'Math', 'Bit Manipulation', 'Brainteaser', 'Game Theory']",True,False
76.76082721414656,Medium,811,False,False,Subdomain Visit Count,subdomain-visit-count,"['Array', 'Hash Table', 'String', 'Counting']",True,False
61.75527611589976,Easy,812,False,False,Largest Triangle Area,largest-triangle-area,"['Array', 'Math', 'Geometry']",True,False
53.929003887578865,Medium,813,False,False,Largest Sum of Averages,largest-sum-of-averages,"['Array', 'Dynamic Programming', 'Prefix Sum']",True,False
72.31982496816119,Medium,814,False,False,Binary Tree Pruning,binary-tree-pruning,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
46.984025355820584,Hard,815,False,False,Bus Routes,bus-routes,"['Array', 'Hash Table', 'Breadth-First Search']",True,False
55.771468264304936,Medium,816,False,False,Ambiguous Coordinates,ambiguous-coordinates,"['String', 'Backtracking', 'Enumeration']",True,False
57.137057015254335,Medium,817,False,False,Linked List Components,linked-list-components,"['Array', 'Hash Table', 'Linked List']",True,False
44.005831866197184,Hard,818,False,False,Race Car,race-car,['Dynamic Programming'],True,False
44.506396445890815,Easy,819,False,False,Most Common Word,most-common-word,"['Array', 'Hash Table', 'String', 'Counting']",True,False
60.52004032817961,Medium,820,False,False,Short Encoding of Words,short-encoding-of-words,"['Array', 'Hash Table', 'String', 'Trie']",True,False
72.06469504108031,Easy,821,False,False,Shortest Distance to a Character,shortest-distance-to-a-character,"['Array', 'Two Pointers', 'String']",True,False
48.03421041148492,Medium,822,False,False,Card Flipping Game,card-flipping-game,"['Array', 'Hash Table']",True,False
52.90887697738267,Medium,823,False,False,Binary Trees With Factors,binary-trees-with-factors,"['Array', 'Hash Table', 'Dynamic Programming', 'Sorting']",True,False
69.20762417647614,Easy,824,False,False,Goat Latin,goat-latin,['String'],True,False
48.84988321891146,Medium,825,False,False,Friends Of Appropriate Ages,friends-of-appropriate-ages,"['Array', 'Two Pointers', 'Binary Search', 'Sorting']",True,False
55.855732377729375,Medium,826,False,False,Most Profit Assigning Work,most-profit-assigning-work,"['Array', 'Two Pointers', 'Binary Search', 'Greedy', 'Sorting']",True,False
54.35678249494747,Hard,827,False,False,Making A Large Island,making-a-large-island,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']",True,False
52.72776664742436,Hard,828,False,False,Count Unique Characters of All Substrings of a Given String,count-unique-characters-of-all-substrings-of-a-given-string,"['Hash Table', 'String', 'Dynamic Programming']",True,False
41.93235194965727,Hard,829,False,False,Consecutive Numbers Sum,consecutive-numbers-sum,"['Math', 'Enumeration']",True,False
52.78749361235556,Easy,830,False,False,Positions of Large Groups,positions-of-large-groups,['String'],True,False
50.254330190747645,Medium,831,False,False,Masking Personal Information,masking-personal-information,['String'],True,False
82.8247895944912,Easy,832,False,False,Flipping an Image,flipping-an-image,"['Array', 'Two Pointers', 'Bit Manipulation', 'Matrix', 'Simulation']",True,False
51.43118741801842,Medium,833,False,False,Find And Replace in String,find-and-replace-in-string,"['Array', 'Hash Table', 'String', 'Sorting']",True,False
65.266357020364,Hard,834,False,False,Sum of Distances in Tree,sum-of-distances-in-tree,"['Dynamic Programming', 'Tree', 'Depth-First Search', 'Graph']",True,False
63.70349898449752,Medium,835,False,False,Image Overlap,image-overlap,"['Array', 'Matrix']",True,False
45.58019713261649,Easy,836,False,False,Rectangle Overlap,rectangle-overlap,"['Math', 'Geometry']",True,False
44.79884641509014,Medium,837,False,False,New 21 Game,new-21-game,"['Math', 'Dynamic Programming', 'Sliding Window', 'Probability and Statistics']",True,False
57.34523527398162,Medium,838,False,False,Push Dominoes,push-dominoes,"['Two Pointers', 'String', 'Dynamic Programming']",True,False
55.22774834521764,Hard,839,False,False,Similar String Groups,similar-string-groups,"['Array', 'Hash Table', 'String', 'Depth-First Search', 'Breadth-First Search', 'Union Find']",True,False
51.52799840099307,Medium,840,False,False,Magic Squares In Grid,magic-squares-in-grid,"['Array', 'Hash Table', 'Math', 'Matrix']",True,False
74.38202544893322,Medium,841,False,False,Keys and Rooms,keys-and-rooms,"['Depth-First Search', 'Breadth-First Search', 'Graph']",True,False
39.560793405461105,Medium,842,False,False,Split Array into Fibonacci Sequence,split-array-into-fibonacci-sequence,"['String', 'Backtracking']",True,False
37.90718606946445,Hard,843,False,False,Guess the Word,guess-the-word,"['Array', 'Math', 'String', 'Interactive', 'Game Theory']",False,False
49.42981240576683,Easy,844,False,False,Backspace String Compare,backspace-string-compare,"['Two Pointers', 'String', 'Stack', 'Simulation']",True,False
40.95551182865376,Medium,845,False,False,Longest Mountain in Array,longest-mountain-in-array,"['Array', 'Two Pointers', 'Dynamic Programming', 'Enumeration']",True,False
56.911092380363506,Medium,846,False,False,Hand of Straights,hand-of-straights,"['Array', 'Hash Table', 'Greedy', 'Sorting']",True,False
65.35199799881302,Hard,847,False,False,Shortest Path Visiting All Nodes,shortest-path-visiting-all-nodes,"['Dynamic Programming', 'Bit Manipulation', 'Breadth-First Search', 'Graph', 'Bitmask']",True,False
45.379819812777264,Medium,848,False,False,Shifting Letters,shifting-letters,"['Array', 'String', 'Prefix Sum']",True,False
48.79006051152513,Medium,849,False,False,Maximize Distance to Closest Person,maximize-distance-to-closest-person,['Array'],True,False
54.45886329781139,Hard,850,False,False,Rectangle Area II,rectangle-area-ii,"['Array', 'Segment Tree', 'Line Sweep', 'Ordered Set']",True,False
61.055589291779455,Medium,851,False,False,Loud and Rich,loud-and-rich,"['Array', 'Depth-First Search', 'Graph', 'Topological Sort']",True,False
67.70708050032583,Medium,852,False,False,Peak Index in a Mountain Array,peak-index-in-a-mountain-array,"['Array', 'Binary Search']",True,False
53.124879572895075,Medium,853,False,False,Car Fleet,car-fleet,"['Array', 'Stack', 'Sorting', 'Monotonic Stack']",True,False
40.015461177948495,Hard,854,False,False,K-Similar Strings,k-similar-strings,"['String', 'Breadth-First Search']",True,False
43.628067967275015,Medium,855,False,False,Exam Room,exam-room,"['Design', 'Heap (Priority Queue)', 'Ordered Set']",True,False
63.756105197244835,Medium,856,False,False,Score of Parentheses,score-of-parentheses,"['String', 'Stack']",True,False
63.41818709977829,Hard,857,False,False,Minimum Cost to Hire K Workers,minimum-cost-to-hire-k-workers,"['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",True,False
62.02582758182349,Medium,858,False,False,Mirror Reflection,mirror-reflection,"['Math', 'Geometry', 'Number Theory']",True,False
33.579114986999734,Easy,859,False,False,Buddy Strings,buddy-strings,"['Hash Table', 'String']",True,False
58.33957143878362,Easy,860,False,False,Lemonade Change,lemonade-change,"['Array', 'Greedy']",True,False
80.22254090749644,Medium,861,False,False,Score After Flipping Matrix,score-after-flipping-matrix,"['Array', 'Greedy', 'Bit Manipulation', 'Matrix']",True,False
32.1805679829837,Hard,862,False,False,Shortest Subarray with Sum at Least K,shortest-subarray-with-sum-at-least-k,"['Array', 'Binary Search', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Prefix Sum', 'Monotonic Queue']",True,False
66.01983265308063,Medium,863,False,False,All Nodes Distance K in Binary Tree,all-nodes-distance-k-in-binary-tree,"['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
53.623476842875675,Hard,864,False,False,Shortest Path to Get All Keys,shortest-path-to-get-all-keys,"['Array', 'Bit Manipulation', 'Breadth-First Search', 'Matrix']",True,False
72.30797443386395,Medium,865,False,False,Smallest Subtree with all the Deepest Nodes,smallest-subtree-with-all-the-deepest-nodes,"['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
26.638408211521924,Medium,866,False,False,Prime Palindrome,prime-palindrome,"['Math', 'Number Theory']",True,False
73.89733137090121,Easy,867,False,False,Transpose Matrix,transpose-matrix,"['Array', 'Matrix', 'Simulation']",True,False
64.2286083217715,Easy,868,False,False,Binary Gap,binary-gap,['Bit Manipulation'],True,False
62.162760890548604,Medium,869,False,False,Reordered Power of 2,reordered-power-of-2,"['Hash Table', 'Math', 'Sorting', 'Counting', 'Enumeration']",True,False
53.19371196018832,Medium,870,False,False,Advantage Shuffle,advantage-shuffle,"['Array', 'Two Pointers', 'Greedy', 'Sorting']",True,False
40.44182693218124,Hard,871,False,False,Minimum Number of Refueling Stops,minimum-number-of-refueling-stops,"['Array', 'Dynamic Programming', 'Greedy', 'Heap (Priority Queue)']",True,False
70.06251339572765,Easy,872,False,False,Leaf-Similar Trees,leaf-similar-trees,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
57.64736291228429,Medium,873,False,False,Length of Longest Fibonacci Subsequence,length-of-longest-fibonacci-subsequence,"['Array', 'Hash Table', 'Dynamic Programming']",True,False
58.13973644581033,Medium,874,False,False,Walking Robot Simulation,walking-robot-simulation,"['Array', 'Hash Table', 'Simulation']",True,False
48.94998162910026,Medium,875,False,False,Koko Eating Bananas,koko-eating-bananas,"['Array', 'Binary Search']",True,False
80.26781642635602,Easy,876,False,False,Middle of the Linked List,middle-of-the-linked-list,"['Linked List', 'Two Pointers']",True,True
71.4737580805442,Medium,877,False,False,Stone Game,stone-game,"['Array', 'Math', 'Dynamic Programming', 'Game Theory']",True,False
35.69469242006168,Hard,878,False,False,Nth Magical Number,nth-magical-number,"['Math', 'Binary Search']",True,False
48.01548283454971,Hard,879,False,False,Profitable Schemes,profitable-schemes,"['Array', 'Dynamic Programming']",True,False
36.599790252885825,Medium,880,False,False,Decoded String at Index,decoded-string-at-index,"['String', 'Stack']",True,False
60.026964913388746,Medium,881,False,False,Boats to Save People,boats-to-save-people,"['Array', 'Two Pointers', 'Greedy', 'Sorting']",True,False
50.702546333089614,Hard,882,False,False,Reachable Nodes In Subdivided Graph,reachable-nodes-in-subdivided-graph,"['Graph', 'Heap (Priority Queue)', 'Shortest Path']",True,False
73.86464672124522,Easy,883,False,False,Projection Area of 3D Shapes,projection-area-of-3d-shapes,"['Array', 'Math', 'Geometry', 'Matrix']",True,False
75.29156863077002,Easy,884,False,False,Uncommon Words from Two Sentences,uncommon-words-from-two-sentences,"['Hash Table', 'String', 'Counting']",True,False
84.46413225846054,Medium,885,False,False,Spiral Matrix III,spiral-matrix-iii,"['Array', 'Matrix', 'Simulation']",True,False
51.27268569116453,Medium,886,False,False,Possible Bipartition,possible-bipartition,"['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
28.491824462684473,Hard,887,False,False,Super Egg Drop,super-egg-drop,"['Math', 'Binary Search', 'Dynamic Programming']",True,False
63.00751549246253,Easy,888,False,False,Fair Candy Swap,fair-candy-swap,"['Array', 'Hash Table', 'Binary Search', 'Sorting']",True,False
77.94737511906736,Medium,889,False,False,Construct Binary Tree from Preorder and Postorder Traversal,construct-binary-tree-from-preorder-and-postorder-traversal,"['Array', 'Hash Table', 'Divide and Conquer', 'Tree', 'Binary Tree']",True,False
76.81028163987398,Medium,890,False,False,Find and Replace Pattern,find-and-replace-pattern,"['Array', 'Hash Table', 'String']",True,False
38.699791340636416,Hard,891,False,False,Sum of Subsequence Widths,sum-of-subsequence-widths,"['Array', 'Math', 'Sorting']",True,False
67.6980778246601,Easy,892,False,False,Surface Area of 3D Shapes,surface-area-of-3d-shapes,"['Array', 'Math', 'Geometry', 'Matrix']",True,False
72.6229926076982,Medium,893,False,False,Groups of Special-Equivalent Strings,groups-of-special-equivalent-strings,"['Array', 'Hash Table', 'String', 'Sorting']",True,False
82.7064281423136,Medium,894,False,False,All Possible Full Binary Trees,all-possible-full-binary-trees,"['Dynamic Programming', 'Tree', 'Recursion', 'Memoization', 'Binary Tree']",True,False
66.74211325905274,Hard,895,False,False,Maximum Frequency Stack,maximum-frequency-stack,"['Hash Table', 'Stack', 'Design', 'Ordered Set']",True,False
61.570427860058295,Easy,896,False,False,Monotonic Array,monotonic-array,['Array'],True,False
78.578632489489,Easy,897,False,False,Increasing Order Search Tree,increasing-order-search-tree,"['Stack', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",True,False
40.42708663839934,Medium,898,False,False,Bitwise ORs of Subarrays,bitwise-ors-of-subarrays,"['Array', 'Dynamic Programming', 'Bit Manipulation']",True,False
66.12531231981549,Hard,899,False,False,Orderly Queue,orderly-queue,"['Math', 'String', 'Sorting']",True,False
59.76124333658683,Medium,900,False,False,RLE Iterator,rle-iterator,"['Array', 'Design', 'Counting', 'Iterator']",True,False
67.33226799483745,Medium,901,False,False,Online Stock Span,online-stock-span,"['Stack', 'Design', 'Monotonic Stack', 'Data Stream']",True,False
43.157941874524205,Hard,902,False,False,Numbers At Most N Given Digit Set,numbers-at-most-n-given-digit-set,"['Array', 'Math', 'String', 'Binary Search', 'Dynamic Programming']",True,False
56.76083335951985,Hard,903,False,False,Valid Permutations for DI Sequence,valid-permutations-for-di-sequence,"['String', 'Dynamic Programming', 'Prefix Sum']",True,False
45.80703194914707,Medium,904,False,False,Fruit Into Baskets,fruit-into-baskets,"['Array', 'Hash Table', 'Sliding Window']",True,False
76.27082593007681,Easy,905,False,False,Sort Array By Parity,sort-array-by-parity,"['Array', 'Two Pointers', 'Sorting']",True,False
39.17379343340709,Hard,906,False,False,Super Palindromes,super-palindromes,"['Math', 'String', 'Enumeration']",True,False
37.41173168485944,Medium,907,False,False,Sum of Subarray Minimums,sum-of-subarray-minimums,"['Array', 'Dynamic Programming', 'Stack', 'Monotonic Stack']",True,False
71.58882080079792,Easy,908,False,False,Smallest Range I,smallest-range-i,"['Array', 'Math']",True,False
44.07756756265562,Medium,909,False,False,Snakes and Ladders,snakes-and-ladders,"['Array', 'Breadth-First Search', 'Matrix']",True,False
36.98993370979622,Medium,910,False,False,Smallest Range II,smallest-range-ii,"['Array', 'Math', 'Greedy', 'Sorting']",True,False
52.48118313013187,Medium,911,False,False,Online Election,online-election,"['Array', 'Hash Table', 'Binary Search', 'Design']",True,False
56.93232572722968,Medium,912,False,False,Sort an Array,sort-an-array,"['Array', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Merge Sort', 'Bucket Sort', 'Radix Sort', 'Counting Sort']",True,False
33.98496467604613,Hard,913,False,False,Cat and Mouse,cat-and-mouse,"['Math', 'Dynamic Programming', 'Graph', 'Topological Sort', 'Memoization', 'Game Theory']",True,False
29.82988001063115,Easy,914,False,False,X of a Kind in a Deck of Cards,x-of-a-kind-in-a-deck-of-cards,"['Array', 'Hash Table', 'Math', 'Counting', 'Number Theory']",True,False
48.949954111105114,Medium,915,False,False,Partition Array into Disjoint Intervals,partition-array-into-disjoint-intervals,['Array'],True,False
55.6470290616781,Medium,916,False,False,Word Subsets,word-subsets,"['Array', 'Hash Table', 'String']",True,False
66.54752821171842,Easy,917,False,False,Reverse Only Letters,reverse-only-letters,"['Two Pointers', 'String']",True,False
47.12179479798736,Medium,918,False,False,Maximum Sum Circular Subarray,maximum-sum-circular-subarray,"['Array', 'Divide and Conquer', 'Dynamic Programming', 'Queue', 'Monotonic Queue']",True,False
66.28523431363993,Medium,919,False,False,Complete Binary Tree Inserter,complete-binary-tree-inserter,"['Tree', 'Breadth-First Search', 'Design', 'Binary Tree']",True,False
59.96689332835652,Hard,920,False,False,Number of Music Playlists,number-of-music-playlists,"['Math', 'Dynamic Programming', 'Combinatorics']",True,False
74.68292983521783,Medium,921,False,False,Minimum Add to Make Parentheses Valid,minimum-add-to-make-parentheses-valid,"['String', 'Stack', 'Greedy']",True,False
70.95307078945766,Easy,922,False,False,Sort Array By Parity II,sort-array-by-parity-ii,"['Array', 'Two Pointers', 'Sorting']",True,True
45.7215427105938,Medium,923,False,False,3Sum With Multiplicity,3sum-with-multiplicity,"['Array', 'Hash Table', 'Two Pointers', 'Sorting', 'Counting']",True,False
42.224148204322624,Hard,924,False,False,Minimize Malware Spread,minimize-malware-spread,"['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
32.437046019095156,Easy,925,False,False,Long Pressed Name,long-pressed-name,"['Two Pointers', 'String']",True,False
61.5596274794388,Medium,926,False,False,Flip String to Monotone Increasing,flip-string-to-monotone-increasing,"['String', 'Dynamic Programming']",True,False
40.590730908549595,Hard,927,False,False,Three Equal Parts,three-equal-parts,"['Array', 'Math']",True,False
44.44274315656953,Hard,928,False,False,Minimize Malware Spread II,minimize-malware-spread-ii,"['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
67.5014611116593,Easy,929,False,False,Unique Email Addresses,unique-email-addresses,"['Array', 'Hash Table', 'String']",True,False
65.35279189734217,Medium,930,False,False,Binary Subarrays With Sum,binary-subarrays-with-sum,"['Array', 'Hash Table', 'Sliding Window', 'Prefix Sum']",True,False
61.81258713357505,Medium,931,False,False,Minimum Falling Path Sum,minimum-falling-path-sum,"['Array', 'Dynamic Programming', 'Matrix']",True,False
66.82038834951456,Medium,932,False,False,Beautiful Array,beautiful-array,"['Array', 'Math', 'Divide and Conquer']",True,False
77.28447230368623,Easy,933,False,False,Number of Recent Calls,number-of-recent-calls,"['Design', 'Queue', 'Data Stream']",True,False
58.40125422614345,Medium,934,False,False,Shortest Bridge,shortest-bridge,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix']",True,False
60.99821040563056,Medium,935,False,False,Knight Dialer,knight-dialer,['Dynamic Programming'],True,False
61.87442392812649,Hard,936,False,False,Stamping The Sequence,stamping-the-sequence,"['String', 'Stack', 'Greedy', 'Queue']",True,False
56.70681096324507,Medium,937,False,False,Reorder Data in Log Files,reorder-data-in-log-files,"['Array', 'String', 'Sorting']",True,False
87.38042149433699,Easy,938,False,False,Range Sum of BST,range-sum-of-bst,"['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",True,True
54.86899047657063,Medium,939,False,False,Minimum Area Rectangle,minimum-area-rectangle,"['Array', 'Hash Table', 'Math', 'Geometry', 'Sorting']",True,False
43.43729788692286,Hard,940,False,False,Distinct Subsequences II,distinct-subsequences-ii,"['String', 'Dynamic Programming']",True,True
33.91260996736589,Easy,941,False,False,Valid Mountain Array,valid-mountain-array,['Array'],True,False
79.79284918571959,Easy,942,False,False,DI String Match,di-string-match,"['Array', 'Two Pointers', 'String', 'Greedy']",True,False
44.16177248309071,Hard,943,False,False,Find the Shortest Superstring,find-the-shortest-superstring,"['Array', 'String', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']",True,False
74.71573721321634,Easy,944,False,False,Delete Columns to Make Sorted,delete-columns-to-make-sorted,"['Array', 'String']",True,False
60.265955933264415,Medium,945,False,False,Minimum Increment to Make Array Unique,minimum-increment-to-make-array-unique,"['Array', 'Greedy', 'Sorting', 'Counting']",True,False
69.60058238492417,Medium,946,False,False,Validate Stack Sequences,validate-stack-sequences,"['Array', 'Stack', 'Simulation']",True,False
62.10919680412314,Medium,947,False,False,Most Stones Removed with Same Row or Column,most-stones-removed-with-same-row-or-column,"['Hash Table', 'Depth-First Search', 'Union Find', 'Graph']",True,False
59.093551943681135,Medium,948,False,False,Bag of Tokens,bag-of-tokens,"['Array', 'Two Pointers', 'Greedy', 'Sorting']",True,False
35.463833265222725,Medium,949,False,False,Largest Time for Given Digits,largest-time-for-given-digits,"['Array', 'String', 'Backtracking', 'Enumeration']",True,False
83.17545513324868,Medium,950,False,False,Reveal Cards In Increasing Order,reveal-cards-in-increasing-order,"['Array', 'Queue', 'Sorting', 'Simulation']",True,False
69.70901722613628,Medium,951,False,False,Flip Equivalent Binary Trees,flip-equivalent-binary-trees,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
41.01365671537047,Hard,952,False,False,Largest Component Size by Common Factor,largest-component-size-by-common-factor,"['Array', 'Hash Table', 'Math', 'Union Find', 'Number Theory']",True,False
55.48548672422747,Easy,953,False,False,Verifying an Alien Dictionary,verifying-an-alien-dictionary,"['Array', 'Hash Table', 'String']",True,False
39.32984361923828,Medium,954,False,False,Array of Doubled Pairs,array-of-doubled-pairs,"['Array', 'Hash Table', 'Greedy', 'Sorting']",True,False
35.47470879208553,Medium,955,False,False,Delete Columns to Make Sorted II,delete-columns-to-make-sorted-ii,"['Array', 'String', 'Greedy']",True,False
51.91275085758053,Hard,956,False,False,Tallest Billboard,tallest-billboard,"['Array', 'Dynamic Programming']",True,False
38.9429621877923,Medium,957,False,False,Prison Cells After N Days,prison-cells-after-n-days,"['Array', 'Hash Table', 'Math', 'Bit Manipulation']",True,False
58.13539757470946,Medium,958,False,False,Check Completeness of a Binary Tree,check-completeness-of-a-binary-tree,"['Tree', 'Breadth-First Search', 'Binary Tree']",True,False
77.64480820860643,Medium,959,False,False,Regions Cut By Slashes,regions-cut-by-slashes,"['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']",True,False
58.39348903043171,Hard,960,False,False,Delete Columns to Make Sorted III,delete-columns-to-make-sorted-iii,"['Array', 'String', 'Dynamic Programming']",True,False
77.32879206691304,Easy,961,False,False,N-Repeated Element in Size 2N Array,n-repeated-element-in-size-2n-array,"['Array', 'Hash Table']",True,False
55.6321164455922,Medium,962,False,False,Maximum Width Ramp,maximum-width-ramp,"['Array', 'Two Pointers', 'Stack', 'Monotonic Stack']",True,False
55.424733847126575,Medium,963,False,False,Minimum Area Rectangle II,minimum-area-rectangle-ii,"['Array', 'Math', 'Geometry']",True,False
48.43354905070073,Hard,964,False,False,Least Operators to Express Number,least-operators-to-express-number,"['Math', 'Dynamic Programming', 'Memoization']",True,False
71.90097923275339,Easy,965,False,False,Univalued Binary Tree,univalued-binary-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
51.50235170555734,Medium,966,False,False,Vowel Spellchecker,vowel-spellchecker,"['Array', 'Hash Table', 'String']",True,False
58.60490268228521,Medium,967,False,False,Numbers With Same Consecutive Differences,numbers-with-same-consecutive-differences,"['Backtracking', 'Breadth-First Search']",True,False
47.024390823090094,Hard,968,False,False,Binary Tree Cameras,binary-tree-cameras,"['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
71.0446864028197,Medium,969,False,False,Pancake Sorting,pancake-sorting,"['Array', 'Two Pointers', 'Greedy', 'Sorting']",True,False
43.91787161074378,Medium,970,False,False,Powerful Integers,powerful-integers,"['Hash Table', 'Math', 'Enumeration']",True,False
50.92912146590973,Medium,971,False,False,Flip Binary Tree To Match Preorder Traversal,flip-binary-tree-to-match-preorder-traversal,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
44.47035655058043,Hard,972,False,False,Equal Rational Numbers,equal-rational-numbers,"['Math', 'String']",True,False
67.68111842080934,Medium,973,False,False,K Closest Points to Origin,k-closest-points-to-origin,"['Array', 'Math', 'Divide and Conquer', 'Geometry', 'Sorting', 'Heap (Priority Queue)', 'Quickselect']",True,True
55.55922230569929,Medium,974,False,False,Subarray Sums Divisible by K,subarray-sums-divisible-by-k,"['Array', 'Hash Table', 'Prefix Sum']",True,False
40.62147925497315,Hard,975,False,False,Odd Even Jump,odd-even-jump,"['Array', 'Dynamic Programming', 'Stack', 'Monotonic Stack', 'Ordered Set']",True,False
57.1253927594543,Easy,976,False,False,Largest Perimeter Triangle,largest-perimeter-triangle,"['Array', 'Math', 'Greedy', 'Sorting']",True,False
73.12936396248637,Easy,977,False,False,Squares of a Sorted Array,squares-of-a-sorted-array,"['Array', 'Two Pointers', 'Sorting']",True,True
47.852458348608906,Medium,978,False,False,Longest Turbulent Subarray,longest-turbulent-subarray,"['Array', 'Dynamic Programming', 'Sliding Window']",True,False
77.11490992152673,Medium,979,False,False,Distribute Coins in Binary Tree,distribute-coins-in-binary-tree,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
82.24329388775875,Hard,980,False,False,Unique Paths III,unique-paths-iii,"['Array', 'Backtracking', 'Bit Manipulation', 'Matrix']",True,False
49.393764434180135,Medium,981,False,False,Time Based Key-Value Store,time-based-key-value-store,"['Hash Table', 'String', 'Binary Search', 'Design']",True,False
59.12236987818383,Hard,982,False,False,Triples with Bitwise AND Equal To Zero,triples-with-bitwise-and-equal-to-zero,"['Array', 'Hash Table', 'Bit Manipulation']",False,False
67.3995038799135,Medium,983,False,False,Minimum Cost For Tickets,minimum-cost-for-tickets,"['Array', 'Dynamic Programming']",True,False
44.38709783295452,Medium,984,False,False,String Without AAA or BBB,string-without-aaa-or-bbb,"['String', 'Greedy']",True,False
68.42519611679431,Medium,985,False,False,Sum of Even Numbers After Queries,sum-of-even-numbers-after-queries,"['Array', 'Simulation']",True,False
72.52939395174674,Medium,986,False,False,Interval List Intersections,interval-list-intersections,"['Array', 'Two Pointers', 'Line Sweep']",True,False
50.68134261376449,Hard,987,False,False,Vertical Order Traversal of a Binary Tree,vertical-order-traversal-of-a-binary-tree,"['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Sorting', 'Binary Tree']",True,True
60.70967531330589,Medium,988,False,False,Smallest String Starting From Leaf,smallest-string-starting-from-leaf,"['String', 'Backtracking', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
44.99370478649624,Easy,989,False,False,Add to Array-Form of Integer,add-to-array-form-of-integer,"['Array', 'Math']",True,False
50.90506186409628,Medium,990,False,False,Satisfiability of Equality Equations,satisfiability-of-equality-equations,"['Array', 'String', 'Union Find', 'Graph']",True,False
55.00351546805946,Medium,991,False,False,Broken Calculator,broken-calculator,"['Math', 'Greedy']",True,False
65.35153188789789,Hard,992,False,False,Subarrays with K Different Integers,subarrays-with-k-different-integers,"['Array', 'Hash Table', 'Sliding Window', 'Counting']",True,False
57.85490581460494,Easy,993,False,False,Cousins in Binary Tree,cousins-in-binary-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
56.16852824480861,Medium,994,False,False,Rotting Oranges,rotting-oranges,"['Array', 'Breadth-First Search', 'Matrix']",True,False
62.14162413689582,Hard,995,False,False,Minimum Number of K Consecutive Bit Flips,minimum-number-of-k-consecutive-bit-flips,"['Array', 'Bit Manipulation', 'Queue', 'Sliding Window', 'Prefix Sum']",True,False
50.395917246429875,Hard,996,False,False,Number of Squareful Arrays,number-of-squareful-arrays,"['Array', 'Hash Table', 'Math', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']",True,False
49.90866713231498,Easy,997,False,False,Find the Town Judge,find-the-town-judge,"['Array', 'Hash Table', 'Graph']",True,False
68.92288384240965,Medium,998,False,False,Maximum Binary Tree II,maximum-binary-tree-ii,"['Tree', 'Binary Tree']",False,False
70.13095774933049,Easy,999,False,False,Available Captures for Rook,available-captures-for-rook,"['Array', 'Matrix', 'Simulation']",False,False
44.1002133881293,Hard,1000,False,False,Minimum Cost to Merge Stones,minimum-cost-to-merge-stones,"['Array', 'Dynamic Programming', 'Prefix Sum']",False,False
37.80133627461872,Hard,1001,False,False,Grid Illumination,grid-illumination,"['Array', 'Hash Table']",False,False
74.51012173541616,Easy,1002,False,False,Find Common Characters,find-common-characters,"['Array', 'Hash Table', 'String']",True,False
59.955714529041046,Medium,1003,False,False,Check If Word Is Valid After Substitutions,check-if-word-is-valid-after-substitutions,"['String', 'Stack']",False,False
65.47932987301294,Medium,1004,False,False,Max Consecutive Ones III,max-consecutive-ones-iii,"['Array', 'Binary Search', 'Sliding Window', 'Prefix Sum']",True,False
52.08906798338961,Easy,1005,False,False,Maximize Sum Of Array After K Negations,maximize-sum-of-array-after-k-negations,"['Array', 'Greedy', 'Sorting']",False,False
58.86273660769517,Medium,1006,False,False,Clumsy Factorial,clumsy-factorial,"['Math', 'Stack', 'Simulation']",False,False
52.28514095536414,Medium,1007,False,False,Minimum Domino Rotations For Equal Row,minimum-domino-rotations-for-equal-row,"['Array', 'Greedy']",True,False
83.05029553311446,Medium,1008,False,False,Construct Binary Search Tree from Preorder Traversal,construct-binary-search-tree-from-preorder-traversal,"['Array', 'Stack', 'Tree', 'Binary Search Tree', 'Monotonic Stack', 'Binary Tree']",True,False
60.749958786505644,Easy,1009,False,False,Complement of Base 10 Integer,complement-of-base-10-integer,['Bit Manipulation'],True,False
53.18496452953998,Medium,1010,False,False,Pairs of Songs With Total Durations Divisible by 60,pairs-of-songs-with-total-durations-divisible-by-60,"['Array', 'Hash Table', 'Counting']",True,True
71.61172284276653,Medium,1011,False,False,Capacity To Ship Packages Within D Days,capacity-to-ship-packages-within-d-days,"['Array', 'Binary Search']",True,False
42.90261807315014,Hard,1012,False,False,Numbers With Repeated Digits,numbers-with-repeated-digits,"['Math', 'Dynamic Programming']",False,False
41.99001376607014,Easy,1013,False,False,Partition Array Into Three Parts With Equal Sum,partition-array-into-three-parts-with-equal-sum,"['Array', 'Greedy']",False,False
62.60449121694541,Medium,1014,False,False,Best Sightseeing Pair,best-sightseeing-pair,"['Array', 'Dynamic Programming']",True,False
46.512538089513846,Medium,1015,False,False,Smallest Integer Divisible by K,smallest-integer-divisible-by-k,"['Hash Table', 'Math']",True,False
57.88780401689322,Medium,1016,False,False,Binary String With Substrings Representing 1 To N,binary-string-with-substrings-representing-1-to-n,['String'],False,False
61.11429882946982,Medium,1017,False,False,Convert to Base -2,convert-to-base-2,['Math'],False,False
46.903260965622884,Easy,1018,False,False,Binary Prefix Divisible By 5,binary-prefix-divisible-by-5,"['Array', 'Bit Manipulation']",False,False
61.985471336481545,Medium,1019,False,False,Next Greater Node In Linked List,next-greater-node-in-linked-list,"['Array', 'Linked List', 'Stack', 'Monotonic Stack']",True,False
70.15443243433975,Medium,1020,False,False,Number of Enclaves,number-of-enclaves,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']",True,False
85.14958201323608,Easy,1021,False,False,Remove Outermost Parentheses,remove-outermost-parentheses,"['String', 'Stack']",False,False
73.32069976407445,Easy,1022,False,False,Sum of Root To Leaf Binary Numbers,sum-of-root-to-leaf-binary-numbers,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
63.44247385175079,Medium,1023,False,False,Camelcase Matching,camelcase-matching,"['Array', 'Two Pointers', 'String', 'Trie', 'String Matching']",False,False
51.83946940071188,Medium,1024,False,False,Video Stitching,video-stitching,"['Array', 'Dynamic Programming', 'Greedy']",False,False
70.04297073100051,Easy,1025,False,False,Divisor Game,divisor-game,"['Math', 'Dynamic Programming', 'Brainteaser', 'Game Theory']",False,False
78.04519001100198,Medium,1026,False,False,Maximum Difference Between Node and Ancestor,maximum-difference-between-node-and-ancestor,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
49.3924595847983,Medium,1027,False,False,Longest Arithmetic Subsequence,longest-arithmetic-subsequence,"['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming']",True,False
83.26151360086183,Hard,1028,False,False,Recover a Tree From Preorder Traversal,recover-a-tree-from-preorder-traversal,"['String', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
67.51447810930364,Medium,1029,False,False,Two City Scheduling,two-city-scheduling,"['Array', 'Greedy', 'Sorting']",True,False
72.46260598090473,Easy,1030,False,False,Matrix Cells in Distance Order,matrix-cells-in-distance-order,"['Array', 'Math', 'Geometry', 'Sorting', 'Matrix']",False,False
60.11836341607382,Medium,1031,False,False,Maximum Sum of Two Non-Overlapping Subarrays,maximum-sum-of-two-non-overlapping-subarrays,"['Array', 'Dynamic Programming', 'Sliding Window']",False,False
52.34679259876573,Hard,1032,False,False,Stream of Characters,stream-of-characters,"['Array', 'String', 'Design', 'Trie', 'Data Stream']",True,False
49.1949817943364,Medium,1033,False,False,Moving Stones Until Consecutive,moving-stones-until-consecutive,"['Math', 'Brainteaser']",False,False
49.59372874682321,Medium,1034,False,False,Coloring A Border,coloring-a-border,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix']",False,False
64.07579923367165,Medium,1035,False,False,Uncrossed Lines,uncrossed-lines,"['Array', 'Dynamic Programming']",True,False
35.182855345552284,Hard,1036,False,False,Escape a Large Maze,escape-a-large-maze,"['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search']",False,False
37.72612308804047,Easy,1037,False,False,Valid Boomerang,valid-boomerang,"['Array', 'Math', 'Geometry']",False,False
88.22514832579391,Medium,1038,False,False,Binary Search Tree to Greater Sum Tree,binary-search-tree-to-greater-sum-tree,"['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",True,False
59.94804781193706,Medium,1039,False,False,Minimum Score Triangulation of Polygon,minimum-score-triangulation-of-polygon,"['Array', 'Dynamic Programming']",False,False
56.957405525270254,Medium,1040,False,False,Moving Stones Until Consecutive II,moving-stones-until-consecutive-ii,"['Array', 'Math', 'Two Pointers', 'Sorting']",False,False
56.15856298739072,Medium,1041,False,False,Robot Bounded In Circle,robot-bounded-in-circle,"['Math', 'String', 'Simulation']",True,False
52.10960429693391,Medium,1042,False,False,Flower Planting With No Adjacent,flower-planting-with-no-adjacent,"['Depth-First Search', 'Breadth-First Search', 'Graph']",False,False
76.86804148702232,Medium,1043,False,False,Partition Array for Maximum Sum,partition-array-for-maximum-sum,"['Array', 'Dynamic Programming']",True,False
30.68275754822763,Hard,1044,False,False,Longest Duplicate Substring,longest-duplicate-substring,"['String', 'Binary Search', 'Sliding Window', 'Rolling Hash', 'Suffix Array', 'Hash Function']",True,False
62.95505786863069,Medium,1045,False,False,Customers Who Bought All Products,customers-who-bought-all-products,['Database'],True,False
65.82500539976715,Easy,1046,False,False,Last Stone Weight,last-stone-weight,"['Array', 'Heap (Priority Queue)']",True,False
71.22258662368239,Easy,1047,False,False,Remove All Adjacent Duplicates In String,remove-all-adjacent-duplicates-in-string,"['String', 'Stack']",True,False
61.786982424743705,Medium,1048,False,False,Longest String Chain,longest-string-chain,"['Array', 'Hash Table', 'Two Pointers', 'String', 'Dynamic Programming', 'Sorting']",True,False
57.128321024811626,Medium,1049,False,False,Last Stone Weight II,last-stone-weight-ii,"['Array', 'Dynamic Programming']",False,False
70.51212237472309,Easy,1050,False,False,Actors and Directors Who Cooperated At Least Three Times,actors-and-directors-who-cooperated-at-least-three-times,['Database'],True,False
81.05377523252508,Easy,1051,False,False,Height Checker,height-checker,"['Array', 'Sorting', 'Counting Sort']",True,False
64.08517340528793,Medium,1052,False,False,Grumpy Bookstore Owner,grumpy-bookstore-owner,"['Array', 'Sliding Window']",True,False
49.40936726718993,Medium,1053,False,False,Previous Permutation With One Swap,previous-permutation-with-one-swap,"['Array', 'Greedy']",False,False
47.24302834754552,Medium,1054,False,False,Distant Barcodes,distant-barcodes,"['Array', 'Hash Table', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Counting']",False,False
61.23077107322711,Medium,1055,False,True,Shortest Way to Form String,shortest-way-to-form-string,"['Two Pointers', 'String', 'Binary Search', 'Greedy']",True,False
49.180753725814675,Easy,1056,False,True,Confusing Number,confusing-number,['Math'],True,True
58.89638403012001,Medium,1057,False,True,Campus Bikes,campus-bikes,"['Array', 'Sorting', 'Heap (Priority Queue)']",True,False
45.362885701868755,Medium,1058,False,True,Minimize Rounding Error to Meet Target,minimize-rounding-error-to-meet-target,"['Array', 'Math', 'String', 'Greedy', 'Sorting']",False,False
37.0888763704121,Medium,1059,False,True,All Paths from Source Lead to Destination,all-paths-from-source-lead-to-destination,"['Graph', 'Topological Sort']",True,True
58.34719593108855,Medium,1060,False,True,Missing Element in Sorted Array,missing-element-in-sorted-array,"['Array', 'Binary Search']",True,False
76.55980605806005,Medium,1061,False,False,Lexicographically Smallest Equivalent String,lexicographically-smallest-equivalent-string,"['String', 'Union Find']",True,False
62.909150850091834,Medium,1062,False,True,Longest Repeating Substring,longest-repeating-substring,"['String', 'Binary Search', 'Dynamic Programming', 'Rolling Hash', 'Suffix Array', 'Hash Function']",True,False
79.1319596668128,Hard,1063,False,True,Number of Valid Subarrays,number-of-valid-subarrays,"['Array', 'Stack', 'Monotonic Stack']",True,False
63.93234100135318,Easy,1064,False,True,Fixed Point,fixed-point,"['Array', 'Binary Search']",True,False
68.10929763432972,Easy,1065,False,True,Index Pairs of a String,index-pairs-of-a-string,"['Array', 'String', 'Trie', 'Sorting']",True,False
55.26035577083681,Medium,1066,False,True,Campus Bikes II,campus-bikes-ii,"['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']",True,False
45.99559147685525,Hard,1067,False,True,Digit Count in Range,digit-count-in-range,"['Math', 'Dynamic Programming']",False,False
84.2356770208351,Easy,1068,False,False,Product Sales Analysis I,product-sales-analysis-i,['Database'],True,False
82.1077634350832,Easy,1069,False,True,Product Sales Analysis II,product-sales-analysis-ii,['Database'],True,False
44.06854593823094,Medium,1070,False,False,Product Sales Analysis III,product-sales-analysis-iii,['Database'],True,False
52.69900452411475,Easy,1071,False,False,Greatest Common Divisor of Strings,greatest-common-divisor-of-strings,"['Math', 'String']",True,False
78.48408056731321,Medium,1072,False,False,Flip Columns For Maximum Number of Equal Rows,flip-columns-for-maximum-number-of-equal-rows,"['Array', 'Hash Table', 'Matrix']",True,False
36.77342157907529,Medium,1073,False,False,Adding Two Negabinary Numbers,adding-two-negabinary-numbers,"['Array', 'Math']",False,False
74.41337500401562,Hard,1074,False,False,Number of Submatrices That Sum to Target,number-of-submatrices-that-sum-to-target,"['Array', 'Hash Table', 'Matrix', 'Prefix Sum']",True,False
65.27242314831814,Easy,1075,False,False,Project Employees I,project-employees-i,['Database'],True,False
50.22288501068075,Easy,1076,False,True,Project Employees II,project-employees-ii,['Database'],False,False
77.0635423263669,Medium,1077,False,True,Project Employees III,project-employees-iii,['Database'],True,False
63.62252781811264,Easy,1078,False,False,Occurrences After Bigram,occurrences-after-bigram,['String'],False,False
83.52833774931264,Medium,1079,False,False,Letter Tile Possibilities,letter-tile-possibilities,"['Hash Table', 'String', 'Backtracking', 'Counting']",True,False
57.567455804817534,Medium,1080,False,False,Insufficient Nodes in Root to Leaf Paths,insufficient-nodes-in-root-to-leaf-paths,"['Tree', 'Depth-First Search', 'Binary Tree']",False,False
61.727157017780684,Medium,1081,False,False,Smallest Subsequence of Distinct Characters,smallest-subsequence-of-distinct-characters,"['String', 'Stack', 'Greedy', 'Monotonic Stack']",False,False
74.65565384705634,Easy,1082,False,True,Sales Analysis I,sales-analysis-i,['Database'],True,False
49.88316271380428,Easy,1083,False,True,Sales Analysis II,sales-analysis-ii,['Database'],True,False
46.655884178102,Easy,1084,False,False,Sales Analysis III,sales-analysis-iii,['Database'],True,False
76.57430730478589,Easy,1085,False,True,Sum of Digits in the Minimum Number,sum-of-digits-in-the-minimum-number,"['Array', 'Math']",False,False
74.39961045284856,Easy,1086,False,True,High Five,high-five,"['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)']",True,False
66.65364239171656,Medium,1087,False,True,Brace Expansion,brace-expansion,"['String', 'Backtracking', 'Breadth-First Search']",True,False
47.082984898420975,Hard,1088,False,True,Confusing Number II,confusing-number-ii,"['Math', 'Backtracking']",True,False
52.64477290769839,Easy,1089,False,False,Duplicate Zeros,duplicate-zeros,"['Array', 'Two Pointers']",True,False
62.92325380856568,Medium,1090,False,False,Largest Values From Labels,largest-values-from-labels,"['Array', 'Hash Table', 'Greedy', 'Sorting', 'Counting']",False,False
49.339373145926466,Medium,1091,False,False,Shortest Path in Binary Matrix,shortest-path-in-binary-matrix,"['Array', 'Breadth-First Search', 'Matrix']",True,False
61.262654094211776,Hard,1092,False,False,Shortest Common Supersequence ,shortest-common-supersequence,"['String', 'Dynamic Programming']",True,False
42.15638385811979,Medium,1093,False,False,Statistics from a Large Sample,statistics-from-a-large-sample,"['Array', 'Math', 'Probability and Statistics']",False,False
55.97847066254913,Medium,1094,False,False,Car Pooling,car-pooling,"['Array', 'Sorting', 'Heap (Priority Queue)', 'Simulation', 'Prefix Sum']",True,False
40.253531851991944,Hard,1095,False,False,Find in Mountain Array,find-in-mountain-array,"['Array', 'Binary Search', 'Interactive']",True,False
63.14610978857803,Hard,1096,False,False,Brace Expansion II,brace-expansion-ii,"['String', 'Backtracking', 'Stack', 'Breadth-First Search']",False,False
50.78258174492484,Hard,1097,False,True,Game Play Analysis V,game-play-analysis-v,['Database'],True,False
43.30511564652666,Medium,1098,False,True,Unpopular Books,unpopular-books,['Database'],False,False
61.98172935408303,Easy,1099,False,True,Two Sum Less Than K,two-sum-less-than-k,"['Array', 'Two Pointers', 'Binary Search', 'Sorting']",True,True
76.2208036712361,Medium,1100,False,True,Find K-Length Substrings With No Repeated Characters,find-k-length-substrings-with-no-repeated-characters,"['Hash Table', 'String', 'Sliding Window']",True,False
65.63275155732646,Medium,1101,False,True,The Earliest Moment When Everyone Become Friends,the-earliest-moment-when-everyone-become-friends,"['Array', 'Union Find', 'Sorting']",True,False
53.93378222109225,Medium,1102,False,True,Path With Maximum Minimum Value,path-with-maximum-minimum-value,"['Array', 'Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Heap (Priority Queue)', 'Matrix']",True,False
66.15812690872073,Easy,1103,False,False,Distribute Candies to People,distribute-candies-to-people,"['Math', 'Simulation']",True,False
75.4339708908024,Medium,1104,False,False,Path In Zigzag Labelled Binary Tree,path-in-zigzag-labelled-binary-tree,"['Math', 'Tree', 'Binary Tree']",False,False
68.7003805410804,Medium,1105,False,False,Filling Bookcase Shelves,filling-bookcase-shelves,"['Array', 'Dynamic Programming']",True,False
69.98985205362388,Hard,1106,False,False,Parsing A Boolean Expression,parsing-a-boolean-expression,"['String', 'Stack', 'Recursion']",True,False
44.93140922857652,Medium,1107,False,True,New Users Daily Count,new-users-daily-count,['Database'],True,False
89.60699646421978,Easy,1108,False,False,Defanging an IP Address,defanging-an-ip-address,['String'],False,False
63.799943894521704,Medium,1109,False,False,Corporate Flight Bookings,corporate-flight-bookings,"['Array', 'Prefix Sum']",False,False
72.4225469894871,Medium,1110,False,False,Delete Nodes And Return Forest,delete-nodes-and-return-forest,"['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
71.3113768133375,Medium,1111,False,False,Maximum Nesting Depth of Two Valid Parentheses Strings,maximum-nesting-depth-of-two-valid-parentheses-strings,"['String', 'Stack']",False,False
71.09009036235608,Medium,1112,False,True,Highest Grade For Each Student,highest-grade-for-each-student,['Database'],True,False
65.10009263071223,Easy,1113,False,True,Reported Posts,reported-posts,['Database'],True,False
70.84084301494823,Easy,1114,False,False,Print in Order,print-in-order,['Concurrency'],True,False
68.91453323856398,Medium,1115,False,False,Print FooBar Alternately,print-foobar-alternately,['Concurrency'],False,False
63.05316425072075,Medium,1116,False,False,Print Zero Even Odd,print-zero-even-odd,['Concurrency'],False,False
57.49982452446128,Medium,1117,False,False,Building H2O,building-h2o,['Concurrency'],False,False
58.90692154724485,Easy,1118,False,True,Number of Days in a Month,number-of-days-in-a-month,['Math'],False,False
91.21501581408688,Easy,1119,False,True,Remove Vowels from a String,remove-vowels-from-a-string,['String'],True,False
66.77694422440706,Medium,1120,False,True,Maximum Average Subtree,maximum-average-subtree,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
60.45507584597433,Hard,1121,False,True,Divide Array Into Increasing Sequences,divide-array-into-increasing-sequences,"['Array', 'Counting']",False,False
74.88886421489404,Easy,1122,False,False,Relative Sort Array,relative-sort-array,"['Array', 'Hash Table', 'Sorting', 'Counting Sort']",True,False
78.78147243174334,Medium,1123,False,False,Lowest Common Ancestor of Deepest Leaves,lowest-common-ancestor-of-deepest-leaves,"['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
35.68919858009504,Medium,1124,False,False,Longest Well-Performing Interval,longest-well-performing-interval,"['Array', 'Hash Table', 'Stack', 'Monotonic Stack', 'Prefix Sum']",False,False
55.3290867002676,Hard,1125,False,False,Smallest Sufficient Team,smallest-sufficient-team,"['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']",True,False
65.87072038743526,Medium,1126,False,True,Active Businesses,active-businesses,['Database'],True,False
47.1253255995059,Hard,1127,False,True,User Purchase Platform,user-purchase-platform,['Database'],False,False
49.0744929503129,Easy,1128,False,False,Number of Equivalent Domino Pairs,number-of-equivalent-domino-pairs,"['Array', 'Hash Table', 'Counting']",False,False
47.16766805026683,Medium,1129,False,False,Shortest Path with Alternating Colors,shortest-path-with-alternating-colors,"['Breadth-First Search', 'Graph']",True,False
67.61703301756646,Medium,1130,False,False,Minimum Cost Tree From Leaf Values,minimum-cost-tree-from-leaf-values,"['Array', 'Dynamic Programming', 'Stack', 'Greedy', 'Monotonic Stack']",False,False
48.199985826660054,Medium,1131,False,False,Maximum of Absolute Value Expression,maximum-of-absolute-value-expression,"['Array', 'Math']",False,False
32.26194380671259,Medium,1132,False,True,Reported Posts II,reported-posts-ii,['Database'],True,False
70.7315327921639,Easy,1133,False,True,Largest Unique Number,largest-unique-number,"['Array', 'Hash Table', 'Sorting']",True,False
77.81476177574795,Easy,1134,False,True,Armstrong Number,armstrong-number,['Math'],True,False
62.510280790487094,Medium,1135,False,True,Connecting Cities With Minimum Cost,connecting-cities-with-minimum-cost,"['Union Find', 'Graph', 'Heap (Priority Queue)', 'Minimum Spanning Tree']",True,False
61.741030870197775,Medium,1136,False,True,Parallel Courses,parallel-courses,"['Graph', 'Topological Sort']",True,False
63.631861408861425,Easy,1137,False,False,N-th Tribonacci Number,n-th-tribonacci-number,"['Math', 'Dynamic Programming', 'Memoization']",True,False
51.57411374601815,Medium,1138,False,False,Alphabet Board Path,alphabet-board-path,"['Hash Table', 'String']",False,False
50.57339240460173,Medium,1139,False,False,Largest 1-Bordered Square,largest-1-bordered-square,"['Array', 'Dynamic Programming', 'Matrix']",False,False
73.02022313266201,Medium,1140,False,False,Stone Game II,stone-game-ii,"['Array', 'Math', 'Dynamic Programming', 'Prefix Sum', 'Game Theory']",False,False
49.33810044225094,Easy,1141,False,False,User Activity for the Past 30 Days I,user-activity-for-the-past-30-days-i,['Database'],True,False
35.72139226141434,Easy,1142,False,True,User Activity for the Past 30 Days II,user-activity-for-the-past-30-days-ii,['Database'],False,False
58.07241772366793,Medium,1143,False,False,Longest Common Subsequence,longest-common-subsequence,"['String', 'Dynamic Programming']",True,False
48.28270042194093,Medium,1144,False,False,Decrease Elements To Make Array Zigzag,decrease-elements-to-make-array-zigzag,"['Array', 'Greedy']",False,False
52.38331883877915,Medium,1145,False,False,Binary Tree Coloring Game,binary-tree-coloring-game,"['Tree', 'Depth-First Search', 'Binary Tree']",False,False
36.73514783894652,Medium,1146,False,False,Snapshot Array,snapshot-array,"['Array', 'Hash Table', 'Binary Search', 'Design']",True,False
58.74922916622366,Hard,1147,False,False,Longest Chunked Palindrome Decomposition,longest-chunked-palindrome-decomposition,"['Two Pointers', 'String', 'Dynamic Programming', 'Greedy', 'Rolling Hash', 'Hash Function']",False,False
77.1763891362871,Easy,1148,False,False,Article Views I,article-views-i,['Database'],True,False
47.206276530882235,Medium,1149,False,True,Article Views II,article-views-ii,['Database'],True,False
59.059862104517045,Easy,1150,False,True,Check If a Number Is Majority Element in a Sorted Array,check-if-a-number-is-majority-element-in-a-sorted-array,"['Array', 'Binary Search']",True,False
61.09148355593853,Medium,1151,False,True,Minimum Swaps to Group All 1's Together,minimum-swaps-to-group-all-1s-together,"['Array', 'Sliding Window']",True,True
43.38777571981815,Medium,1152,False,True,Analyze User Website Visit Pattern,analyze-user-website-visit-pattern,"['Array', 'Hash Table', 'Sorting']",False,False
34.81166344863698,Hard,1153,False,True,String Transforms Into Another String,string-transforms-into-another-string,"['Hash Table', 'String']",True,False
47.881664515964175,Easy,1154,False,False,Day of the Year,day-of-the-year,"['Math', 'String']",False,False
61.481266359840525,Medium,1155,False,False,Number of Dice Rolls With Target Sum,number-of-dice-rolls-with-target-sum,['Dynamic Programming'],True,False
43.62333078630426,Medium,1156,False,False,Swap For Longest Repeated Character Substring,swap-for-longest-repeated-character-substring,"['Hash Table', 'String', 'Sliding Window']",False,False
42.29262438008107,Hard,1157,False,False,Online Majority Element In Subarray,online-majority-element-in-subarray,"['Array', 'Binary Search', 'Design', 'Binary Indexed Tree', 'Segment Tree']",False,False
57.15057539575342,Medium,1158,False,False,Market Analysis I,market-analysis-i,['Database'],True,False
57.711010295835486,Hard,1159,False,True,Market Analysis II,market-analysis-ii,['Database'],True,False
70.92543172632514,Easy,1160,False,False,Find Words That Can Be Formed by Characters,find-words-that-can-be-formed-by-characters,"['Array', 'Hash Table', 'String', 'Counting']",True,False
67.28639095034606,Medium,1161,False,False,Maximum Level Sum of a Binary Tree,maximum-level-sum-of-a-binary-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
51.76993350320055,Medium,1162,False,False,As Far from Land as Possible,as-far-from-land-as-possible,"['Array', 'Dynamic Programming', 'Breadth-First Search', 'Matrix']",True,False
34.37285529964038,Hard,1163,False,False,Last Substring in Lexicographical Order,last-substring-in-lexicographical-order,"['Two Pointers', 'String']",False,False
57.230351837135494,Medium,1164,False,False,Product Price at a Given Date,product-price-at-a-given-date,['Database'],True,False
87.65631224555233,Easy,1165,False,True,Single-Row Keyboard,single-row-keyboard,"['Hash Table', 'String']",True,True
63.89480286580033,Medium,1166,False,True,Design File System,design-file-system,"['Hash Table', 'String', 'Design', 'Trie']",True,False
70.96294285609885,Medium,1167,False,True,Minimum Cost to Connect Sticks,minimum-cost-to-connect-sticks,"['Array', 'Greedy', 'Heap (Priority Queue)']",True,True
65.10745891276865,Hard,1168,False,True,Optimize Water Distribution in a Village,optimize-water-distribution-in-a-village,"['Union Find', 'Graph', 'Heap (Priority Queue)', 'Minimum Spanning Tree']",True,False
31.208158559959998,Medium,1169,False,False,Invalid Transactions,invalid-transactions,"['Array', 'Hash Table', 'String', 'Sorting']",False,False
62.56417311716618,Medium,1170,False,False,Compare Strings by Frequency of the Smallest Character,compare-strings-by-frequency-of-the-smallest-character,"['Array', 'Hash Table', 'String', 'Binary Search', 'Sorting']",False,False
52.80786867814182,Medium,1171,False,False,Remove Zero Sum Consecutive Nodes from Linked List,remove-zero-sum-consecutive-nodes-from-linked-list,"['Hash Table', 'Linked List']",True,False
32.764413172324176,Hard,1172,False,False,Dinner Plate Stacks,dinner-plate-stacks,"['Hash Table', 'Stack', 'Design', 'Heap (Priority Queue)']",False,False
80.88484661630955,Easy,1173,False,True,Immediate Food Delivery I,immediate-food-delivery-i,['Database'],True,False
53.924121950111314,Medium,1174,False,False,Immediate Food Delivery II,immediate-food-delivery-ii,['Database'],False,False
59.161248374512354,Easy,1175,False,False,Prime Arrangements,prime-arrangements,['Math'],False,False
54.035197800884426,Easy,1176,False,True,Diet Plan Performance,diet-plan-performance,"['Array', 'Sliding Window']",False,False
39.961117676209355,Medium,1177,False,False,Can Make Palindrome from Substring,can-make-palindrome-from-substring,"['Array', 'Hash Table', 'String', 'Bit Manipulation', 'Prefix Sum']",False,False
46.99840775752012,Hard,1178,False,False,Number of Valid Words for Each Puzzle,number-of-valid-words-for-each-puzzle,"['Array', 'Hash Table', 'String', 'Bit Manipulation', 'Trie']",True,False
76.76655629139073,Easy,1179,False,False,Reformat Department Table,reformat-department-table,['Database'],True,False
80.54319639688822,Easy,1180,False,True,Count Substrings with Only One Distinct Letter,count-substrings-with-only-one-distinct-letter,"['Math', 'String']",True,False
46.459806475623374,Medium,1181,False,True,Before and After Puzzle,before-and-after-puzzle,"['Array', 'Hash Table', 'String', 'Sorting']",False,False
55.43758667481845,Medium,1182,False,True,Shortest Distance to Target Color,shortest-distance-to-target-color,"['Array', 'Binary Search', 'Dynamic Programming']",True,False
68.57991093518059,Hard,1183,False,True,Maximum Number of Ones,maximum-number-of-ones,"['Math', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",True,False
54.48607850243449,Easy,1184,False,False,Distance Between Bus Stops,distance-between-bus-stops,['Array'],False,False
58.348985156013335,Easy,1185,False,False,Day of the Week,day-of-the-week,['Math'],False,False
44.83233532934132,Medium,1186,False,False,Maximum Subarray Sum with One Deletion,maximum-subarray-sum-with-one-deletion,"['Array', 'Dynamic Programming']",False,False
57.85668801738023,Hard,1187,False,False,Make Array Strictly Increasing,make-array-strictly-increasing,"['Array', 'Binary Search', 'Dynamic Programming', 'Sorting']",True,False
72.94281904857739,Medium,1188,False,True,Design Bounded Blocking Queue,design-bounded-blocking-queue,['Concurrency'],False,False
59.71063056856083,Easy,1189,False,False,Maximum Number of Balloons,maximum-number-of-balloons,"['Hash Table', 'String', 'Counting']",True,False
71.6778510944539,Medium,1190,False,False,Reverse Substrings Between Each Pair of Parentheses,reverse-substrings-between-each-pair-of-parentheses,"['String', 'Stack']",True,False
24.125376266190376,Medium,1191,False,False,K-Concatenation Maximum Sum,k-concatenation-maximum-sum,"['Array', 'Dynamic Programming']",False,False
57.39078178598619,Hard,1192,False,False,Critical Connections in a Network,critical-connections-in-a-network,"['Depth-First Search', 'Graph', 'Biconnected Component']",True,False
58.260829785107106,Medium,1193,False,False,Monthly Transactions I,monthly-transactions-i,['Database'],False,False
49.69353155972874,Hard,1194,False,True,Tournament Winners,tournament-winners,['Database'],True,False
73.7012582533948,Medium,1195,False,False,Fizz Buzz Multithreaded,fizz-buzz-multithreaded,['Concurrency'],False,False
67.07271712851032,Easy,1196,False,True,How Many Apples Can You Put into the Basket,how-many-apples-can-you-put-into-the-basket,"['Array', 'Greedy', 'Sorting']",True,True
41.20396357997089,Medium,1197,False,True,Minimum Knight Moves,minimum-knight-moves,['Breadth-First Search'],True,False
76.40976104134666,Medium,1198,False,True,Find Smallest Common Element in All Rows,find-smallest-common-element-in-all-rows,"['Array', 'Hash Table', 'Binary Search', 'Matrix', 'Counting']",True,True
46.13736778685232,Hard,1199,False,True,Minimum Time to Build Blocks,minimum-time-to-build-blocks,"['Array', 'Math', 'Greedy', 'Heap (Priority Queue)']",True,False
70.43357004829465,Easy,1200,False,False,Minimum Absolute Difference,minimum-absolute-difference,"['Array', 'Sorting']",True,False
30.27166462519367,Medium,1201,False,False,Ugly Number III,ugly-number-iii,"['Math', 'Binary Search', 'Combinatorics', 'Number Theory']",False,False
59.18000466582194,Medium,1202,False,False,Smallest String With Swaps,smallest-string-with-swaps,"['Array', 'Hash Table', 'String', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Sorting']",True,False
65.6584814001464,Hard,1203,False,False,Sort Items by Groups Respecting Dependencies,sort-items-by-groups-respecting-dependencies,"['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']",True,False
68.2687846450636,Medium,1204,False,False,Last Person to Fit in the Bus,last-person-to-fit-in-the-bus,['Database'],False,False
41.99627961621304,Medium,1205,False,True,Monthly Transactions II,monthly-transactions-ii,['Database'],True,False
61.818992420864916,Hard,1206,False,False,Design Skiplist,design-skiplist,"['Linked List', 'Design']",False,False
78.13156603315117,Easy,1207,False,False,Unique Number of Occurrences,unique-number-of-occurrences,"['Array', 'Hash Table']",True,True
58.7783175539859,Medium,1208,False,False,Get Equal Substrings Within Budget,get-equal-substrings-within-budget,"['String', 'Binary Search', 'Sliding Window', 'Prefix Sum']",True,False
59.270729156266015,Medium,1209,False,False,Remove All Adjacent Duplicates in String II,remove-all-adjacent-duplicates-in-string-ii,"['String', 'Stack']",True,False
50.383080240400055,Hard,1210,False,False,Minimum Moves to Reach Target with Rotations,minimum-moves-to-reach-target-with-rotations,"['Array', 'Breadth-First Search', 'Matrix']",False,False
46.926850233280845,Easy,1211,False,False,Queries Quality and Percentage,queries-quality-and-percentage,['Database'],False,False
55.785829288074865,Medium,1212,False,True,Team Scores in Football Tournament,team-scores-in-football-tournament,['Database'],False,False
80.10943292376929,Easy,1213,False,True,Intersection of Three Sorted Arrays,intersection-of-three-sorted-arrays,"['Array', 'Hash Table', 'Binary Search', 'Counting']",True,False
67.31425274670146,Medium,1214,False,True,Two Sum BSTs,two-sum-bsts,"['Two Pointers', 'Binary Search', 'Stack', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",True,False
47.57517418408507,Medium,1215,False,True,Stepping Numbers,stepping-numbers,"['Math', 'Backtracking', 'Breadth-First Search']",False,False
49.05841867833977,Hard,1216,False,True,Valid Palindrome III,valid-palindrome-iii,"['String', 'Dynamic Programming']",True,False
72.10344946245016,Easy,1217,False,False,Minimum Cost to Move Chips to The Same Position,minimum-cost-to-move-chips-to-the-same-position,"['Array', 'Math', 'Greedy']",True,False
54.48153504699511,Medium,1218,False,False,Longest Arithmetic Subsequence of Given Difference,longest-arithmetic-subsequence-of-given-difference,"['Array', 'Hash Table', 'Dynamic Programming']",True,False
68.06990460933517,Medium,1219,False,False,Path with Maximum Gold,path-with-maximum-gold,"['Array', 'Backtracking', 'Matrix']",True,False
61.5119359677035,Hard,1220,False,False,Count Vowels Permutation,count-vowels-permutation,['Dynamic Programming'],True,False
86.67806531271754,Easy,1221,False,False,Split a String in Balanced Strings,split-a-string-in-balanced-strings,"['String', 'Greedy', 'Counting']",False,False
72.08719851576994,Medium,1222,False,False,Queens That Can Attack the King,queens-that-can-attack-the-king,"['Array', 'Matrix', 'Simulation']",False,False
49.81307993625356,Hard,1223,False,False,Dice Roll Simulation,dice-roll-simulation,"['Array', 'Dynamic Programming']",False,False
37.340209821034996,Hard,1224,False,False,Maximum Equal Frequency,maximum-equal-frequency,"['Array', 'Hash Table']",False,False
57.35112478992448,Hard,1225,False,True,Report Contiguous Dates,report-contiguous-dates,['Database'],False,False
54.56849163753558,Medium,1226,False,False,The Dining Philosophers,the-dining-philosophers,['Concurrency'],False,False
66.59517648849469,Medium,1227,False,False,Airplane Seat Assignment Probability,airplane-seat-assignment-probability,"['Math', 'Dynamic Programming', 'Brainteaser', 'Probability and Statistics']",False,False
52.05930807248764,Easy,1228,False,True,Missing Number In Arithmetic Progression,missing-number-in-arithmetic-progression,"['Array', 'Math']",True,True
55.17577776455892,Medium,1229,False,True,Meeting Scheduler,meeting-scheduler,"['Array', 'Two Pointers', 'Sorting']",True,False
58.14571278274593,Medium,1230,False,True,Toss Strange Coins,toss-strange-coins,"['Array', 'Math', 'Dynamic Programming', 'Probability and Statistics']",True,False
59.760295197322634,Hard,1231,False,True,Divide Chocolate,divide-chocolate,"['Array', 'Binary Search']",True,False
39.64442362740381,Easy,1232,False,False,Check If It Is a Straight Line,check-if-it-is-a-straight-line,"['Array', 'Math', 'Geometry']",True,False
75.70458372656785,Medium,1233,False,False,Remove Sub-Folders from the Filesystem,remove-sub-folders-from-the-filesystem,"['Array', 'String', 'Depth-First Search', 'Trie']",True,False
39.243065211174546,Medium,1234,False,False,Replace the Substring for Balanced String,replace-the-substring-for-balanced-string,"['String', 'Sliding Window']",False,False
54.338065023371804,Hard,1235,False,False,Maximum Profit in Job Scheduling,maximum-profit-in-job-scheduling,"['Array', 'Binary Search', 'Dynamic Programming', 'Sorting']",True,False
68.59690674126941,Medium,1236,False,True,Web Crawler,web-crawler,"['String', 'Depth-First Search', 'Breadth-First Search', 'Interactive']",True,False
69.39659194833797,Medium,1237,False,False,Find Positive Integer Solution for a Given Equation,find-positive-integer-solution-for-a-given-equation,"['Math', 'Two Pointers', 'Binary Search', 'Interactive']",False,False
71.35326913329955,Medium,1238,False,False,Circular Permutation in Binary Representation,circular-permutation-in-binary-representation,"['Math', 'Backtracking', 'Bit Manipulation']",False,False
54.204658410122775,Medium,1239,False,False,Maximum Length of a Concatenated String with Unique Characters,maximum-length-of-a-concatenated-string-with-unique-characters,"['Array', 'String', 'Backtracking', 'Bit Manipulation']",True,True
54.33779271327393,Hard,1240,False,False,Tiling a Rectangle with the Fewest Squares,tiling-a-rectangle-with-the-fewest-squares,['Backtracking'],False,False
66.04542406684662,Easy,1241,False,True,Number of Comments per Post,number-of-comments-per-post,['Database'],False,False
49.73323224239361,Medium,1242,False,True,Web Crawler Multithreaded,web-crawler-multithreaded,"['Depth-First Search', 'Breadth-First Search', 'Concurrency']",False,False
52.9842744817727,Easy,1243,False,True,Array Transformation,array-transformation,"['Array', 'Simulation']",False,False
67.88152618811426,Medium,1244,False,True,Design A Leaderboard,design-a-leaderboard,"['Hash Table', 'Design', 'Sorting']",True,False
61.026874779955406,Medium,1245,False,True,Tree Diameter,tree-diameter,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']",True,False
46.32004574415945,Hard,1246,False,True,Palindrome Removal,palindrome-removal,"['Array', 'Dynamic Programming']",False,False
64.49645809568071,Medium,1247,False,False,Minimum Swaps to Make Strings Equal,minimum-swaps-to-make-strings-equal,"['Math', 'String', 'Greedy']",False,False
72.620829374737,Medium,1248,False,False,Count Number of Nice Subarrays,count-number-of-nice-subarrays,"['Array', 'Hash Table', 'Math', 'Sliding Window', 'Prefix Sum']",True,False
70.42878607998813,Medium,1249,False,False,Minimum Remove to Make Valid Parentheses,minimum-remove-to-make-valid-parentheses,"['String', 'Stack']",True,False
60.940158373416786,Hard,1250,False,False,Check If It Is a Good Array,check-if-it-is-a-good-array,"['Array', 'Math', 'Number Theory']",False,False
36.869124326608215,Easy,1251,False,False,Average Selling Price,average-selling-price,['Database'],True,False
79.14397223560215,Easy,1252,False,False,Cells with Odd Values in a Matrix,cells-with-odd-values-in-a-matrix,"['Array', 'Math', 'Simulation']",False,False
47.49182031044054,Medium,1253,False,False,Reconstruct a 2-Row Binary Matrix,reconstruct-a-2-row-binary-matrix,"['Array', 'Greedy', 'Matrix']",False,False
66.67404281185763,Medium,1254,False,False,Number of Closed Islands,number-of-closed-islands,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']",True,False
81.60970693333682,Hard,1255,False,False,Maximum Score Words Formed by Letters,maximum-score-words-formed-by-letters,"['Array', 'String', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']",True,False
70.07111644246423,Medium,1256,False,True,Encode Number,encode-number,"['Math', 'String', 'Bit Manipulation']",False,False
67.88072803414673,Medium,1257,False,True,Smallest Common Region,smallest-common-region,"['Array', 'Hash Table', 'String', 'Tree', 'Depth-First Search', 'Breadth-First Search']",True,False
56.48189875319213,Medium,1258,False,True,Synonymous Sentences,synonymous-sentences,"['Array', 'Hash Table', 'String', 'Backtracking', 'Union Find']",False,False
59.952374282112345,Hard,1259,False,True,Handshakes That Don't Cross,handshakes-that-dont-cross,"['Math', 'Dynamic Programming']",True,False
67.5911541087023,Easy,1260,False,False,Shift 2D Grid,shift-2d-grid,"['Array', 'Matrix', 'Simulation']",True,False
84.77613251900347,Medium,1261,False,False,Find Elements in a Contaminated Binary Tree,find-elements-in-a-contaminated-binary-tree,"['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Design', 'Binary Tree']",True,False
50.732128867603,Medium,1262,False,False,Greatest Sum Divisible by Three,greatest-sum-divisible-by-three,"['Array', 'Dynamic Programming', 'Greedy', 'Sorting']",False,False
48.911900065746224,Hard,1263,False,False,Minimum Moves to Move a Box to Their Target Location,minimum-moves-to-move-a-box-to-their-target-location,"['Array', 'Breadth-First Search', 'Heap (Priority Queue)', 'Matrix']",False,False
65.37037284600885,Medium,1264,False,True,Page Recommendations,page-recommendations,['Database'],False,False
94.04861693210394,Medium,1265,False,True,Print Immutable Linked List in Reverse,print-immutable-linked-list-in-reverse,"['Linked List', 'Two Pointers', 'Stack', 'Recursion']",True,False
82.5036631449063,Easy,1266,False,False,Minimum Time Visiting All Points,minimum-time-visiting-all-points,"['Array', 'Math', 'Geometry']",True,False
73.4446905087248,Medium,1267,False,False,Count Servers that Communicate,count-servers-that-communicate,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix', 'Counting']",True,False
65.01592024893793,Medium,1268,False,False,Search Suggestions System,search-suggestions-system,"['Array', 'String', 'Binary Search', 'Trie', 'Sorting', 'Heap (Priority Queue)']",True,False
50.08992155119844,Hard,1269,False,False,Number of Ways to Stay in the Same Place After Some Steps,number-of-ways-to-stay-in-the-same-place-after-some-steps,['Dynamic Programming'],True,False
84.48569388763798,Medium,1270,False,True,All People Report to the Given Manager,all-people-report-to-the-given-manager,['Database'],False,False
58.334135772749164,Easy,1271,False,True,Hexspeak,hexspeak,"['Math', 'String']",False,False
66.65030965514907,Medium,1272,False,True,Remove Interval,remove-interval,['Array'],True,True
61.20766988113927,Medium,1273,False,True,Delete Tree Nodes,delete-tree-nodes,"['Array', 'Tree', 'Depth-First Search', 'Breadth-First Search']",False,False
68.7791136151901,Hard,1274,False,True,Number of Ships in a Rectangle,number-of-ships-in-a-rectangle,"['Array', 'Divide and Conquer', 'Interactive']",True,False
54.11718548495493,Easy,1275,False,False,Find Winner on a Tic Tac Toe Game,find-winner-on-a-tic-tac-toe-game,"['Array', 'Hash Table', 'Matrix', 'Simulation']",True,False
50.31752025264314,Medium,1276,False,False,Number of Burgers with No Waste of Ingredients,number-of-burgers-with-no-waste-of-ingredients,['Math'],False,False
78.56983650100068,Medium,1277,False,False,Count Square Submatrices with All Ones,count-square-submatrices-with-all-ones,"['Array', 'Dynamic Programming', 'Matrix']",True,False
61.40761136046468,Hard,1278,False,False,Palindrome Partitioning III,palindrome-partitioning-iii,"['String', 'Dynamic Programming']",False,False
72.8631380609798,Easy,1279,False,True,Traffic Light Controlled Intersection,traffic-light-controlled-intersection,['Concurrency'],False,False
60.38628897291266,Easy,1280,False,False,Students and Examinations,students-and-examinations,['Database'],True,False
86.65590388003632,Easy,1281,False,False,Subtract the Product and Sum of Digits of an Integer,subtract-the-product-and-sum-of-digits-of-an-integer,['Math'],False,False
87.34849800312554,Medium,1282,False,False,Group the People Given the Group Size They Belong To,group-the-people-given-the-group-size-they-belong-to,"['Array', 'Hash Table', 'Greedy']",True,False
62.942430423630135,Medium,1283,False,False,Find the Smallest Divisor Given a Threshold,find-the-smallest-divisor-given-a-threshold,"['Array', 'Binary Search']",True,False
71.85906719304859,Hard,1284,False,False,Minimum Number of Flips to Convert Binary Matrix to Zero Matrix,minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix,"['Array', 'Hash Table', 'Bit Manipulation', 'Breadth-First Search', 'Matrix']",True,False
82.0125578926172,Medium,1285,False,True,Find the Start and End Number of Continuous Ranges,find-the-start-and-end-number-of-continuous-ranges,['Database'],False,False
73.46597036952943,Medium,1286,False,False,Iterator for Combination,iterator-for-combination,"['String', 'Backtracking', 'Design', 'Iterator']",True,False
61.04620691257684,Easy,1287,False,False,Element Appearing More Than 25% In Sorted Array,element-appearing-more-than-25-in-sorted-array,['Array'],True,False
56.16855898575709,Medium,1288,False,False,Remove Covered Intervals,remove-covered-intervals,"['Array', 'Sorting']",True,False
63.966254332043206,Hard,1289,False,False,Minimum Falling Path Sum II,minimum-falling-path-sum-ii,"['Array', 'Dynamic Programming', 'Matrix']",True,False
81.15532648955003,Easy,1290,False,False,Convert Binary Number in a Linked List to Integer,convert-binary-number-in-a-linked-list-to-integer,"['Linked List', 'Math']",True,False
65.26316092235034,Medium,1291,False,False,Sequential Digits,sequential-digits,['Enumeration'],True,False
53.44344257557366,Medium,1292,False,False,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,"['Array', 'Binary Search', 'Matrix', 'Prefix Sum']",False,False
45.46688230452357,Hard,1293,False,False,Shortest Path in a Grid with Obstacles Elimination,shortest-path-in-a-grid-with-obstacles-elimination,"['Array', 'Breadth-First Search', 'Matrix']",True,False
67.01573963754939,Easy,1294,False,True,Weather Type in Each Country,weather-type-in-each-country,['Database'],False,False
77.76878511689246,Easy,1295,False,False,Find Numbers with Even Number of Digits,find-numbers-with-even-number-of-digits,"['Array', 'Math']",True,False
58.56990096668977,Medium,1296,False,False,Divide Array in Sets of K Consecutive Numbers,divide-array-in-sets-of-k-consecutive-numbers,"['Array', 'Hash Table', 'Greedy', 'Sorting']",False,False
53.055268815535186,Medium,1297,False,False,Maximum Number of Occurrences of a Substring,maximum-number-of-occurrences-of-a-substring,"['Hash Table', 'String', 'Sliding Window']",False,False
57.49432667293961,Hard,1298,False,False,Maximum Candies You Can Get from Boxes,maximum-candies-you-can-get-from-boxes,"['Array', 'Breadth-First Search', 'Graph']",False,False
71.35409431255727,Easy,1299,False,False,Replace Elements with Greatest Element on Right Side,replace-elements-with-greatest-element-on-right-side,['Array'],False,False
45.02160878164143,Medium,1300,False,False,Sum of Mutated Array Closest to Target,sum-of-mutated-array-closest-to-target,"['Array', 'Binary Search', 'Sorting']",False,False
40.75058799468248,Hard,1301,False,False,Number of Paths with Max Score,number-of-paths-with-max-score,"['Array', 'Dynamic Programming', 'Matrix']",False,False
86.27408004449535,Medium,1302,False,False,Deepest Leaves Sum,deepest-leaves-sum,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
89.6604811319646,Easy,1303,False,True,Find the Team Size,find-the-team-size,['Database'],False,False
76.14747050716299,Easy,1304,False,False,Find N Unique Integers Sum up to Zero,find-n-unique-integers-sum-up-to-zero,"['Array', 'Math']",False,False
79.97565285421388,Medium,1305,False,False,All Elements in Two Binary Search Trees,all-elements-in-two-binary-search-trees,"['Tree', 'Depth-First Search', 'Binary Search Tree', 'Sorting', 'Binary Tree']",True,False
65.8506506287044,Medium,1306,False,False,Jump Game III,jump-game-iii,"['Array', 'Depth-First Search', 'Breadth-First Search']",True,True
34.70169071434894,Hard,1307,False,False,Verbal Arithmetic Puzzle,verbal-arithmetic-puzzle,"['Array', 'Math', 'String', 'Backtracking']",False,False
86.38529878993508,Medium,1308,False,True,Running Total for Different Genders,running-total-for-different-genders,['Database'],False,False
80.10693873253032,Easy,1309,False,False,Decrypt String from Alphabet to Integer Mapping,decrypt-string-from-alphabet-to-integer-mapping,['String'],False,False
78.44323164330265,Medium,1310,False,False,XOR Queries of a Subarray,xor-queries-of-a-subarray,"['Array', 'Bit Manipulation', 'Prefix Sum']",True,False
48.89990953734815,Medium,1311,False,False,Get Watched Videos by Your Friends,get-watched-videos-by-your-friends,"['Array', 'Hash Table', 'Breadth-First Search', 'Graph', 'Sorting']",False,False
72.03855649491055,Hard,1312,False,False,Minimum Insertion Steps to Make a String Palindrome,minimum-insertion-steps-to-make-a-string-palindrome,"['String', 'Dynamic Programming']",True,False
85.97926371149511,Easy,1313,False,False,Decompress Run-Length Encoded List,decompress-run-length-encoded-list,['Array'],False,False
75.82947981378548,Medium,1314,False,False,Matrix Block Sum,matrix-block-sum,"['Array', 'Matrix', 'Prefix Sum']",False,False
85.65964130104368,Medium,1315,False,False,Sum of Nodes with Even-Valued Grandparent,sum-of-nodes-with-even-valued-grandparent,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
51.72137496327556,Hard,1316,False,False,Distinct Echo Substrings,distinct-echo-substrings,"['String', 'Trie', 'Rolling Hash', 'Hash Function']",False,False
54.07235906697922,Easy,1317,False,False,Convert Integer to the Sum of Two No-Zero Integers,convert-integer-to-the-sum-of-two-no-zero-integers,['Math'],False,False
71.50470899700534,Medium,1318,False,False,Minimum Flips to Make a OR b Equal to c,minimum-flips-to-make-a-or-b-equal-to-c,['Bit Manipulation'],True,False
64.20480161643248,Medium,1319,False,False,Number of Operations to Make Network Connected,number-of-operations-to-make-network-connected,"['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
59.03548711652257,Hard,1320,False,False,Minimum Distance to Type a Word Using Two Fingers,minimum-distance-to-type-a-word-using-two-fingers,"['String', 'Dynamic Programming']",False,False
55.99026995195203,Medium,1321,False,False,Restaurant Growth,restaurant-growth,['Database'],False,False
59.284108038648775,Easy,1322,False,True,Ads Performance,ads-performance,['Database'],True,False
82.52496910178041,Easy,1323,False,False,Maximum 69 Number,maximum-69-number,"['Math', 'Greedy']",True,False
65.91436495358842,Medium,1324,False,False,Print Words Vertically,print-words-vertically,"['Array', 'String', 'Simulation']",False,False
77.28276057593001,Medium,1325,False,False,Delete Leaves With a Given Value,delete-leaves-with-a-given-value,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
50.70397111913357,Hard,1326,False,False,Minimum Number of Taps to Open to Water a Garden,minimum-number-of-taps-to-open-to-water-a-garden,"['Array', 'Dynamic Programming', 'Greedy']",True,False
71.81897429972798,Easy,1327,False,False,List the Products Ordered in a Period,list-the-products-ordered-in-a-period,['Database'],False,False
51.518281229606345,Medium,1328,False,False,Break a Palindrome,break-a-palindrome,"['String', 'Greedy']",True,False
82.94078565680385,Medium,1329,False,False,Sort the Matrix Diagonally,sort-the-matrix-diagonally,"['Array', 'Sorting', 'Matrix']",True,True
42.24004753416518,Hard,1330,False,False,Reverse Subarray To Maximize Array Value,reverse-subarray-to-maximize-array-value,"['Array', 'Math', 'Greedy']",False,False
70.62256527594745,Easy,1331,False,False,Rank Transform of an Array,rank-transform-of-an-array,"['Array', 'Hash Table', 'Sorting']",True,False
76.5793421193614,Easy,1332,False,False,Remove Palindromic Subsequences,remove-palindromic-subsequences,"['Two Pointers', 'String']",True,False
62.97932659560759,Medium,1333,False,False,"Filter Restaurants by Vegan-Friendly, Price and Distance",filter-restaurants-by-vegan-friendly-price-and-distance,"['Array', 'Sorting']",False,False
69.55491940156084,Medium,1334,False,False,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,"['Dynamic Programming', 'Graph', 'Shortest Path']",True,False
59.633501316625804,Hard,1335,False,False,Minimum Difficulty of a Job Schedule,minimum-difficulty-of-a-job-schedule,"['Array', 'Dynamic Programming']",True,False
48.0612279454096,Hard,1336,False,True,Number of Transactions per Visit,number-of-transactions-per-visit,['Database'],False,False
73.89150569532823,Easy,1337,False,False,The K Weakest Rows in a Matrix,the-k-weakest-rows-in-a-matrix,"['Array', 'Binary Search', 'Sorting', 'Heap (Priority Queue)', 'Matrix']",True,False
69.0656907188273,Medium,1338,False,False,Reduce Array Size to The Half,reduce-array-size-to-the-half,"['Array', 'Hash Table', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",True,False
47.83125522556254,Medium,1339,False,False,Maximum Product of Splitted Binary Tree,maximum-product-of-splitted-binary-tree,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
63.849407196838385,Hard,1340,False,False,Jump Game V,jump-game-v,"['Array', 'Dynamic Programming', 'Sorting']",False,False
41.27122782025955,Medium,1341,False,False,Movie Rating,movie-rating,['Database'],False,False
85.55795138797583,Easy,1342,False,False,Number of Steps to Reduce a Number to Zero,number-of-steps-to-reduce-a-number-to-zero,"['Math', 'Bit Manipulation']",True,True
69.91039971938658,Medium,1343,False,False,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,"['Array', 'Sliding Window']",False,False
64.1327365482722,Medium,1344,False,False,Angle Between Hands of a Clock,angle-between-hands-of-a-clock,['Math'],True,False
46.06522680263601,Hard,1345,False,False,Jump Game IV,jump-game-iv,"['Array', 'Hash Table', 'Breadth-First Search']",True,False
41.119870865804984,Easy,1346,False,False,Check If N and Its Double Exist,check-if-n-and-its-double-exist,"['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Sorting']",True,False
82.1019032982622,Medium,1347,False,False,Minimum Number of Steps to Make Two Strings Anagram,minimum-number-of-steps-to-make-two-strings-anagram,"['Hash Table', 'String', 'Counting']",True,False
45.18159254381522,Medium,1348,False,False,Tweet Counts Per Frequency,tweet-counts-per-frequency,"['Hash Table', 'Binary Search', 'Design', 'Sorting', 'Ordered Set']",False,False
51.90323442929699,Hard,1349,False,False,Maximum Students Taking Exam,maximum-students-taking-exam,"['Array', 'Dynamic Programming', 'Bit Manipulation', 'Matrix', 'Bitmask']",False,False
89.8953488372093,Easy,1350,False,True,Students With Invalid Departments,students-with-invalid-departments,['Database'],False,False
77.61902604463315,Easy,1351,False,False,Count Negative Numbers in a Sorted Matrix,count-negative-numbers-in-a-sorted-matrix,"['Array', 'Binary Search', 'Matrix']",True,False
62.86754684181021,Medium,1352,False,False,Product of the Last K Numbers,product-of-the-last-k-numbers,"['Array', 'Math', 'Design', 'Data Stream', 'Prefix Sum']",True,False
32.81473144618993,Medium,1353,False,False,Maximum Number of Events That Can Be Attended,maximum-number-of-events-that-can-be-attended,"['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",False,False
36.235370747799045,Hard,1354,False,False,Construct Target Array With Multiple Sums,construct-target-array-with-multiple-sums,"['Array', 'Heap (Priority Queue)']",True,False
72.37542008858027,Medium,1355,False,True,Activity Participants,activity-participants,['Database'],True,False
78.59453784854222,Easy,1356,False,False,Sort Integers by The Number of 1 Bits,sort-integers-by-the-number-of-1-bits,"['Array', 'Bit Manipulation', 'Sorting', 'Counting']",True,False
71.55301892460199,Medium,1357,False,False,Apply Discount Every n Orders,apply-discount-every-n-orders,"['Array', 'Hash Table', 'Design']",False,False
72.96306600820756,Medium,1358,False,False,Number of Substrings Containing All Three Characters,number-of-substrings-containing-all-three-characters,"['Hash Table', 'String', 'Sliding Window']",True,False
64.87117087734264,Hard,1359,False,False,Count All Valid Pickup and Delivery Options,count-all-valid-pickup-and-delivery-options,"['Math', 'Dynamic Programming', 'Combinatorics']",True,False
51.10280312801005,Easy,1360,False,False,Number of Days Between Two Dates,number-of-days-between-two-dates,"['Math', 'String']",False,False
43.85955026501611,Medium,1361,False,False,Validate Binary Tree Nodes,validate-binary-tree-nodes,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph', 'Binary Tree']",True,False
61.16167664670659,Medium,1362,False,False,Closest Divisors,closest-divisors,['Math'],False,False
32.68919973250111,Hard,1363,False,False,Largest Multiple of Three,largest-multiple-of-three,"['Array', 'Math', 'Dynamic Programming', 'Greedy', 'Sorting']",False,False
75.22150624244865,Medium,1364,False,True,Number of Trusted Contacts of a Customer,number-of-trusted-contacts-of-a-customer,['Database'],True,False
87.06603907388089,Easy,1365,False,False,How Many Numbers Are Smaller Than the Current Number,how-many-numbers-are-smaller-than-the-current-number,"['Array', 'Hash Table', 'Sorting', 'Counting Sort']",False,False
59.18462396274066,Medium,1366,False,False,Rank Teams by Votes,rank-teams-by-votes,"['Array', 'Hash Table', 'String', 'Sorting', 'Counting']",False,False
51.94580228750415,Medium,1367,False,False,Linked List in Binary Tree,linked-list-in-binary-tree,"['Linked List', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
70.6825249863495,Hard,1368,False,False,Minimum Cost to Make at Least One Valid Path in a Grid,minimum-cost-to-make-at-least-one-valid-path-in-a-grid,"['Array', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']",True,False
67.5004946437152,Hard,1369,False,True,Get the Second Most Recent Activity,get-the-second-most-recent-activity,['Database'],False,False
76.55631678956819,Easy,1370,False,False,Increasing Decreasing String,increasing-decreasing-string,"['Hash Table', 'String', 'Counting']",False,False
75.79312997827661,Medium,1371,False,False,Find the Longest Substring Containing Vowels in Even Counts,find-the-longest-substring-containing-vowels-in-even-counts,"['Hash Table', 'String', 'Bit Manipulation', 'Prefix Sum']",True,False
66.41505621545167,Medium,1372,False,False,Longest ZigZag Path in a Binary Tree,longest-zigzag-path-in-a-binary-tree,"['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
43.49029829670406,Hard,1373,False,False,Maximum Sum BST in Binary Tree,maximum-sum-bst-in-binary-tree,"['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",False,False
77.96960704972574,Easy,1374,False,False,Generate a String With Characters That Have Odd Counts,generate-a-string-with-characters-that-have-odd-counts,['String'],False,False
65.67898077325461,Medium,1375,False,False,Number of Times Binary String Is Prefix-Aligned,number-of-times-binary-string-is-prefix-aligned,['Array'],False,False
60.17653876716419,Medium,1376,False,False,Time Needed to Inform All Employees,time-needed-to-inform-all-employees,"['Tree', 'Depth-First Search', 'Breadth-First Search']",True,False
35.692124350202384,Hard,1377,False,False,Frog Position After T Seconds,frog-position-after-t-seconds,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Graph']",False,False
83.60829368013094,Easy,1378,False,False,Replace Employee ID With The Unique Identifier,replace-employee-id-with-the-unique-identifier,['Database'],True,False
85.73341687437173,Easy,1379,False,False,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,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
79.88002762209886,Easy,1380,False,False,Lucky Numbers in a Matrix,lucky-numbers-in-a-matrix,"['Array', 'Matrix']",True,False
80.45134105826108,Medium,1381,False,False,Design a Stack With Increment Operation,design-a-stack-with-increment-operation,"['Array', 'Stack', 'Design']",True,False
84.62726170249627,Medium,1382,False,False,Balance a Binary Search Tree,balance-a-binary-search-tree,"['Divide and Conquer', 'Greedy', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",True,False
47.505864689875196,Hard,1383,False,False,Maximum Performance of a Team,maximum-performance-of-a-team,"['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",True,False
61.43967443877381,Hard,1384,False,True,Total Sales Amount by Year,total-sales-amount-by-year,['Database'],False,False
69.91572004397216,Easy,1385,False,False,Find the Distance Value Between Two Arrays,find-the-distance-value-between-two-arrays,"['Array', 'Two Pointers', 'Binary Search', 'Sorting']",False,False
42.55003120778061,Medium,1386,False,False,Cinema Seat Allocation,cinema-seat-allocation,"['Array', 'Hash Table', 'Greedy', 'Bit Manipulation']",False,False
70.6345092738999,Medium,1387,False,False,Sort Integers by The Power Value,sort-integers-by-the-power-value,"['Dynamic Programming', 'Memoization', 'Sorting']",False,False
52.695347387223435,Hard,1388,False,False,Pizza With 3n Slices,pizza-with-3n-slices,"['Array', 'Dynamic Programming', 'Greedy', 'Heap (Priority Queue)']",False,False
86.17621440948444,Easy,1389,False,False,Create Target Array in the Given Order,create-target-array-in-the-given-order,"['Array', 'Simulation']",False,False
44.502941146692855,Medium,1390,False,False,Four Divisors,four-divisors,"['Array', 'Math']",False,False
48.69979497617889,Medium,1391,False,False,Check if There is a Valid Path in a Grid,check-if-there-is-a-valid-path-in-a-grid,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']",False,False
48.352933932639615,Hard,1392,False,False,Longest Happy Prefix,longest-happy-prefix,"['String', 'Rolling Hash', 'String Matching', 'Hash Function']",False,False
84.99085389090725,Medium,1393,False,False,Capital Gain/Loss,capital-gainloss,['Database'],True,False
68.96037629828345,Easy,1394,False,False,Find Lucky Integer in an Array,find-lucky-integer-in-an-array,"['Array', 'Hash Table', 'Counting']",True,False
70.07411954549737,Medium,1395,False,False,Count Number of Teams,count-number-of-teams,"['Array', 'Dynamic Programming', 'Binary Indexed Tree', 'Segment Tree']",True,False
74.85156501118948,Medium,1396,False,False,Design Underground System,design-underground-system,"['Hash Table', 'String', 'Design']",True,False
43.31904947409427,Hard,1397,False,False,Find All Good Strings,find-all-good-strings,"['String', 'Dynamic Programming', 'String Matching']",False,False
72.07907102096296,Medium,1398,False,True,Customers Who Bought Products A and B but Not C,customers-who-bought-products-a-and-b-but-not-c,['Database'],True,False
66.50881674870709,Easy,1399,False,False,Count Largest Group,count-largest-group,"['Hash Table', 'Math']",False,False
68.73353868130887,Medium,1400,False,False,Construct K Palindrome Strings,construct-k-palindrome-strings,"['Hash Table', 'String', 'Greedy', 'Counting']",True,False
48.61926208998681,Medium,1401,False,False,Circle and Rectangle Overlapping,circle-and-rectangle-overlapping,"['Math', 'Geometry']",False,False
76.27332814930016,Hard,1402,False,False,Reducing Dishes,reducing-dishes,"['Array', 'Dynamic Programming', 'Greedy', 'Sorting']",True,False
72.80011472206786,Easy,1403,False,False,Minimum Subsequence in Non-Increasing Order,minimum-subsequence-in-non-increasing-order,"['Array', 'Greedy', 'Sorting']",False,False
61.39011099899092,Medium,1404,False,False,Number of Steps to Reduce a Number in Binary Representation to One,number-of-steps-to-reduce-a-number-in-binary-representation-to-one,"['String', 'Bit Manipulation']",True,False
65.46616889123827,Medium,1405,False,False,Longest Happy String,longest-happy-string,"['String', 'Greedy', 'Heap (Priority Queue)']",True,False
63.215464042527394,Hard,1406,False,False,Stone Game III,stone-game-iii,"['Array', 'Math', 'Dynamic Programming', 'Game Theory']",True,False
57.1403385683703,Easy,1407,False,False,Top Travellers,top-travellers,['Database'],True,False
69.84786827107108,Easy,1408,False,False,String Matching in an Array,string-matching-in-an-array,"['Array', 'String', 'String Matching']",True,False
84.46119555459245,Medium,1409,False,False,Queries on a Permutation With Key,queries-on-a-permutation-with-key,"['Array', 'Binary Indexed Tree', 'Simulation']",False,False
50.232061883168846,Medium,1410,False,False,HTML Entity Parser,html-entity-parser,"['Hash Table', 'String']",False,False
64.18278281704603,Hard,1411,False,False,Number of Ways to Paint N × 3 Grid,number-of-ways-to-paint-n-3-grid,['Dynamic Programming'],False,False
58.56045635882331,Hard,1412,False,True,Find the Quiet Students in All Exams,find-the-quiet-students-in-all-exams,['Database'],False,False
64.83611547210919,Easy,1413,False,False,Minimum Value to Get Positive Step by Step Sum,minimum-value-to-get-positive-step-by-step-sum,"['Array', 'Prefix Sum']",True,False
64.23264814539155,Medium,1414,False,False,Find the Minimum Number of Fibonacci Numbers Whose Sum Is K,find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k,"['Math', 'Greedy']",False,False
85.08268494658627,Medium,1415,False,False,The k-th Lexicographical String of All Happy Strings of Length n,the-k-th-lexicographical-string-of-all-happy-strings-of-length-n,"['String', 'Backtracking']",True,False
46.99316050415148,Hard,1416,False,False,Restore The Array,restore-the-array,"['String', 'Dynamic Programming']",True,False
52.01729684629394,Easy,1417,False,False,Reformat The String,reformat-the-string,['String'],False,False
75.51335635108123,Medium,1418,False,False,Display Table of Food Orders in a Restaurant,display-table-of-food-orders-in-a-restaurant,"['Array', 'Hash Table', 'String', 'Sorting', 'Ordered Set']",False,False
50.66663111300731,Medium,1419,False,False,Minimum Number of Frogs Croaking,minimum-number-of-frogs-croaking,"['String', 'Counting']",False,False
66.98828734519742,Hard,1420,False,False,Build Array Where You Can Find The Maximum Exactly K Comparisons,build-array-where-you-can-find-the-maximum-exactly-k-comparisons,"['Dynamic Programming', 'Prefix Sum']",True,False
82.98077468383144,Easy,1421,False,True,NPV Queries,npv-queries,['Database'],True,False
65.16158455905124,Easy,1422,False,False,Maximum Score After Splitting a String,maximum-score-after-splitting-a-string,"['String', 'Prefix Sum']",True,False
55.099014843658026,Medium,1423,False,False,Maximum Points You Can Obtain from Cards,maximum-points-you-can-obtain-from-cards,"['Array', 'Sliding Window', 'Prefix Sum']",True,False
57.819090318435215,Medium,1424,False,False,Diagonal Traverse II,diagonal-traverse-ii,"['Array', 'Sorting', 'Heap (Priority Queue)']",True,False
56.40187198270363,Hard,1425,False,False,Constrained Subsequence Sum,constrained-subsequence-sum,"['Array', 'Dynamic Programming', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Monotonic Queue']",True,False
60.40309580207922,Easy,1426,False,True,Counting Elements,counting-elements,"['Array', 'Hash Table']",True,False
55.79502591309148,Easy,1427,False,True,Perform String Shifts,perform-string-shifts,"['Array', 'Math', 'String']",True,False
54.88763353270782,Medium,1428,False,True,Leftmost Column with at Least a One,leftmost-column-with-at-least-a-one,"['Array', 'Binary Search', 'Matrix', 'Interactive']",True,False
55.14997528195813,Medium,1429,False,True,First Unique Number,first-unique-number,"['Array', 'Hash Table', 'Design', 'Queue', 'Data Stream']",True,False
47.229945636386276,Medium,1430,False,True,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,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",False,False
88.05728676631837,Easy,1431,False,False,Kids With the Greatest Number of Candies,kids-with-the-greatest-number-of-candies,['Array'],True,False
40.2500146264407,Medium,1432,False,False,Max Difference You Can Get From Changing an Integer,max-difference-you-can-get-from-changing-an-integer,"['Math', 'Greedy']",False,False
70.12022527648895,Medium,1433,False,False,Check If a String Can Break Another String,check-if-a-string-can-break-another-string,"['String', 'Greedy', 'Sorting']",False,False
44.17207585592465,Hard,1434,False,False,Number of Ways to Wear Different Hats to Each Other,number-of-ways-to-wear-different-hats-to-each-other,"['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']",True,False
75.00372811595932,Easy,1435,False,True,Create a Session Bar Chart,create-a-session-bar-chart,['Database'],False,False
79.42815069986018,Easy,1436,False,False,Destination City,destination-city,"['Array', 'Hash Table', 'String']",True,False
58.01573748535075,Easy,1437,False,False,Check If All 1's Are at Least Length K Places Away,check-if-all-1s-are-at-least-length-k-places-away,['Array'],True,False
56.61745919706227,Medium,1438,False,False,Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit,longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit,"['Array', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Ordered Set', 'Monotonic Queue']",True,False
61.87447326156439,Hard,1439,False,False,Find the Kth Smallest Sum of a Matrix With Sorted Rows,find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows,"['Array', 'Binary Search', 'Heap (Priority Queue)', 'Matrix']",False,False
72.28075319942191,Medium,1440,False,True,Evaluate Boolean Expression,evaluate-boolean-expression,['Database'],False,False
80.10155040139554,Medium,1441,False,False,Build an Array With Stack Operations,build-an-array-with-stack-operations,"['Array', 'Stack', 'Simulation']",True,False
84.79619617316615,Medium,1442,False,False,Count Triplets That Can Form Two Arrays of Equal XOR,count-triplets-that-can-form-two-arrays-of-equal-xor,"['Array', 'Hash Table', 'Math', 'Bit Manipulation', 'Prefix Sum']",True,False
62.81220924455525,Medium,1443,False,False,Minimum Time to Collect All Apples in a Tree,minimum-time-to-collect-all-apples-in-a-tree,"['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search']",True,False
61.65058931276801,Hard,1444,False,False,Number of Ways of Cutting a Pizza,number-of-ways-of-cutting-a-pizza,"['Array', 'Dynamic Programming', 'Memoization', 'Matrix', 'Prefix Sum']",True,False
86.0676916049277,Medium,1445,False,True,Apples & Oranges,apples-oranges,['Database'],True,False
60.07180667720996,Easy,1446,False,False,Consecutive Characters,consecutive-characters,['String'],True,False
68.00652963788593,Medium,1447,False,False,Simplified Fractions,simplified-fractions,"['Math', 'String', 'Number Theory']",False,False
73.36037156590622,Medium,1448,False,False,Count Good Nodes in Binary Tree,count-good-nodes-in-binary-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,True
48.50306404079151,Hard,1449,False,False,Form Largest Integer With Digits That Add up to Target,form-largest-integer-with-digits-that-add-up-to-target,"['Array', 'Dynamic Programming']",False,False
75.6368614757006,Easy,1450,False,False,Number of Students Doing Homework at a Given Time,number-of-students-doing-homework-at-a-given-time,['Array'],False,False
65.60502321990212,Medium,1451,False,False,Rearrange Words in a Sentence,rearrange-words-in-a-sentence,"['String', 'Sorting']",False,False
58.98186533587442,Medium,1452,False,False,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,"['Array', 'Hash Table', 'String']",False,False
37.725812397956496,Hard,1453,False,False,Maximum Number of Darts Inside of a Circular Dartboard,maximum-number-of-darts-inside-of-a-circular-dartboard,"['Array', 'Math', 'Geometry']",False,False
36.63401572668113,Medium,1454,False,True,Active Users,active-users,['Database'],False,False
68.75662082514735,Easy,1455,False,False,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,"['Two Pointers', 'String', 'String Matching']",True,False
60.03241537340108,Medium,1456,False,False,Maximum Number of Vowels in a Substring of Given Length,maximum-number-of-vowels-in-a-substring-of-given-length,"['String', 'Sliding Window']",True,False
68.31322366977057,Medium,1457,False,False,Pseudo-Palindromic Paths in a Binary Tree,pseudo-palindromic-paths-in-a-binary-tree,"['Bit Manipulation', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
62.31143144485417,Hard,1458,False,False,Max Dot Product of Two Subsequences,max-dot-product-of-two-subsequences,"['Array', 'Dynamic Programming']",True,False
68.65573290379265,Medium,1459,False,True,Rectangles Area,rectangles-area,['Database'],False,False
75.80977971680282,Easy,1460,False,False,Make Two Arrays Equal by Reversing Subarrays,make-two-arrays-equal-by-reversing-subarrays,"['Array', 'Hash Table', 'Sorting']",True,False
56.56935717322865,Medium,1461,False,False,Check If a String Contains All Binary Codes of Size K,check-if-a-string-contains-all-binary-codes-of-size-k,"['Hash Table', 'String', 'Bit Manipulation', 'Rolling Hash', 'Hash Function']",True,False
59.550477129958836,Medium,1462,False,False,Course Schedule IV,course-schedule-iv,"['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']",True,False
71.85263546250947,Hard,1463,False,False,Cherry Pickup II,cherry-pickup-ii,"['Array', 'Dynamic Programming', 'Matrix']",True,False
83.12536443148689,Easy,1464,False,False,Maximum Product of Two Elements in an Array,maximum-product-of-two-elements-in-an-array,"['Array', 'Sorting', 'Heap (Priority Queue)']",True,False
41.180140169537474,Medium,1465,False,False,Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts,maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts,"['Array', 'Greedy', 'Sorting']",True,False
64.79446046029295,Medium,1466,False,False,Reorder Routes to Make All Paths Lead to the City Zero,reorder-routes-to-make-all-paths-lead-to-the-city-zero,"['Depth-First Search', 'Breadth-First Search', 'Graph']",True,False
59.922672627318306,Hard,1467,False,False,Probability of a Two Boxes Having The Same Number of Distinct Balls,probability-of-a-two-boxes-having-the-same-number-of-distinct-balls,"['Array', 'Math', 'Dynamic Programming', 'Backtracking', 'Combinatorics', 'Probability and Statistics']",False,False
78.15230600081013,Medium,1468,False,True,Calculate Salaries,calculate-salaries,['Database'],False,False
83.96477282475053,Easy,1469,False,True,Find All The Lonely Nodes,find-all-the-lonely-nodes,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
88.79938735249404,Easy,1470,False,False,Shuffle the Array,shuffle-the-array,['Array'],True,False
61.729825221911696,Medium,1471,False,False,The k Strongest Values in an Array,the-k-strongest-values-in-an-array,"['Array', 'Two Pointers', 'Sorting']",False,False
77.99224709955993,Medium,1472,False,False,Design Browser History,design-browser-history,"['Array', 'Linked List', 'Stack', 'Design', 'Doubly-Linked List', 'Data Stream']",True,False
60.97425330950731,Hard,1473,False,False,Paint House III,paint-house-iii,"['Array', 'Dynamic Programming']",True,False
73.48921893539544,Easy,1474,False,True,Delete N Nodes After M Nodes of a Linked List,delete-n-nodes-after-m-nodes-of-a-linked-list,['Linked List'],True,False
83.1919330726308,Easy,1475,False,False,Final Prices With a Special Discount in a Shop,final-prices-with-a-special-discount-in-a-shop,"['Array', 'Stack', 'Monotonic Stack']",True,False
88.31378504500653,Medium,1476,False,False,Subrectangle Queries,subrectangle-queries,"['Array', 'Design', 'Matrix']",False,False
36.440413109258024,Medium,1477,False,False,Find Two Non-overlapping Sub-arrays Each With Target Sum,find-two-non-overlapping-sub-arrays-each-with-target-sum,"['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming', 'Sliding Window']",False,False
55.68803159173754,Hard,1478,False,False,Allocate Mailboxes,allocate-mailboxes,"['Array', 'Math', 'Dynamic Programming', 'Sorting']",False,False
77.3265451101113,Hard,1479,False,True,Sales by Day of the Week,sales-by-day-of-the-week,['Database'],True,False
86.95709435231981,Easy,1480,False,False,Running Sum of 1d Array,running-sum-of-1d-array,"['Array', 'Prefix Sum']",True,True
63.31519254736092,Medium,1481,False,False,Least Number of Unique Integers after K Removals,least-number-of-unique-integers-after-k-removals,"['Array', 'Hash Table', 'Greedy', 'Sorting', 'Counting']",True,False
55.31603083069806,Medium,1482,False,False,Minimum Number of Days to Make m Bouquets,minimum-number-of-days-to-make-m-bouquets,"['Array', 'Binary Search']",True,False
35.459700283515595,Hard,1483,False,False,Kth Ancestor of a Tree Node,kth-ancestor-of-a-tree-node,"['Binary Search', 'Dynamic Programming', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Design']",False,False
77.61092185323373,Easy,1484,False,False,Group Sold Products By The Date,group-sold-products-by-the-date,['Database'],True,False
80.82713493341512,Medium,1485,False,True,Clone Binary Tree With Random Pointer,clone-binary-tree-with-random-pointer,"['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
86.69244026270437,Easy,1486,False,False,XOR Operation in an Array,xor-operation-in-an-array,"['Math', 'Bit Manipulation']",False,False
37.7278042823583,Medium,1487,False,False,Making File Names Unique,making-file-names-unique,"['Array', 'Hash Table', 'String']",False,False
27.2510667349377,Medium,1488,False,False,Avoid Flood in The City,avoid-flood-in-the-city,"['Array', 'Hash Table', 'Binary Search', 'Greedy', 'Heap (Priority Queue)']",False,False
66.48642192470982,Hard,1489,False,False,Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree,find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree,"['Union Find', 'Graph', 'Sorting', 'Minimum Spanning Tree', 'Strongly Connected Component']",True,False
83.16790521228499,Medium,1490,False,True,Clone N-ary Tree,clone-n-ary-tree,"['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search']",True,False
63.44207248116638,Easy,1491,False,False,Average Salary Excluding the Minimum and Maximum Salary,average-salary-excluding-the-minimum-and-maximum-salary,"['Array', 'Sorting']",True,False
69.39674229076329,Medium,1492,False,False,The kth Factor of n,the-kth-factor-of-n,"['Math', 'Number Theory']",False,False
68.93277701140823,Medium,1493,False,False,Longest Subarray of 1's After Deleting One Element,longest-subarray-of-1s-after-deleting-one-element,"['Array', 'Dynamic Programming', 'Sliding Window']",True,False
29.467250328648674,Hard,1494,False,False,Parallel Courses II,parallel-courses-ii,"['Dynamic Programming', 'Bit Manipulation', 'Graph', 'Bitmask']",False,False
48.966330372335435,Easy,1495,False,True,Friendly Movies Streamed Last Month,friendly-movies-streamed-last-month,['Database'],True,False
62.519439042294486,Easy,1496,False,False,Path Crossing,path-crossing,"['Hash Table', 'String']",True,False
46.20273897704322,Medium,1497,False,False,Check If Array Pairs Are Divisible by k,check-if-array-pairs-are-divisible-by-k,"['Array', 'Hash Table', 'Counting']",True,False
43.788617226209915,Medium,1498,False,False,Number of Subsequences That Satisfy the Given Sum Condition,number-of-subsequences-that-satisfy-the-given-sum-condition,"['Array', 'Two Pointers', 'Binary Search', 'Sorting']",True,False
44.43163497824892,Hard,1499,False,False,Max Value of Equation,max-value-of-equation,"['Array', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Monotonic Queue']",False,False
41.66867035345035,Medium,1500,False,True,Design a File Sharing System,design-a-file-sharing-system,"['Hash Table', 'Design', 'Sorting', 'Heap (Priority Queue)', 'Data Stream']",False,False
50.434547968923916,Medium,1501,False,True,Countries You Can Safely Invest In,countries-you-can-safely-invest-in,['Database'],False,False
69.41492825459086,Easy,1502,False,False,Can Make Arithmetic Progression From Sequence,can-make-arithmetic-progression-from-sequence,"['Array', 'Sorting']",True,False
68.19733485376783,Medium,1503,False,False,Last Moment Before All Ants Fall Out of a Plank,last-moment-before-all-ants-fall-out-of-a-plank,"['Array', 'Brainteaser', 'Simulation']",True,False
57.173353986079256,Medium,1504,False,False,Count Submatrices With All Ones,count-submatrices-with-all-ones,"['Array', 'Dynamic Programming', 'Stack', 'Matrix', 'Monotonic Stack']",False,False
39.77927396404525,Hard,1505,False,False,Minimum Possible Integer After at Most K Adjacent Swaps On Digits,minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits,"['String', 'Greedy', 'Binary Indexed Tree', 'Segment Tree']",False,False
78.39535606924433,Medium,1506,False,True,Find Root of N-Ary Tree,find-root-of-n-ary-tree,"['Hash Table', 'Bit Manipulation', 'Tree', 'Depth-First Search']",True,False
67.18510181111225,Easy,1507,False,False,Reformat Date,reformat-date,['String'],False,False
63.12258265420587,Medium,1508,False,False,Range Sum of Sorted Subarray Sums,range-sum-of-sorted-subarray-sums,"['Array', 'Two Pointers', 'Binary Search', 'Sorting', 'Prefix Sum']",True,False
59.17458482772688,Medium,1509,False,False,Minimum Difference Between Largest and Smallest Value in Three Moves,minimum-difference-between-largest-and-smallest-value-in-three-moves,"['Array', 'Greedy', 'Sorting']",True,False
59.45447227938552,Hard,1510,False,False,Stone Game IV,stone-game-iv,"['Math', 'Dynamic Programming', 'Game Theory']",True,False
66.98347853877472,Easy,1511,False,True,Customer Order Frequency,customer-order-frequency,['Database'],True,False
89.52064872127812,Easy,1512,False,False,Number of Good Pairs,number-of-good-pairs,"['Array', 'Hash Table', 'Math', 'Counting']",True,False
47.609333751776845,Medium,1513,False,False,Number of Substrings With Only 1s,number-of-substrings-with-only-1s,"['Math', 'String']",False,False
65.29072837306998,Medium,1514,False,False,Path with Maximum Probability,path-with-maximum-probability,"['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path']",True,False
34.75273875100576,Hard,1515,False,False,Best Position for a Service Centre,best-position-for-a-service-centre,"['Array', 'Math', 'Geometry', 'Randomized']",False,False
60.10794896957802,Hard,1516,False,True,Move Sub-Tree of N-Ary Tree,move-sub-tree-of-n-ary-tree,"['Tree', 'Depth-First Search']",False,False
44.24548685208765,Easy,1517,False,False,Find Users With Valid E-Mails,find-users-with-valid-e-mails,['Database'],True,False
70.811170395538,Easy,1518,False,False,Water Bottles,water-bottles,"['Math', 'Simulation']",True,False
54.98029056624924,Medium,1519,False,False,Number of Nodes in the Sub-Tree With the Same Label,number-of-nodes-in-the-sub-tree-with-the-same-label,"['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Counting']",True,False
39.554744095647564,Hard,1520,False,False,Maximum Number of Non-Overlapping Substrings,maximum-number-of-non-overlapping-substrings,"['String', 'Greedy']",False,False
45.53688878866463,Hard,1521,False,False,Find a Value of a Mysterious Function Closest to Target,find-a-value-of-a-mysterious-function-closest-to-target,"['Array', 'Binary Search', 'Bit Manipulation', 'Segment Tree']",False,False
74.92134649401153,Medium,1522,False,True,Diameter of N-Ary Tree,diameter-of-n-ary-tree,"['Tree', 'Depth-First Search']",True,False
50.302352449546476,Easy,1523,False,False,Count Odd Numbers in an Interval Range,count-odd-numbers-in-an-interval-range,['Math'],True,False
56.0823508122329,Medium,1524,False,False,Number of Sub-arrays With Odd Sum,number-of-sub-arrays-with-odd-sum,"['Array', 'Math', 'Dynamic Programming', 'Prefix Sum']",True,False
68.29386785662876,Medium,1525,False,False,Number of Good Ways to Split a String,number-of-good-ways-to-split-a-string,"['Hash Table', 'String', 'Dynamic Programming', 'Bit Manipulation']",False,False
72.03167172235891,Hard,1526,False,False,Minimum Number of Increments on Subarrays to Form a Target Array,minimum-number-of-increments-on-subarrays-to-form-a-target-array,"['Array', 'Dynamic Programming', 'Stack', 'Greedy', 'Monotonic Stack']",False,False
39.3713420971065,Easy,1527,False,False,Patients With a Condition,patients-with-a-condition,['Database'],True,False
85.05705077954882,Easy,1528,False,False,Shuffle String,shuffle-string,"['Array', 'String']",False,False
73.39333977424207,Medium,1529,False,False,Minimum Suffix Flips,minimum-suffix-flips,"['String', 'Greedy']",False,False
71.77530594710076,Medium,1530,False,False,Number of Good Leaf Nodes Pairs,number-of-good-leaf-nodes-pairs,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
52.00560224089635,Hard,1531,False,False,String Compression II,string-compression-ii,"['String', 'Dynamic Programming']",True,False
68.9265312599175,Medium,1532,False,True,The Most Recent Three Orders,the-most-recent-three-orders,['Database'],False,False
56.21693585117191,Medium,1533,False,True,Find the Index of the Large Integer,find-the-index-of-the-large-integer,"['Array', 'Binary Search', 'Interactive']",True,False
81.81569787471638,Easy,1534,False,False,Count Good Triplets,count-good-triplets,"['Array', 'Enumeration']",True,False
56.74697995486526,Medium,1535,False,False,Find the Winner of an Array Game,find-the-winner-of-an-array-game,"['Array', 'Simulation']",True,False
47.7041760368926,Medium,1536,False,False,Minimum Swaps to Arrange a Binary Grid,minimum-swaps-to-arrange-a-binary-grid,"['Array', 'Greedy', 'Matrix']",False,False
39.83385361574779,Hard,1537,False,False,Get the Maximum Score,get-the-maximum-score,"['Array', 'Two Pointers', 'Dynamic Programming', 'Greedy']",False,False
69.4526191877575,Medium,1538,False,True,Guess the Majority in a Hidden Array,guess-the-majority-in-a-hidden-array,"['Array', 'Math', 'Interactive']",True,False
61.963421226864924,Easy,1539,False,False,Kth Missing Positive Number,kth-missing-positive-number,"['Array', 'Binary Search']",True,False
35.75004814172925,Medium,1540,False,False,Can Convert String in K Moves,can-convert-string-in-k-moves,"['Hash Table', 'String']",False,False
53.04633764592697,Medium,1541,False,False,Minimum Insertions to Balance a Parentheses String,minimum-insertions-to-balance-a-parentheses-string,"['String', 'Stack', 'Greedy']",False,False
44.93529442336677,Hard,1542,False,False,Find Longest Awesome Substring,find-longest-awesome-substring,"['Hash Table', 'String', 'Bit Manipulation']",False,False
58.97775774767371,Easy,1543,False,True,Fix Product Name Format,fix-product-name-format,['Database'],False,False
68.20891688487947,Easy,1544,False,False,Make The String Great,make-the-string-great,"['String', 'Stack']",True,False
70.1867619995245,Medium,1545,False,False,Find Kth Bit in Nth Binary String,find-kth-bit-in-nth-binary-string,"['String', 'Recursion', 'Simulation']",True,False
47.83102602162915,Medium,1546,False,False,Maximum Number of Non-Overlapping Subarrays With Sum Equals Target,maximum-number-of-non-overlapping-subarrays-with-sum-equals-target,"['Array', 'Hash Table', 'Greedy', 'Prefix Sum']",False,False
61.79400736309598,Hard,1547,False,False,Minimum Cost to Cut a Stick,minimum-cost-to-cut-a-stick,"['Array', 'Dynamic Programming', 'Sorting']",True,False
59.27714074968149,Hard,1548,False,True,The Most Similar Path in a Graph,the-most-similar-path-in-a-graph,"['Dynamic Programming', 'Graph']",True,False
64.81993424985056,Medium,1549,False,True,The Most Recent Orders for Each Product,the-most-recent-orders-for-each-product,['Database'],True,False
68.04449349255025,Easy,1550,False,False,Three Consecutive Odds,three-consecutive-odds,['Array'],True,False
82.20548492107365,Medium,1551,False,False,Minimum Operations to Make Array Equal,minimum-operations-to-make-array-equal,['Math'],True,False
71.16645974596506,Medium,1552,False,False,Magnetic Force Between Two Balls,magnetic-force-between-two-balls,"['Array', 'Binary Search', 'Sorting']",True,False
35.56104663989763,Hard,1553,False,False,Minimum Number of Days to Eat N Oranges,minimum-number-of-days-to-eat-n-oranges,"['Dynamic Programming', 'Memoization']",False,False
41.195438458513564,Medium,1554,False,True,Strings Differ by One Character,strings-differ-by-one-character,"['Hash Table', 'String', 'Rolling Hash', 'Hash Function']",False,False
51.85062620914367,Medium,1555,False,True,Bank Account Summary,bank-account-summary,['Database'],False,False
53.50969702386272,Easy,1556,False,False,Thousand Separator,thousand-separator,['String'],False,False
81.06463787311795,Medium,1557,False,False,Minimum Number of Vertices to Reach All Nodes,minimum-number-of-vertices-to-reach-all-nodes,['Graph'],True,False
62.47497101907472,Medium,1558,False,False,Minimum Numbers of Function Calls to Make Target Array,minimum-numbers-of-function-calls-to-make-target-array,"['Array', 'Greedy', 'Bit Manipulation']",False,False
49.786646708332924,Medium,1559,False,False,Detect Cycles in 2D Grid,detect-cycles-in-2d-grid,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']",False,False
58.95420537696292,Easy,1560,False,False,Most Visited Sector in  a Circular Track,most-visited-sector-in-a-circular-track,"['Array', 'Simulation']",False,False
84.40547909268923,Medium,1561,False,False,Maximum Number of Coins You Can Get,maximum-number-of-coins-you-can-get,"['Array', 'Math', 'Greedy', 'Sorting', 'Game Theory']",True,False
42.87035642840242,Medium,1562,False,False,Find Latest Group of Size M,find-latest-group-of-size-m,"['Array', 'Hash Table', 'Binary Search', 'Simulation']",False,False
41.01103595585618,Hard,1563,False,False,Stone Game V,stone-game-v,"['Array', 'Math', 'Dynamic Programming', 'Game Theory']",False,False
67.12511788745678,Medium,1564,False,True,Put Boxes Into the Warehouse I,put-boxes-into-the-warehouse-i,"['Array', 'Greedy', 'Sorting']",True,False
82.16682646212847,Easy,1565,False,True,Unique Orders and Customers Per Month,unique-orders-and-customers-per-month,['Database'],False,False
43.40314589238192,Easy,1566,False,False,Detect Pattern of Length M Repeated K or More Times,detect-pattern-of-length-m-repeated-k-or-more-times,"['Array', 'Enumeration']",False,False
44.335835600608824,Medium,1567,False,False,Maximum Length of Subarray With Positive Product,maximum-length-of-subarray-with-positive-product,"['Array', 'Dynamic Programming', 'Greedy']",False,False
59.166530745392265,Hard,1568,False,False,Minimum Number of Days to Disconnect Island,minimum-number-of-days-to-disconnect-island,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix', 'Strongly Connected Component']",True,False
53.48380943730414,Hard,1569,False,False,Number of Ways to Reorder Array to Get Same BST,number-of-ways-to-reorder-array-to-get-same-bst,"['Array', 'Math', 'Divide and Conquer', 'Dynamic Programming', 'Tree', 'Union Find', 'Binary Search Tree', 'Memoization', 'Combinatorics', 'Binary Tree']",True,False
89.9274072674441,Medium,1570,False,True,Dot Product of Two Sparse Vectors,dot-product-of-two-sparse-vectors,"['Array', 'Hash Table', 'Two Pointers', 'Design']",True,False
87.48091041233509,Easy,1571,False,True,Warehouse Manager,warehouse-manager,['Database'],True,False
83.59156269803744,Easy,1572,False,False,Matrix Diagonal Sum,matrix-diagonal-sum,"['Array', 'Matrix']",True,False
33.71851760548913,Medium,1573,False,False,Number of Ways to Split a String,number-of-ways-to-split-a-string,"['Math', 'String']",False,False
51.530491906388406,Medium,1574,False,False,Shortest Subarray to be Removed to Make Array Sorted,shortest-subarray-to-be-removed-to-make-array-sorted,"['Array', 'Two Pointers', 'Binary Search', 'Stack', 'Monotonic Stack']",True,False
64.94913824909081,Hard,1575,False,False,Count All Possible Routes,count-all-possible-routes,"['Array', 'Dynamic Programming', 'Memoization']",True,False
45.21030089308635,Easy,1576,False,False,Replace All ?'s to Avoid Consecutive Repeating Characters,replace-all-s-to-avoid-consecutive-repeating-characters,['String'],False,False
41.78097992937126,Medium,1577,False,False,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,"['Array', 'Hash Table', 'Math', 'Two Pointers']",False,False
63.47043630147168,Medium,1578,False,False,Minimum Time to Make Rope Colorful,minimum-time-to-make-rope-colorful,"['Array', 'String', 'Dynamic Programming', 'Greedy']",True,False
70.46867317098419,Hard,1579,False,False,Remove Max Number of Edges to Keep Graph Fully Traversable,remove-max-number-of-edges-to-keep-graph-fully-traversable,"['Union Find', 'Graph']",True,False
65.50262269167206,Medium,1580,False,True,Put Boxes Into the Warehouse II,put-boxes-into-the-warehouse-ii,"['Array', 'Greedy', 'Sorting']",True,False
67.45725991367682,Easy,1581,False,False,Customer Who Visited but Did Not Make Any Transactions,customer-who-visited-but-did-not-make-any-transactions,['Database'],True,False
68.66420378919995,Easy,1582,False,False,Special Positions in a Binary Matrix,special-positions-in-a-binary-matrix,"['Array', 'Matrix']",True,False
61.88972981451708,Medium,1583,False,False,Count Unhappy Friends,count-unhappy-friends,"['Array', 'Simulation']",False,False
68.55602341776795,Medium,1584,False,False,Min Cost to Connect All Points,min-cost-to-connect-all-points,"['Array', 'Union Find', 'Graph', 'Minimum Spanning Tree']",True,False
48.110549834855256,Hard,1585,False,False,Check If String Is Transformable With Substring Sort Operations,check-if-string-is-transformable-with-substring-sort-operations,"['String', 'Greedy', 'Sorting']",False,False
63.142621857966354,Medium,1586,False,True,Binary Search Tree Iterator II,binary-search-tree-iterator-ii,"['Stack', 'Tree', 'Design', 'Binary Search Tree', 'Binary Tree', 'Iterator']",True,False
83.34388151241315,Easy,1587,False,False,Bank Account Summary II,bank-account-summary-ii,['Database'],True,False
83.43976842906274,Easy,1588,False,False,Sum of All Odd Length Subarrays,sum-of-all-odd-length-subarrays,"['Array', 'Math', 'Prefix Sum']",True,False
38.94052795784096,Medium,1589,False,False,Maximum Sum Obtained of Any Permutation,maximum-sum-obtained-of-any-permutation,"['Array', 'Greedy', 'Sorting', 'Prefix Sum']",False,False
39.499507378005276,Medium,1590,False,False,Make Sum Divisible by P,make-sum-divisible-by-p,"['Array', 'Hash Table', 'Prefix Sum']",True,False
59.545955477187576,Hard,1591,False,False,Strange Printer II,strange-printer-ii,"['Array', 'Graph', 'Topological Sort', 'Matrix']",False,False
43.89421585683268,Easy,1592,False,False,Rearrange Spaces Between Words,rearrange-spaces-between-words,['String'],False,False
68.29079247586337,Medium,1593,False,False,Split a String Into the Max Number of Unique Substrings,split-a-string-into-the-max-number-of-unique-substrings,"['Hash Table', 'String', 'Backtracking']",True,False
34.43220243814182,Medium,1594,False,False,Maximum Non Negative Product in a Matrix,maximum-non-negative-product-in-a-matrix,"['Array', 'Dynamic Programming', 'Matrix']",False,False
48.085321564841635,Hard,1595,False,False,Minimum Cost to Connect Two Groups of Points,minimum-cost-to-connect-two-groups-of-points,"['Array', 'Dynamic Programming', 'Bit Manipulation', 'Matrix', 'Bitmask']",False,False
77.95866640670695,Medium,1596,False,True,The Most Frequently Ordered Products for Each Customer,the-most-frequently-ordered-products-for-each-customer,['Database'],False,False
62.413593185568395,Hard,1597,False,True,Build Binary Expression Tree From Infix Expression,build-binary-expression-tree-from-infix-expression,"['String', 'Stack', 'Tree', 'Binary Tree']",False,False
71.60782988039472,Easy,1598,False,False,Crawler Log Folder,crawler-log-folder,"['Array', 'String', 'Stack']",True,False
43.795781068251124,Medium,1599,False,False,Maximum Profit of Operating a Centennial Wheel,maximum-profit-of-operating-a-centennial-wheel,"['Array', 'Simulation']",False,False
66.61004152510381,Medium,1600,False,False,Throne Inheritance,throne-inheritance,"['Hash Table', 'Tree', 'Depth-First Search', 'Design']",False,False
64.42108667529108,Hard,1601,False,False,Maximum Number of Achievable Transfer Requests,maximum-number-of-achievable-transfer-requests,"['Array', 'Backtracking', 'Bit Manipulation', 'Enumeration']",True,False
75.01629169899147,Medium,1602,False,True,Find Nearest Right Node in Binary Tree,find-nearest-right-node-in-binary-tree,"['Tree', 'Breadth-First Search', 'Binary Tree']",True,True
88.03965712527793,Easy,1603,False,False,Design Parking System,design-parking-system,"['Design', 'Simulation', 'Counting']",True,False
45.928263799848764,Medium,1604,False,False,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,"['Array', 'Hash Table', 'String', 'Sorting']",False,False
82.85809285289086,Medium,1605,False,False,Find Valid Matrix Given Row and Column Sums,find-valid-matrix-given-row-and-column-sums,"['Array', 'Greedy', 'Matrix']",True,False
43.78077874324235,Hard,1606,False,False,Find Servers That Handled Most Number of Requests,find-servers-that-handled-most-number-of-requests,"['Array', 'Greedy', 'Heap (Priority Queue)', 'Ordered Set']",True,False
54.46114270240996,Easy,1607,False,True,Sellers With No Sales,sellers-with-no-sales,['Database'],True,False
66.58263625115323,Easy,1608,False,False,Special Array With X Elements Greater Than or Equal X,special-array-with-x-elements-greater-than-or-equal-x,"['Array', 'Binary Search', 'Sorting']",True,False
66.46343509827831,Medium,1609,False,False,Even Odd Tree,even-odd-tree,"['Tree', 'Breadth-First Search', 'Binary Tree']",True,False
37.519005967465056,Hard,1610,False,False,Maximum Number of Visible Points,maximum-number-of-visible-points,"['Array', 'Math', 'Geometry', 'Sliding Window', 'Sorting']",False,False
73.2797977196638,Hard,1611,False,False,Minimum One Bit Operations to Make Integers Zero,minimum-one-bit-operations-to-make-integers-zero,"['Dynamic Programming', 'Bit Manipulation', 'Memoization']",True,False
71.05659374723231,Medium,1612,False,True,Check If Two Expression Trees are Equivalent,check-if-two-expression-trees-are-equivalent,"['Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree', 'Counting']",False,False
73.11503811503812,Medium,1613,False,True,Find the Missing IDs,find-the-missing-ids,['Database'],False,False
84.21693353154377,Easy,1614,False,False,Maximum Nesting Depth of the Parentheses,maximum-nesting-depth-of-the-parentheses,"['String', 'Stack']",True,False
65.36764984685645,Medium,1615,False,False,Maximal Network Rank,maximal-network-rank,['Graph'],True,False
31.28213634101841,Medium,1616,False,False,Split Two Strings to Make Palindrome,split-two-strings-to-make-palindrome,"['Two Pointers', 'String']",False,False
66.64746845384575,Hard,1617,False,False,Count Subtrees With Max Distance Between Cities,count-subtrees-with-max-distance-between-cities,"['Dynamic Programming', 'Bit Manipulation', 'Tree', 'Enumeration', 'Bitmask']",False,False
61.233216454288886,Medium,1618,False,True,Maximum Font to Fit a Sentence in a Screen,maximum-font-to-fit-a-sentence-in-a-screen,"['Array', 'String', 'Binary Search', 'Interactive']",False,False
70.11036622851957,Easy,1619,False,False,Mean of Array After Removing Some Elements,mean-of-array-after-removing-some-elements,"['Array', 'Sorting']",False,False
38.171879744913454,Medium,1620,False,False,Coordinate With Maximum Network Quality,coordinate-with-maximum-network-quality,"['Array', 'Enumeration']",False,False
44.419504643962846,Medium,1621,False,False,Number of Sets of K Non-Overlapping Line Segments,number-of-sets-of-k-non-overlapping-line-segments,"['Math', 'Dynamic Programming', 'Combinatorics']",False,False
18.124864981637504,Hard,1622,False,False,Fancy Sequence,fancy-sequence,"['Math', 'Design', 'Segment Tree']",False,False
80.9352652663896,Easy,1623,False,True,All Valid Triplets That Can Represent a Country,all-valid-triplets-that-can-represent-a-country,['Database'],False,False
68.23498344471754,Easy,1624,False,False,Largest Substring Between Two Equal Characters,largest-substring-between-two-equal-characters,"['Hash Table', 'String']",True,False
64.88669018951657,Medium,1625,False,False,Lexicographically Smallest String After Applying Operations,lexicographically-smallest-string-after-applying-operations,"['String', 'Depth-First Search', 'Breadth-First Search', 'Enumeration']",False,False
50.35450302583685,Medium,1626,False,False,Best Team With No Conflicts,best-team-with-no-conflicts,"['Array', 'Dynamic Programming', 'Sorting']",True,False
47.963478136814324,Hard,1627,False,False,Graph Connectivity With Threshold,graph-connectivity-with-threshold,"['Array', 'Math', 'Union Find', 'Number Theory']",False,False
82.40933477967691,Medium,1628,False,True,Design an Expression Tree With Evaluate Function,design-an-expression-tree-with-evaluate-function,"['Array', 'Math', 'Stack', 'Tree', 'Design', 'Binary Tree']",False,False
59.21980789568365,Easy,1629,False,False,Slowest Key,slowest-key,"['Array', 'String']",True,False
83.68312757201646,Medium,1630,False,False,Arithmetic Subarrays,arithmetic-subarrays,"['Array', 'Hash Table', 'Sorting']",True,False
60.977361367377824,Medium,1631,False,False,Path With Minimum Effort,path-with-minimum-effort,"['Array', 'Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Heap (Priority Queue)', 'Matrix']",True,False
41.34370412863386,Hard,1632,False,False,Rank Transform of a Matrix,rank-transform-of-a-matrix,"['Array', 'Union Find', 'Graph', 'Topological Sort', 'Sorting', 'Matrix']",True,False
58.49054116840707,Easy,1633,False,False,Percentage of Users Attended a Contest,percentage-of-users-attended-a-contest,['Database'],True,False
60.66143800950431,Medium,1634,False,True,Add Two Polynomials Represented as Linked Lists,add-two-polynomials-represented-as-linked-lists,"['Linked List', 'Math', 'Two Pointers']",True,False
48.13176007866274,Hard,1635,False,True,Hopper Company Queries I,hopper-company-queries-i,['Database'],True,False
80.13334603799753,Easy,1636,False,False,Sort Array by Increasing Frequency,sort-array-by-increasing-frequency,"['Array', 'Hash Table', 'Sorting']",True,False
87.06177626064684,Easy,1637,False,False,Widest Vertical Area Between Two Points Containing No Points,widest-vertical-area-between-two-points-containing-no-points,"['Array', 'Sorting']",True,False
71.53525748906092,Medium,1638,False,False,Count Substrings That Differ by One Character,count-substrings-that-differ-by-one-character,"['Hash Table', 'String', 'Dynamic Programming', 'Enumeration']",False,False
57.183988195387926,Hard,1639,False,False,Number of Ways to Form a Target String Given a Dictionary,number-of-ways-to-form-a-target-string-given-a-dictionary,"['Array', 'String', 'Dynamic Programming']",True,False
56.90488143593889,Easy,1640,False,False,Check Array Formation Through Concatenation,check-array-formation-through-concatenation,"['Array', 'Hash Table']",True,False
78.80081423705585,Medium,1641,False,False,Count Sorted Vowel Strings,count-sorted-vowel-strings,"['Math', 'Dynamic Programming', 'Combinatorics']",True,False
50.22834934310324,Medium,1642,False,False,Furthest Building You Can Reach,furthest-building-you-can-reach,"['Array', 'Greedy', 'Heap (Priority Queue)']",True,False
45.58387853351438,Hard,1643,False,False,Kth Smallest Instructions,kth-smallest-instructions,"['Array', 'Math', 'Dynamic Programming', 'Combinatorics']",False,False
68.3077623319236,Medium,1644,False,True,Lowest Common Ancestor of a Binary Tree II,lowest-common-ancestor-of-a-binary-tree-ii,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
39.41826522101751,Hard,1645,False,True,Hopper Company Queries II,hopper-company-queries-ii,['Database'],False,False
50.89992453095109,Easy,1646,False,False,Get Maximum in Generated Array,get-maximum-in-generated-array,"['Array', 'Simulation']",True,False
61.262052715123104,Medium,1647,False,False,Minimum Deletions to Make Character Frequencies Unique,minimum-deletions-to-make-character-frequencies-unique,"['Hash Table', 'String', 'Greedy', 'Sorting']",True,False
29.916047302380168,Medium,1648,False,False,Sell Diminishing-Valued Colored Balls,sell-diminishing-valued-colored-balls,"['Array', 'Math', 'Binary Search', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",False,False
39.71593455849395,Hard,1649,False,False,Create Sorted Array through Instructions,create-sorted-array-through-instructions,"['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']",True,False
82.14315333524476,Medium,1650,False,True,Lowest Common Ancestor of a Binary Tree III,lowest-common-ancestor-of-a-binary-tree-iii,"['Hash Table', 'Two Pointers', 'Tree', 'Binary Tree']",False,False
65.78211106401017,Hard,1651,False,True,Hopper Company Queries III,hopper-company-queries-iii,['Database'],False,False
79.25640019189673,Easy,1652,False,False,Defuse the Bomb,defuse-the-bomb,"['Array', 'Sliding Window']",True,False
65.58923231841837,Medium,1653,False,False,Minimum Deletions to Make String Balanced,minimum-deletions-to-make-string-balanced,"['String', 'Dynamic Programming', 'Stack']",True,False
29.998881820892553,Medium,1654,False,False,Minimum Jumps to Reach Home,minimum-jumps-to-reach-home,"['Array', 'Dynamic Programming', 'Breadth-First Search']",False,False
39.58774592222198,Hard,1655,False,False,Distribute Repeating Integers,distribute-repeating-integers,"['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']",False,False
84.4597101999603,Easy,1656,False,False,Design an Ordered Stream,design-an-ordered-stream,"['Array', 'Hash Table', 'Design', 'Data Stream']",False,False
54.08104956268222,Medium,1657,False,False,Determine if Two Strings Are Close,determine-if-two-strings-are-close,"['Hash Table', 'String', 'Sorting', 'Counting']",True,False
39.9816241565775,Medium,1658,False,False,Minimum Operations to Reduce X to Zero,minimum-operations-to-reduce-x-to-zero,"['Array', 'Hash Table', 'Binary Search', 'Sliding Window', 'Prefix Sum']",True,False
39.625985454989916,Hard,1659,False,False,Maximize Grid Happiness,maximize-grid-happiness,"['Dynamic Programming', 'Bit Manipulation', 'Memoization', 'Bitmask']",False,False
74.35521585872334,Medium,1660,False,True,Correct a Binary Tree,correct-a-binary-tree,"['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
68.86821364304294,Easy,1661,False,False,Average Time of Process per Machine,average-time-of-process-per-machine,['Database'],True,False
85.71070829742955,Easy,1662,False,False,Check If Two String Arrays are Equivalent,check-if-two-string-arrays-are-equivalent,"['Array', 'String']",True,False
67.00241197633837,Medium,1663,False,False,Smallest String With A Given Numeric Value,smallest-string-with-a-given-numeric-value,"['String', 'Greedy']",True,False
64.26778966800312,Medium,1664,False,False,Ways to Make a Fair Array,ways-to-make-a-fair-array,"['Array', 'Prefix Sum']",False,False
58.98856431830302,Hard,1665,False,False,Minimum Initial Energy to Finish Tasks,minimum-initial-energy-to-finish-tasks,"['Array', 'Greedy', 'Sorting']",False,False
74.47767308480131,Medium,1666,False,True,Change the Root of a Binary Tree,change-the-root-of-a-binary-tree,"['Tree', 'Depth-First Search', 'Binary Tree']",False,False
61.0361953660013,Easy,1667,False,False,Fix Names in a Table,fix-names-in-a-table,['Database'],True,False
39.31948239418467,Easy,1668,False,False,Maximum Repeating Substring,maximum-repeating-substring,"['String', 'Dynamic Programming', 'String Matching']",False,False
82.20075301102283,Medium,1669,False,False,Merge In Between Linked Lists,merge-in-between-linked-lists,['Linked List'],True,False
57.04999585440677,Medium,1670,False,False,Design Front Middle Back Queue,design-front-middle-back-queue,"['Array', 'Linked List', 'Design', 'Queue', 'Data Stream']",False,False
54.98704819422403,Hard,1671,False,False,Minimum Number of Removals to Make Mountain Array,minimum-number-of-removals-to-make-mountain-array,"['Array', 'Binary Search', 'Dynamic Programming', 'Greedy']",True,False
88.50836956966236,Easy,1672,False,False,Richest Customer Wealth,richest-customer-wealth,"['Array', 'Matrix']",True,True
51.53364709534931,Medium,1673,False,False,Find the Most Competitive Subsequence,find-the-most-competitive-subsequence,"['Array', 'Stack', 'Greedy', 'Monotonic Stack']",True,False
41.39882299683115,Medium,1674,False,False,Minimum Moves to Make Array Complementary,minimum-moves-to-make-array-complementary,"['Array', 'Hash Table', 'Prefix Sum']",False,False
53.9159970176456,Hard,1675,False,False,Minimize Deviation in Array,minimize-deviation-in-array,"['Array', 'Greedy', 'Heap (Priority Queue)', 'Ordered Set']",True,False
78.9061939280844,Medium,1676,False,True,Lowest Common Ancestor of a Binary Tree IV,lowest-common-ancestor-of-a-binary-tree-iv,"['Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree']",False,False
38.44863216909132,Easy,1677,False,True,Product's Worth Over Invoices,products-worth-over-invoices,['Database'],False,False
87.6214496400022,Easy,1678,False,False,Goal Parser Interpretation,goal-parser-interpretation,['String'],False,False
56.009510127127385,Medium,1679,False,False,Max Number of K-Sum Pairs,max-number-of-k-sum-pairs,"['Array', 'Hash Table', 'Two Pointers', 'Sorting']",True,False
56.63211082162747,Medium,1680,False,False,Concatenation of Consecutive Binary Numbers,concatenation-of-consecutive-binary-numbers,"['Math', 'Bit Manipulation', 'Simulation']",True,False
39.66223971142811,Hard,1681,False,False,Minimum Incompatibility,minimum-incompatibility,"['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']",False,False
50.18126633504764,Medium,1682,False,True,Longest Palindromic Subsequence II,longest-palindromic-subsequence-ii,"['String', 'Dynamic Programming']",False,False
85.61024340988678,Easy,1683,False,False,Invalid Tweets,invalid-tweets,['Database'],True,False
88.23005035612212,Easy,1684,False,False,Count the Number of Consistent Strings,count-the-number-of-consistent-strings,"['Array', 'Hash Table', 'String', 'Bit Manipulation', 'Counting']",True,False
68.16532935461643,Medium,1685,False,False,Sum of Absolute Differences in a Sorted Array,sum-of-absolute-differences-in-a-sorted-array,"['Array', 'Math', 'Prefix Sum']",True,False
58.46838258659041,Medium,1686,False,False,Stone Game VI,stone-game-vi,"['Array', 'Math', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Game Theory']",False,False
39.17752234993615,Hard,1687,False,False,Delivering Boxes from Storage to Ports,delivering-boxes-from-storage-to-ports,"['Array', 'Dynamic Programming', 'Segment Tree', 'Queue', 'Heap (Priority Queue)', 'Prefix Sum', 'Monotonic Queue']",False,False
85.85937720340073,Easy,1688,False,False,Count of Matches in Tournament,count-of-matches-in-tournament,"['Math', 'Simulation']",True,False
88.59834917255324,Medium,1689,False,False,Partitioning Into Minimum Number Of Deci-Binary Numbers,partitioning-into-minimum-number-of-deci-binary-numbers,"['String', 'Greedy']",True,False
58.237689744539054,Medium,1690,False,False,Stone Game VII,stone-game-vii,"['Array', 'Math', 'Dynamic Programming', 'Game Theory']",True,False
59.63815897385428,Hard,1691,False,False,Maximum Height by Stacking Cuboids ,maximum-height-by-stacking-cuboids,"['Array', 'Dynamic Programming', 'Sorting']",False,False
63.03527845573552,Hard,1692,False,True,Count Ways to Distribute Candies,count-ways-to-distribute-candies,['Dynamic Programming'],False,False
86.56800679656882,Easy,1693,False,False,Daily Leads and Partners,daily-leads-and-partners,['Database'],True,False
66.76096181046675,Easy,1694,False,False,Reformat Phone Number,reformat-phone-number,['String'],False,False
59.13109918037476,Medium,1695,False,False,Maximum Erasure Value,maximum-erasure-value,"['Array', 'Hash Table', 'Sliding Window']",True,False
45.88405705330146,Medium,1696,False,False,Jump Game VI,jump-game-vi,"['Array', 'Dynamic Programming', 'Queue', 'Heap (Priority Queue)', 'Monotonic Queue']",True,False
62.710760050753876,Hard,1697,False,False,Checking Existence of Edge Length Limited Paths,checking-existence-of-edge-length-limited-paths,"['Array', 'Two Pointers', 'Union Find', 'Graph', 'Sorting']",True,False
64.37484084542908,Medium,1698,False,True,Number of Distinct Substrings in a String,number-of-distinct-substrings-in-a-string,"['String', 'Trie', 'Rolling Hash', 'Suffix Array', 'Hash Function']",False,False
80.9648741686441,Medium,1699,False,True,Number of Calls Between Two Persons,number-of-calls-between-two-persons,['Database'],False,False
78.57379714609675,Easy,1700,False,False,Number of Students Unable to Eat Lunch,number-of-students-unable-to-eat-lunch,"['Array', 'Stack', 'Queue', 'Simulation']",True,False
73.0592492757007,Medium,1701,False,False,Average Waiting Time,average-waiting-time,"['Array', 'Simulation']",True,False
46.81659606279591,Medium,1702,False,False,Maximum Binary String After Change,maximum-binary-string-after-change,"['String', 'Greedy']",False,False
42.069901594842214,Hard,1703,False,False,Minimum Adjacent Swaps for K Consecutive Ones,minimum-adjacent-swaps-for-k-consecutive-ones,"['Array', 'Greedy', 'Sliding Window', 'Prefix Sum']",False,False
78.62904318074317,Easy,1704,False,False,Determine if String Halves Are Alike,determine-if-string-halves-are-alike,"['String', 'Counting']",True,False
40.27950167792948,Medium,1705,False,False,Maximum Number of Eaten Apples,maximum-number-of-eaten-apples,"['Array', 'Greedy', 'Heap (Priority Queue)']",True,False
71.97063519300497,Medium,1706,False,False,Where Will the Ball Fall,where-will-the-ball-fall,"['Array', 'Matrix', 'Simulation']",True,False
54.03666243173231,Hard,1707,False,False,Maximum XOR With an Element From Array,maximum-xor-with-an-element-from-array,"['Array', 'Bit Manipulation', 'Trie']",False,False
65.14254975793438,Easy,1708,False,True,Largest Subarray Length K,largest-subarray-length-k,"['Array', 'Greedy']",False,False
70.32199120944244,Medium,1709,False,True,Biggest Window Between Visits,biggest-window-between-visits,['Database'],True,False
74.11963489484513,Easy,1710,False,False,Maximum Units on a Truck,maximum-units-on-a-truck,"['Array', 'Greedy', 'Sorting']",True,False
31.361084326638355,Medium,1711,False,False,Count Good Meals,count-good-meals,"['Array', 'Hash Table']",False,False
33.31328211157594,Medium,1712,False,False,Ways to Split Array Into Three Subarrays,ways-to-split-array-into-three-subarrays,"['Array', 'Two Pointers', 'Binary Search', 'Prefix Sum']",False,False
48.28592018118802,Hard,1713,False,False,Minimum Operations to Make a Subsequence,minimum-operations-to-make-a-subsequence,"['Array', 'Hash Table', 'Binary Search', 'Greedy']",False,False
49.1063029162747,Hard,1714,False,True,Sum Of Special Evenly-Spaced Elements In Array,sum-of-special-evenly-spaced-elements-in-array,"['Array', 'Dynamic Programming']",False,False
75.90730214254482,Medium,1715,False,True,Count Apples and Oranges,count-apples-and-oranges,['Database'],False,False
78.41486832479883,Easy,1716,False,False,Calculate Money in Leetcode Bank,calculate-money-in-leetcode-bank,['Math'],True,False
62.79905649780972,Medium,1717,False,False,Maximum Score From Removing Substrings,maximum-score-from-removing-substrings,"['String', 'Stack', 'Greedy']",True,False
73.2157942066109,Medium,1718,False,False,Construct the Lexicographically Largest Valid Sequence,construct-the-lexicographically-largest-valid-sequence,"['Array', 'Backtracking']",True,False
44.06779661016949,Hard,1719,False,False,Number Of Ways To Reconstruct A Tree,number-of-ways-to-reconstruct-a-tree,"['Tree', 'Graph']",False,False
86.84551791214136,Easy,1720,False,False,Decode XORed Array,decode-xored-array,"['Array', 'Bit Manipulation']",False,False
68.32157698082901,Medium,1721,False,False,Swapping Nodes in a Linked List,swapping-nodes-in-a-linked-list,"['Linked List', 'Two Pointers']",True,False
47.940288573533955,Medium,1722,False,False,Minimize Hamming Distance After Swap Operations,minimize-hamming-distance-after-swap-operations,"['Array', 'Depth-First Search', 'Union Find']",False,False
43.069010883865566,Hard,1723,False,False,Find Minimum Time to Finish All Jobs,find-minimum-time-to-finish-all-jobs,"['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']",False,False
51.3184881336068,Hard,1724,False,True,Checking Existence of Edge Length Limited Paths II,checking-existence-of-edge-length-limited-paths-ii,"['Union Find', 'Graph', 'Minimum Spanning Tree']",False,False
78.93366459627329,Easy,1725,False,False,Number Of Rectangles That Can Form The Largest Square,number-of-rectangles-that-can-form-the-largest-square,['Array'],False,False
70.20680725120236,Medium,1726,False,False,Tuple with Same Product,tuple-with-same-product,"['Array', 'Hash Table', 'Counting']",True,False
75.16710071593373,Medium,1727,False,False,Largest Submatrix With Rearrangements,largest-submatrix-with-rearrangements,"['Array', 'Greedy', 'Sorting', 'Matrix']",True,False
39.48300111547602,Hard,1728,False,False,Cat and Mouse II,cat-and-mouse-ii,"['Array', 'Math', 'Dynamic Programming', 'Graph', 'Topological Sort', 'Memoization', 'Matrix', 'Game Theory']",False,False
69.49548351179004,Easy,1729,False,False,Find Followers Count,find-followers-count,['Database'],True,False
56.526742856310406,Medium,1730,False,True,Shortest Path to Get Food,shortest-path-to-get-food,"['Array', 'Breadth-First Search', 'Matrix']",True,False
51.76219214436274,Easy,1731,False,False,The Number of Employees Which Report to Each Employee,the-number-of-employees-which-report-to-each-employee,['Database'],True,False
83.78513855803823,Easy,1732,False,False,Find the Highest Altitude,find-the-highest-altitude,"['Array', 'Prefix Sum']",True,False
43.33110051617479,Medium,1733,False,False,Minimum Number of People to Teach,minimum-number-of-people-to-teach,"['Array', 'Hash Table', 'Greedy']",False,False
65.56374355195284,Medium,1734,False,False,Decode XORed Permutation,decode-xored-permutation,"['Array', 'Bit Manipulation']",False,False
52.40789194540697,Hard,1735,False,False,Count Ways to Make Array With Product,count-ways-to-make-array-with-product,"['Array', 'Math', 'Dynamic Programming', 'Combinatorics', 'Number Theory']",False,False
42.96264429626443,Easy,1736,False,False,Latest Time by Replacing Hidden Digits,latest-time-by-replacing-hidden-digits,"['String', 'Greedy']",False,False
36.97046868113032,Medium,1737,False,False,Change Minimum Characters to Satisfy One of Three Conditions,change-minimum-characters-to-satisfy-one-of-three-conditions,"['Hash Table', 'String', 'Counting', 'Prefix Sum']",False,False
62.55145023468528,Medium,1738,False,False,Find Kth Largest XOR Coordinate Value,find-kth-largest-xor-coordinate-value,"['Array', 'Divide and Conquer', 'Bit Manipulation', 'Sorting', 'Heap (Priority Queue)', 'Matrix', 'Prefix Sum', 'Quickselect']",False,False
51.69260582571308,Hard,1739,False,False,Building Boxes,building-boxes,"['Math', 'Binary Search', 'Greedy']",False,False
73.91313967123166,Medium,1740,False,True,Find Distance in a Binary Tree,find-distance-in-a-binary-tree,"['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
86.86490844883545,Easy,1741,False,False,Find Total Time Spent by Each Employee,find-total-time-spent-by-each-employee,['Database'],True,False
74.11245974733714,Easy,1742,False,False,Maximum Number of Balls in a Box,maximum-number-of-balls-in-a-box,"['Hash Table', 'Math', 'Counting']",False,False
74.69557899166294,Medium,1743,False,False,Restore the Array From Adjacent Pairs,restore-the-array-from-adjacent-pairs,"['Array', 'Hash Table', 'Depth-First Search']",True,False
34.41892552243525,Medium,1744,False,False,Can You Eat Your Favorite Candy on Your Favorite Day?,can-you-eat-your-favorite-candy-on-your-favorite-day,"['Array', 'Prefix Sum']",False,False
44.635300363840784,Hard,1745,False,False,Palindrome Partitioning IV,palindrome-partitioning-iv,"['String', 'Dynamic Programming']",False,False
65.17967781908303,Medium,1746,False,True,Maximum Subarray Sum After One Operation,maximum-subarray-sum-after-one-operation,"['Array', 'Dynamic Programming']",True,False
62.400336692464165,Medium,1747,False,True,Leetflex Banned Accounts,leetflex-banned-accounts,['Database'],True,False
78.85962286740497,Easy,1748,False,False,Sum of Unique Elements,sum-of-unique-elements,"['Array', 'Hash Table', 'Counting']",False,False
71.50926750719474,Medium,1749,False,False,Maximum Absolute Sum of Any Subarray,maximum-absolute-sum-of-any-subarray,"['Array', 'Dynamic Programming']",True,False
55.87342579308145,Medium,1750,False,False,Minimum Length of String After Deleting Similar Ends,minimum-length-of-string-after-deleting-similar-ends,"['Two Pointers', 'String']",True,False
60.89308434854822,Hard,1751,False,False,Maximum Number of Events That Can Be Attended II,maximum-number-of-events-that-can-be-attended-ii,"['Array', 'Binary Search', 'Dynamic Programming', 'Sorting']",True,False
54.96165178364786,Easy,1752,False,False,Check if Array Is Sorted and Rotated,check-if-array-is-sorted-and-rotated,['Array'],True,False
67.62513617338456,Medium,1753,False,False,Maximum Score From Removing Stones,maximum-score-from-removing-stones,"['Math', 'Greedy', 'Heap (Priority Queue)']",False,False
50.59461223305899,Medium,1754,False,False,Largest Merge Of Two Strings,largest-merge-of-two-strings,"['Two Pointers', 'String', 'Greedy']",False,False
41.2383004011291,Hard,1755,False,False,Closest Subsequence Sum,closest-subsequence-sum,"['Array', 'Two Pointers', 'Dynamic Programming', 'Bit Manipulation', 'Sorting', 'Bitmask']",False,False
77.68146993896896,Medium,1756,False,True,Design Most Recently Used Queue,design-most-recently-used-queue,"['Array', 'Hash Table', 'Stack', 'Design', 'Binary Indexed Tree', 'Ordered Set']",True,False
89.34276255156813,Easy,1757,False,False,Recyclable and Low Fat Products,recyclable-and-low-fat-products,['Database'],True,False
63.691060206770736,Easy,1758,False,False,Minimum Changes To Make Alternating Binary String,minimum-changes-to-make-alternating-binary-string,['String'],True,False
57.45285343615464,Medium,1759,False,False,Count Number of Homogenous Substrings,count-number-of-homogenous-substrings,"['Math', 'String']",True,False
67.60798957543224,Medium,1760,False,False,Minimum Limit of Balls in a Bag,minimum-limit-of-balls-in-a-bag,"['Array', 'Binary Search']",True,False
43.11297483966453,Hard,1761,False,False,Minimum Degree of a Connected Trio in a Graph,minimum-degree-of-a-connected-trio-in-a-graph,['Graph'],False,False
80.62738413418175,Medium,1762,False,True,Buildings With an Ocean View,buildings-with-an-ocean-view,"['Array', 'Stack', 'Monotonic Stack']",True,False
61.9685412626589,Easy,1763,False,False,Longest Nice Substring,longest-nice-substring,"['Hash Table', 'String', 'Divide and Conquer', 'Bit Manipulation', 'Sliding Window']",False,False
53.61888059923312,Medium,1764,False,False,Form Array by Concatenating Subarrays of Another Array,form-array-by-concatenating-subarrays-of-another-array,"['Array', 'Two Pointers', 'Greedy', 'String Matching']",False,False
75.02377060564298,Medium,1765,False,False,Map of Highest Peak,map-of-highest-peak,"['Array', 'Breadth-First Search', 'Matrix']",True,False
41.820368885324775,Hard,1766,False,False,Tree of Coprimes,tree-of-coprimes,"['Array', 'Math', 'Tree', 'Depth-First Search', 'Number Theory']",False,False
78.06286688127248,Hard,1767,False,True,Find the Subtasks That Did Not Execute,find-the-subtasks-that-did-not-execute,['Database'],False,False
82.04905463492408,Easy,1768,False,False,Merge Strings Alternately,merge-strings-alternately,"['Two Pointers', 'String']",True,True
90.11761051490382,Medium,1769,False,False,Minimum Number of Operations to Move All Balls to Each Box,minimum-number-of-operations-to-move-all-balls-to-each-box,"['Array', 'String', 'Prefix Sum']",True,False
41.934275153172315,Hard,1770,False,False,Maximum Score from Performing Multiplication Operations,maximum-score-from-performing-multiplication-operations,"['Array', 'Dynamic Programming']",True,False
37.03339313617686,Hard,1771,False,False,Maximize Palindrome Length From Subsequences,maximize-palindrome-length-from-subsequences,"['String', 'Dynamic Programming']",False,False
65.73770491803279,Medium,1772,False,True,Sort Features by Popularity,sort-features-by-popularity,"['Array', 'Hash Table', 'String', 'Sorting']",False,False
84.87020882194656,Easy,1773,False,False,Count Items Matching a Rule,count-items-matching-a-rule,"['Array', 'String']",False,False
47.62300071946427,Medium,1774,False,False,Closest Dessert Cost,closest-dessert-cost,"['Array', 'Dynamic Programming', 'Backtracking']",False,False
53.826296943958695,Medium,1775,False,False,Equal Sum Arrays With Minimum Number of Operations,equal-sum-arrays-with-minimum-number-of-operations,"['Array', 'Hash Table', 'Greedy', 'Counting']",False,False
56.096761757902854,Hard,1776,False,False,Car Fleet II,car-fleet-ii,"['Array', 'Math', 'Stack', 'Heap (Priority Queue)', 'Monotonic Stack']",False,False
82.47799789938793,Easy,1777,False,True,Product's Price for Each Store,products-price-for-each-store,['Database'],True,False
44.021675795361844,Medium,1778,False,True,Shortest Path in a Hidden Grid,shortest-path-in-a-hidden-grid,"['Depth-First Search', 'Breadth-First Search', 'Graph', 'Interactive']",False,False
69.22326058622889,Easy,1779,False,False,Find Nearest Point That Has the Same X or Y Coordinate,find-nearest-point-that-has-the-same-x-or-y-coordinate,['Array'],False,False
79.26216809313107,Medium,1780,False,False,Check if Number is a Sum of Powers of Three,check-if-number-is-a-sum-of-powers-of-three,['Math'],True,False
69.94188556907548,Medium,1781,False,False,Sum of Beauty of All Substrings,sum-of-beauty-of-all-substrings,"['Hash Table', 'String', 'Counting']",False,False
40.50721732157177,Hard,1782,False,False,Count Pairs Of Nodes,count-pairs-of-nodes,"['Array', 'Two Pointers', 'Binary Search', 'Graph', 'Sorting']",False,False
83.17443745363629,Medium,1783,False,True,Grand Slam Titles,grand-slam-titles,['Database'],False,False
39.011097000483794,Easy,1784,False,False,Check if Binary String Has at Most One Segment of Ones,check-if-binary-string-has-at-most-one-segment-of-ones,['String'],False,False
44.1566908741873,Medium,1785,False,False,Minimum Elements to Add to Form a Given Sum,minimum-elements-to-add-to-form-a-given-sum,"['Array', 'Greedy']",False,False
39.754558690979685,Medium,1786,False,False,Number of Restricted Paths From First to Last Node,number-of-restricted-paths-from-first-to-last-node,"['Dynamic Programming', 'Graph', 'Topological Sort', 'Heap (Priority Queue)', 'Shortest Path']",False,False
39.72557556567055,Hard,1787,False,False,Make the XOR of All Segments Equal to Zero,make-the-xor-of-all-segments-equal-to-zero,"['Array', 'Dynamic Programming', 'Bit Manipulation']",False,False
63.620386643233736,Hard,1788,False,True,Maximize the Beauty of the Garden,maximize-the-beauty-of-the-garden,"['Array', 'Hash Table', 'Greedy', 'Prefix Sum']",False,False
70.74922097276792,Easy,1789,False,False,Primary Department for Each Employee,primary-department-for-each-employee,['Database'],True,False
49.44160102192889,Easy,1790,False,False,Check if One String Swap Can Make Strings Equal,check-if-one-string-swap-can-make-strings-equal,"['Hash Table', 'String', 'Counting']",True,False
86.60061829291058,Easy,1791,False,False,Find Center of Star Graph,find-center-of-star-graph,['Graph'],True,False
71.56060080170413,Medium,1792,False,False,Maximum Average Pass Ratio,maximum-average-pass-ratio,"['Array', 'Greedy', 'Heap (Priority Queue)']",True,False
64.21977744056652,Hard,1793,False,False,Maximum Score of a Good Subarray,maximum-score-of-a-good-subarray,"['Array', 'Two Pointers', 'Binary Search', 'Stack', 'Monotonic Stack']",True,False
63.6260301221938,Medium,1794,False,True,Count Pairs of Equal Substrings With Minimum Difference,count-pairs-of-equal-substrings-with-minimum-difference,"['Hash Table', 'String', 'Greedy']",False,False
85.56531757055029,Easy,1795,False,False,Rearrange Products Table,rearrange-products-table,['Database'],True,False
51.63220892274211,Easy,1796,False,False,Second Largest Digit in a String,second-largest-digit-in-a-string,"['Hash Table', 'String']",False,False
58.01109931040672,Medium,1797,False,False,Design Authentication Manager,design-authentication-manager,"['Hash Table', 'Linked List', 'Design', 'Doubly-Linked List']",False,False
61.6299046774551,Medium,1798,False,False,Maximum Number of Consecutive Values You Can Make,maximum-number-of-consecutive-values-you-can-make,"['Array', 'Greedy', 'Sorting']",False,False
57.79728820759726,Hard,1799,False,False,Maximize Score After N Operations,maximize-score-after-n-operations,"['Array', 'Math', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Number Theory', 'Bitmask']",True,False
66.5505195483014,Easy,1800,False,False,Maximum Ascending Subarray Sum,maximum-ascending-subarray-sum,['Array'],True,False
51.303331385154884,Medium,1801,False,False,Number of Orders in the Backlog,number-of-orders-in-the-backlog,"['Array', 'Heap (Priority Queue)', 'Simulation']",False,False
38.810392303265786,Medium,1802,False,False,Maximum Value at a Given Index in a Bounded Array,maximum-value-at-a-given-index-in-a-bounded-array,"['Binary Search', 'Greedy']",True,False
45.83583240510667,Hard,1803,False,False,Count Pairs With XOR in a Range,count-pairs-with-xor-in-a-range,"['Array', 'Bit Manipulation', 'Trie']",False,False
63.041289023162136,Medium,1804,False,True,Implement Trie II (Prefix Tree),implement-trie-ii-prefix-tree,"['Hash Table', 'String', 'Design', 'Trie']",True,False
38.94190465545185,Easy,1805,False,False,Number of Different Integers in a String,number-of-different-integers-in-a-string,"['Hash Table', 'String']",False,False
71.97260273972603,Medium,1806,False,False,Minimum Number of Operations to Reinitialize a Permutation,minimum-number-of-operations-to-reinitialize-a-permutation,"['Array', 'Math', 'Simulation']",False,False
67.83774479804161,Medium,1807,False,False,Evaluate the Bracket Pairs of a String,evaluate-the-bracket-pairs-of-a-string,"['Array', 'Hash Table', 'String']",False,False
32.646034664892994,Hard,1808,False,False,Maximize Number of Nice Divisors,maximize-number-of-nice-divisors,"['Math', 'Recursion', 'Number Theory']",False,False
58.62958431165052,Easy,1809,False,True,Ad-Free Sessions,ad-free-sessions,['Database'],False,False
58.050795965487914,Medium,1810,False,True,Minimum Path Cost in a Hidden Grid,minimum-path-cost-in-a-hidden-grid,"['Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Interactive']",False,False
60.66415252461764,Medium,1811,False,True,Find Interview Candidates,find-interview-candidates,['Database'],False,False
79.1115543840485,Easy,1812,False,False,Determine Color of a Chessboard Square,determine-color-of-a-chessboard-square,"['Math', 'String']",False,False
48.645404531989385,Medium,1813,False,False,Sentence Similarity III,sentence-similarity-iii,"['Array', 'Two Pointers', 'String']",True,False
48.55856868681191,Medium,1814,False,False,Count Nice Pairs in an Array,count-nice-pairs-in-an-array,"['Array', 'Hash Table', 'Math', 'Counting']",True,False
40.21510025401287,Hard,1815,False,False,Maximum Number of Groups Getting Fresh Donuts,maximum-number-of-groups-getting-fresh-donuts,"['Array', 'Dynamic Programming', 'Bit Manipulation', 'Memoization', 'Bitmask']",False,False
85.93454557927548,Easy,1816,False,False,Truncate Sentence,truncate-sentence,"['Array', 'String']",False,False
80.40902164742032,Medium,1817,False,False,Finding the Users Active Minutes,finding-the-users-active-minutes,"['Array', 'Hash Table']",False,False
31.117990602906954,Medium,1818,False,False,Minimum Absolute Sum Difference,minimum-absolute-sum-difference,"['Array', 'Binary Search', 'Sorting', 'Ordered Set']",False,False
41.49359433436779,Hard,1819,False,False,Number of Different Subsequences GCDs,number-of-different-subsequences-gcds,"['Array', 'Math', 'Counting', 'Number Theory']",False,False
51.62276455902584,Medium,1820,False,True,Maximum Number of Accepted Invitations,maximum-number-of-accepted-invitations,"['Array', 'Depth-First Search', 'Graph', 'Matrix']",False,False
87.67172913473597,Easy,1821,False,True,Find Customers With Positive Revenue this Year,find-customers-with-positive-revenue-this-year,['Database'],False,False
65.1587169343299,Easy,1822,False,False,Sign of the Product of an Array,sign-of-the-product-of-an-array,"['Array', 'Math']",True,False
82.00750213300888,Medium,1823,False,False,Find the Winner of the Circular Game,find-the-winner-of-the-circular-game,"['Array', 'Math', 'Recursion', 'Queue', 'Simulation']",True,False
50.59131533808793,Medium,1824,False,False,Minimum Sideway Jumps,minimum-sideway-jumps,"['Array', 'Dynamic Programming', 'Greedy']",False,False
38.0281473506114,Hard,1825,False,False,Finding MK Average,finding-mk-average,"['Design', 'Queue', 'Heap (Priority Queue)', 'Data Stream', 'Ordered Set']",False,False
50.3140703517588,Easy,1826,False,True,Faulty Sensor,faulty-sensor,"['Array', 'Two Pointers']",False,False
80.85617814370202,Easy,1827,False,False,Minimum Operations to Make the Array Increasing,minimum-operations-to-make-the-array-increasing,"['Array', 'Greedy']",False,False
86.31375993054925,Medium,1828,False,False,Queries on Number of Points Inside a Circle,queries-on-number-of-points-inside-a-circle,"['Array', 'Math', 'Geometry']",False,False
84.82002842301284,Medium,1829,False,False,Maximum XOR for Each Query,maximum-xor-for-each-query,"['Array', 'Bit Manipulation', 'Prefix Sum']",True,False
49.79911186297314,Hard,1830,False,False,Minimum Number of Operations to Make String Sorted,minimum-number-of-operations-to-make-string-sorted,"['Math', 'String', 'Combinatorics']",False,False
82.39135637843198,Medium,1831,False,True,Maximum Transaction Each Day,maximum-transaction-each-day,['Database'],False,False
83.73857130482033,Easy,1832,False,False,Check if the Sentence Is Pangram,check-if-the-sentence-is-pangram,"['Hash Table', 'String']",True,False
73.83346190108854,Medium,1833,False,False,Maximum Ice Cream Bars,maximum-ice-cream-bars,"['Array', 'Greedy', 'Sorting', 'Counting Sort']",True,False
46.155441028375094,Medium,1834,False,False,Single-Threaded CPU,single-threaded-cpu,"['Array', 'Sorting', 'Heap (Priority Queue)']",True,False
61.40129101667563,Hard,1835,False,False,Find XOR Sum of All Pairs Bitwise AND,find-xor-sum-of-all-pairs-bitwise-and,"['Array', 'Math', 'Bit Manipulation']",False,False
75.22173391929684,Medium,1836,False,True,Remove Duplicates From an Unsorted Linked List,remove-duplicates-from-an-unsorted-linked-list,"['Hash Table', 'Linked List']",True,False
77.74884814743713,Easy,1837,False,False,Sum of Digits in Base K,sum-of-digits-in-base-k,['Math'],False,False
44.00456590344457,Medium,1838,False,False,Frequency of the Most Frequent Element,frequency-of-the-most-frequent-element,"['Array', 'Binary Search', 'Greedy', 'Sliding Window', 'Sorting', 'Prefix Sum']",True,False
50.10608481546481,Medium,1839,False,False,Longest Substring Of All Vowels in Order,longest-substring-of-all-vowels-in-order,"['String', 'Sliding Window']",False,False
37.12296983758701,Hard,1840,False,False,Maximum Building Height,maximum-building-height,"['Array', 'Math', 'Sorting']",False,False
53.44385026737968,Medium,1841,False,True,League Statistics,league-statistics,['Database'],True,False
53.6670646426744,Hard,1842,False,True,Next Palindrome Using Same Digits,next-palindrome-using-same-digits,"['Two Pointers', 'String']",False,False
45.032412146025244,Medium,1843,False,True,Suspicious Bank Accounts,suspicious-bank-accounts,['Database'],True,False
81.96060512100787,Easy,1844,False,False,Replace All Digits with Characters,replace-all-digits-with-characters,['String'],False,False
70.16239303108051,Medium,1845,False,False,Seat Reservation Manager,seat-reservation-manager,"['Design', 'Heap (Priority Queue)']",True,False
65.71997018657434,Medium,1846,False,False,Maximum Element After Decreasing and Rearranging,maximum-element-after-decreasing-and-rearranging,"['Array', 'Greedy', 'Sorting']",True,False
39.33937211248136,Hard,1847,False,False,Closest Room,closest-room,"['Array', 'Binary Search', 'Sorting', 'Ordered Set']",False,False
54.29511906598776,Easy,1848,False,False,Minimum Distance to the Target Element,minimum-distance-to-the-target-element,['Array'],False,False
36.66598799956884,Medium,1849,False,False,Splitting a String Into Descending Consecutive Values,splitting-a-string-into-descending-consecutive-values,"['String', 'Backtracking']",False,False
71.0727969348659,Medium,1850,False,False,Minimum Adjacent Swaps to Reach the Kth Smallest Number,minimum-adjacent-swaps-to-reach-the-kth-smallest-number,"['Two Pointers', 'String', 'Greedy']",False,False
51.84147776377854,Hard,1851,False,False,Minimum Interval to Include Each Query,minimum-interval-to-include-each-query,"['Array', 'Binary Search', 'Line Sweep', 'Sorting', 'Heap (Priority Queue)']",False,False
76.91399330840386,Medium,1852,False,True,Distinct Numbers in Each Subarray,distinct-numbers-in-each-subarray,"['Array', 'Hash Table', 'Sliding Window']",True,False
85.59062536803674,Easy,1853,False,True,Convert Date Format,convert-date-format,['Database'],False,False
62.349965383218056,Easy,1854,False,False,Maximum Population Year,maximum-population-year,"['Array', 'Counting', 'Prefix Sum']",False,False
53.591933086585264,Medium,1855,False,False,Maximum Distance Between a Pair of Values,maximum-distance-between-a-pair-of-values,"['Array', 'Two Pointers', 'Binary Search']",True,False
38.726129619836655,Medium,1856,False,False,Maximum Subarray Min-Product,maximum-subarray-min-product,"['Array', 'Stack', 'Monotonic Stack', 'Prefix Sum']",False,False
49.447056038418616,Hard,1857,False,False,Largest Color Value in a Directed Graph,largest-color-value-in-a-directed-graph,"['Hash Table', 'Dynamic Programming', 'Graph', 'Topological Sort', 'Memoization', 'Counting']",True,False
71.3703624276217,Medium,1858,False,True,Longest Word With All Prefixes,longest-word-with-all-prefixes,"['Depth-First Search', 'Trie']",True,False
83.66608608062451,Easy,1859,False,False,Sorting the Sentence,sorting-the-sentence,"['String', 'Sorting']",False,False
72.41508608567948,Medium,1860,False,False,Incremental Memory Leak,incremental-memory-leak,"['Math', 'Simulation']",False,False
79.01692704881967,Medium,1861,False,False,Rotating the Box,rotating-the-box,"['Array', 'Two Pointers', 'Matrix']",True,False
29.41307681583717,Hard,1862,False,False,Sum of Floored Pairs,sum-of-floored-pairs,"['Array', 'Math', 'Binary Search', 'Prefix Sum']",False,False
90.05560921356864,Easy,1863,False,False,Sum of All Subset XOR Totals,sum-of-all-subset-xor-totals,"['Array', 'Math', 'Backtracking', 'Bit Manipulation', 'Combinatorics', 'Enumeration']",True,False
43.29551458524513,Medium,1864,False,False,Minimum Number of Swaps to Make the Binary String Alternating,minimum-number-of-swaps-to-make-the-binary-string-alternating,"['String', 'Greedy']",False,False
51.7369623588666,Medium,1865,False,False,Finding Pairs With a Certain Sum,finding-pairs-with-a-certain-sum,"['Array', 'Hash Table', 'Design']",False,False
57.54430293304197,Hard,1866,False,False,Number of Ways to Rearrange Sticks With K Sticks Visible,number-of-ways-to-rearrange-sticks-with-k-sticks-visible,"['Math', 'Dynamic Programming', 'Combinatorics']",False,False
70.81143037824592,Medium,1867,False,True,Orders With Maximum Quantity Above Average,orders-with-maximum-quantity-above-average,['Database'],False,False
59.20339211478451,Medium,1868,False,True,Product of Two Run-Length Encoded Arrays,product-of-two-run-length-encoded-arrays,"['Array', 'Two Pointers']",False,False
61.5074566706973,Easy,1869,False,False,Longer Contiguous Segments of Ones than Zeros,longer-contiguous-segments-of-ones-than-zeros,['String'],False,False
47.12641246821814,Medium,1870,False,False,Minimum Speed to Arrive on Time,minimum-speed-to-arrive-on-time,"['Array', 'Binary Search']",True,False
25.388746227381514,Medium,1871,False,False,Jump Game VII,jump-game-vii,"['String', 'Dynamic Programming', 'Sliding Window', 'Prefix Sum']",False,False
52.79494248502709,Hard,1872,False,False,Stone Game VIII,stone-game-viii,"['Array', 'Math', 'Dynamic Programming', 'Prefix Sum', 'Game Theory']",False,False
57.35866921596795,Easy,1873,False,False,Calculate Special Bonus,calculate-special-bonus,['Database'],True,False
89.05974287874969,Medium,1874,False,True,Minimize Product Sum of Two Arrays,minimize-product-sum-of-two-arrays,"['Array', 'Greedy', 'Sorting']",True,False
66.63903247829903,Medium,1875,False,True,Group Employees of the Same Salary,group-employees-of-the-same-salary,['Database'],False,False
75.11303396961989,Easy,1876,False,False,Substrings of Size Three with Distinct Characters,substrings-of-size-three-with-distinct-characters,"['Hash Table', 'String', 'Sliding Window', 'Counting']",False,False
81.42529642941118,Medium,1877,False,False,Minimize Maximum Pair Sum in Array,minimize-maximum-pair-sum-in-array,"['Array', 'Two Pointers', 'Greedy', 'Sorting']",True,False
48.94331476694294,Medium,1878,False,False,Get Biggest Three Rhombus Sums in a Grid,get-biggest-three-rhombus-sums-in-a-grid,"['Array', 'Math', 'Sorting', 'Heap (Priority Queue)', 'Matrix', 'Prefix Sum']",False,False
48.678676065326485,Hard,1879,False,False,Minimum XOR Sum of Two Arrays,minimum-xor-sum-of-two-arrays,"['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']",False,False
74.60407521326684,Easy,1880,False,False,Check if Word Equals Summation of Two Words,check-if-word-equals-summation-of-two-words,['String'],False,False
38.3784189397066,Medium,1881,False,False,Maximum Value after Insertion,maximum-value-after-insertion,"['String', 'Greedy']",False,False
40.82652891184802,Medium,1882,False,False,Process Tasks Using Servers,process-tasks-using-servers,"['Array', 'Heap (Priority Queue)']",False,False
38.11204234671372,Hard,1883,False,False,Minimum Skips to Arrive at Meeting On Time,minimum-skips-to-arrive-at-meeting-on-time,"['Array', 'Dynamic Programming']",False,False
73.5293728061461,Medium,1884,False,False,Egg Drop With 2 Eggs and N Floors,egg-drop-with-2-eggs-and-n-floors,"['Math', 'Dynamic Programming']",False,False
60.084768211920526,Medium,1885,False,True,Count Pairs in Two Arrays,count-pairs-in-two-arrays,"['Array', 'Two Pointers', 'Binary Search', 'Sorting']",True,False
57.82851621576206,Easy,1886,False,False,Determine Whether Matrix Can Be Obtained By Rotation,determine-whether-matrix-can-be-obtained-by-rotation,"['Array', 'Matrix']",False,False
72.3048422409185,Medium,1887,False,False,Reduction Operations to Make the Array Elements Equal,reduction-operations-to-make-the-array-elements-equal,"['Array', 'Sorting']",True,False
40.348660000743415,Medium,1888,False,False,Minimum Number of Flips to Make the Binary String Alternating,minimum-number-of-flips-to-make-the-binary-string-alternating,"['String', 'Dynamic Programming', 'Greedy', 'Sliding Window']",False,False
32.378725891291644,Hard,1889,False,False,Minimum Space Wasted From Packaging,minimum-space-wasted-from-packaging,"['Array', 'Binary Search', 'Sorting', 'Prefix Sum']",False,False
77.37845796641844,Easy,1890,False,False,The Latest Login in 2020,the-latest-login-in-2020,['Database'],True,False
51.997261049623724,Medium,1891,False,True,Cutting Ribbons,cutting-ribbons,"['Array', 'Binary Search']",True,False
44.41294111690547,Hard,1892,False,True,Page Recommendations II,page-recommendations-ii,['Database'],False,False
50.257238519540145,Easy,1893,False,False,Check if All the Integers in a Range Are Covered,check-if-all-the-integers-in-a-range-are-covered,"['Array', 'Hash Table', 'Prefix Sum']",False,False
53.168462370975824,Medium,1894,False,False,Find the Student that Will Replace the Chalk,find-the-student-that-will-replace-the-chalk,"['Array', 'Binary Search', 'Simulation', 'Prefix Sum']",True,False
52.298441332383895,Medium,1895,False,False,Largest Magic Square,largest-magic-square,"['Array', 'Matrix', 'Prefix Sum']",False,False
50.60004363953742,Hard,1896,False,False,Minimum Cost to Change the Final Value of Expression,minimum-cost-to-change-the-final-value-of-expression,"['Math', 'String', 'Dynamic Programming', 'Stack']",False,False
66.77884293088422,Easy,1897,False,False,Redistribute Characters to Make All Strings Equal,redistribute-characters-to-make-all-strings-equal,"['Hash Table', 'String', 'Counting']",True,False
45.384463088078796,Medium,1898,False,False,Maximum Number of Removable Characters,maximum-number-of-removable-characters,"['Array', 'Two Pointers', 'String', 'Binary Search']",False,False
67.26157760015076,Medium,1899,False,False,Merge Triplets to Form Target Triplet,merge-triplets-to-form-target-triplet,"['Array', 'Greedy']",False,False
47.8408195429472,Hard,1900,False,False,The Earliest and Latest Rounds Where Players Compete,the-earliest-and-latest-rounds-where-players-compete,"['Dynamic Programming', 'Memoization']",False,False
52.867471703827086,Medium,1901,False,False,Find a Peak Element II,find-a-peak-element-ii,"['Array', 'Binary Search', 'Matrix']",False,False
42.38019169329073,Medium,1902,False,True,Depth of BST Given Insertion Order,depth-of-bst-given-insertion-order,"['Array', 'Tree', 'Binary Search Tree', 'Binary Tree', 'Ordered Set']",False,False
64.69139608165501,Easy,1903,False,False,Largest Odd Number in String,largest-odd-number-in-string,"['Math', 'String', 'Greedy']",True,False
43.38113673955323,Medium,1904,False,False,The Number of Full Rounds You Have Played,the-number-of-full-rounds-you-have-played,"['Math', 'String']",False,False
72.81795689544212,Medium,1905,False,False,Count Sub Islands,count-sub-islands,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']",True,False
44.6301320311087,Medium,1906,False,False,Minimum Absolute Difference Queries,minimum-absolute-difference-queries,"['Array', 'Hash Table']",False,False
61.83886444395982,Medium,1907,False,False,Count Salary Categories,count-salary-categories,['Database'],True,False
62.898212898212904,Medium,1908,False,True,Game of Nim,game-of-nim,"['Array', 'Math', 'Dynamic Programming', 'Bit Manipulation', 'Brainteaser', 'Game Theory']",True,False
28.52781660609449,Easy,1909,False,False,Remove One Element to Make the Array Strictly Increasing,remove-one-element-to-make-the-array-strictly-increasing,['Array'],False,False
78.00566224764133,Medium,1910,False,False,Remove All Occurrences of a Substring,remove-all-occurrences-of-a-substring,"['String', 'Stack', 'Simulation']",True,False
58.70135522323102,Medium,1911,False,False,Maximum Alternating Subsequence Sum,maximum-alternating-subsequence-sum,"['Array', 'Dynamic Programming']",False,False
37.11605664888725,Hard,1912,False,False,Design Movie Rental System,design-movie-rental-system,"['Array', 'Hash Table', 'Design', 'Heap (Priority Queue)', 'Ordered Set']",False,False
82.85625682171273,Easy,1913,False,False,Maximum Product Difference Between Two Pairs,maximum-product-difference-between-two-pairs,"['Array', 'Sorting']",True,False
50.05920132036884,Medium,1914,False,False,Cyclically Rotating a Grid,cyclically-rotating-a-grid,"['Array', 'Matrix', 'Simulation']",False,False
66.66383465150766,Medium,1915,False,False,Number of Wonderful Substrings,number-of-wonderful-substrings,"['Hash Table', 'String', 'Bit Manipulation', 'Prefix Sum']",True,False
48.23236424665692,Hard,1916,False,False,Count Ways to Build Rooms in an Ant Colony,count-ways-to-build-rooms-in-an-ant-colony,"['Math', 'Dynamic Programming', 'Tree', 'Graph', 'Topological Sort', 'Combinatorics']",False,False
27.722736606982025,Hard,1917,False,True,Leetcodify Friends Recommendations,leetcodify-friends-recommendations,['Database'],False,False
52.75894440388026,Medium,1918,False,True,Kth Smallest Subarray Sum,kth-smallest-subarray-sum,"['Array', 'Binary Search', 'Sliding Window']",False,False
42.50937519862709,Hard,1919,False,True,Leetcodify Similar Friends,leetcodify-similar-friends,['Database'],False,False
90.23716755666105,Easy,1920,False,False,Build Array from Permutation,build-array-from-permutation,"['Array', 'Simulation']",False,False
50.80933389154529,Medium,1921,False,False,Eliminate Maximum Number of Monsters,eliminate-maximum-number-of-monsters,"['Array', 'Greedy', 'Sorting']",True,False
48.70595640334122,Medium,1922,False,False,Count Good Numbers,count-good-numbers,"['Math', 'Recursion']",True,False
27.87165982745808,Hard,1923,False,False,Longest Common Subpath,longest-common-subpath,"['Array', 'Binary Search', 'Rolling Hash', 'Suffix Array', 'Hash Function']",False,False
49.6372430471584,Hard,1924,False,True,Erect the Fence II,erect-the-fence-ii,"['Array', 'Math', 'Geometry']",False,False
68.63352848888378,Easy,1925,False,False,Count Square Sum Triples,count-square-sum-triples,"['Math', 'Enumeration']",False,False
47.307208348732026,Medium,1926,False,False,Nearest Exit from Entrance in Maze,nearest-exit-from-entrance-in-maze,"['Array', 'Breadth-First Search', 'Matrix']",True,False
48.147373557809615,Medium,1927,False,False,Sum Game,sum-game,"['Math', 'String', 'Greedy', 'Game Theory']",False,False
39.29580916591782,Hard,1928,False,False,Minimum Cost to Reach Destination in Time,minimum-cost-to-reach-destination-in-time,"['Array', 'Dynamic Programming', 'Graph']",False,False
90.41430111785934,Easy,1929,False,False,Concatenation of Array,concatenation-of-array,"['Array', 'Simulation']",False,False
70.87241697442843,Medium,1930,False,False,Unique Length-3 Palindromic Subsequences,unique-length-3-palindromic-subsequences,"['Hash Table', 'String', 'Bit Manipulation', 'Prefix Sum']",True,False
56.784869976359346,Hard,1931,False,False,Painting a Grid With Three Different Colors,painting-a-grid-with-three-different-colors,['Dynamic Programming'],False,False
39.22193454159198,Hard,1932,False,False,Merge BSTs to Create Single BST,merge-bsts-to-create-single-bst,"['Hash Table', 'Binary Search', 'Tree', 'Depth-First Search', 'Binary Tree']",False,False
50.658978583196046,Easy,1933,False,True,Check if String Is Decomposable Into Value-Equal Substrings,check-if-string-is-decomposable-into-value-equal-substrings,['String'],False,False
60.74903843368736,Medium,1934,False,False,Confirmation Rate,confirmation-rate,['Database'],False,False
74.43072702331962,Easy,1935,False,False,Maximum Number of Words You Can Type,maximum-number-of-words-you-can-type,"['Hash Table', 'String']",False,False
43.204682147962345,Medium,1936,False,False,Add Minimum Number of Rungs,add-minimum-number-of-rungs,"['Array', 'Greedy']",False,False
42.36314101654511,Medium,1937,False,False,Maximum Number of Points with Cost,maximum-number-of-points-with-cost,"['Array', 'Dynamic Programming', 'Matrix']",True,False
43.80838003736323,Hard,1938,False,False,Maximum Genetic Difference Query,maximum-genetic-difference-query,"['Array', 'Hash Table', 'Bit Manipulation', 'Depth-First Search', 'Trie']",False,False
56.58045723364816,Easy,1939,False,True,Users That Actively Request Confirmation Messages,users-that-actively-request-confirmation-messages,['Database'],False,False
81.29189864788093,Medium,1940,False,True,Longest Common Subsequence Between Sorted Arrays,longest-common-subsequence-between-sorted-arrays,"['Array', 'Hash Table', 'Counting']",True,False
78.42523422578348,Easy,1941,False,False,Check if All Characters Have Equal Number of Occurrences,check-if-all-characters-have-equal-number-of-occurrences,"['Hash Table', 'String', 'Counting']",False,False
60.50464662859631,Medium,1942,False,False,The Number of the Smallest Unoccupied Chair,the-number-of-the-smallest-unoccupied-chair,"['Array', 'Hash Table', 'Heap (Priority Queue)']",True,False
50.77070674768148,Medium,1943,False,False,Describe the Painting,describe-the-painting,"['Array', 'Hash Table', 'Sorting', 'Prefix Sum']",False,False
70.71549274850977,Hard,1944,False,False,Number of Visible People in a Queue,number-of-visible-people-in-a-queue,"['Array', 'Stack', 'Monotonic Stack']",False,False
74.70366270200213,Easy,1945,False,False,Sum of Digits of String After Convert,sum-of-digits-of-string-after-convert,"['String', 'Simulation']",True,False
36.56477529500376,Medium,1946,False,False,Largest Number After Mutating Substring,largest-number-after-mutating-substring,"['Array', 'String', 'Greedy']",False,False
62.96510507036823,Medium,1947,False,False,Maximum Compatibility Score Sum,maximum-compatibility-score-sum,"['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']",False,False
53.53984701350838,Hard,1948,False,False,Delete Duplicate Folders in System,delete-duplicate-folders-in-system,"['Array', 'Hash Table', 'String', 'Trie', 'Hash Function']",False,False
54.460111885968274,Medium,1949,False,True,Strong Friendship,strong-friendship,['Database'],False,False
47.911264765197345,Medium,1950,False,True,Maximum of Minimum Values in All Subarrays,maximum-of-minimum-values-in-all-subarrays,"['Array', 'Stack', 'Monotonic Stack']",False,False
69.14486279514996,Medium,1951,False,True,All the Pairs With the Maximum Number of Common Followers,all-the-pairs-with-the-maximum-number-of-common-followers,['Database'],False,False
62.315116650687116,Easy,1952,False,False,Three Divisors,three-divisors,"['Math', 'Enumeration', 'Number Theory']",False,False
41.10480409802022,Medium,1953,False,False,Maximum Number of Weeks for Which You Can Work,maximum-number-of-weeks-for-which-you-can-work,"['Array', 'Greedy']",False,False
54.194178101854504,Medium,1954,False,False,Minimum Garden Perimeter to Collect Enough Apples,minimum-garden-perimeter-to-collect-enough-apples,"['Math', 'Binary Search']",False,False
51.55497822266371,Hard,1955,False,False,Count Number of Special Subsequences,count-number-of-special-subsequences,"['Array', 'Dynamic Programming']",False,False
48.97348160821215,Hard,1956,False,True,Minimum Time For K Virus Variants to Spread,minimum-time-for-k-virus-variants-to-spread,"['Array', 'Math', 'Binary Search', 'Geometry', 'Enumeration']",False,False
71.60723729785697,Easy,1957,False,False,Delete Characters to Make Fancy String,delete-characters-to-make-fancy-string,['String'],True,False
49.07862970998991,Medium,1958,False,False,Check if Move is Legal,check-if-move-is-legal,"['Array', 'Matrix', 'Enumeration']",False,False
42.627452717367234,Medium,1959,False,False,Minimum Total Space Wasted With K Resizing Operations,minimum-total-space-wasted-with-k-resizing-operations,"['Array', 'Dynamic Programming']",False,False
30.34131360368535,Hard,1960,False,False,Maximum Product of the Length of Two Palindromic Substrings,maximum-product-of-the-length-of-two-palindromic-substrings,"['String', 'Rolling Hash', 'Hash Function']",False,False
52.41655422592847,Easy,1961,False,False,Check If String Is a Prefix of Array,check-if-string-is-a-prefix-of-array,"['Array', 'Two Pointers', 'String']",False,False
64.32475588036603,Medium,1962,False,False,Remove Stones to Minimize the Total,remove-stones-to-minimize-the-total,"['Array', 'Greedy', 'Heap (Priority Queue)']",True,False
77.90489437538034,Medium,1963,False,False,Minimum Number of Swaps to Make the String Balanced,minimum-number-of-swaps-to-make-the-string-balanced,"['Two Pointers', 'String', 'Stack', 'Greedy']",True,False
62.46685399928761,Hard,1964,False,False,Find the Longest Valid Obstacle Course at Each Position,find-the-longest-valid-obstacle-course-at-each-position,"['Array', 'Binary Search', 'Binary Indexed Tree']",True,False
72.79016799862941,Easy,1965,False,False,Employees With Missing Information,employees-with-missing-information,['Database'],True,False
62.44639575250153,Medium,1966,False,True,Binary Searchable Numbers in an Unsorted Array,binary-searchable-numbers-in-an-unsorted-array,"['Array', 'Binary Search']",False,False
81.69474455227981,Easy,1967,False,False,Number of Strings That Appear as Substrings in Word,number-of-strings-that-appear-as-substrings-in-word,"['Array', 'String']",False,False
49.96741330223305,Medium,1968,False,False,Array With Elements Not Equal to Average of Neighbors,array-with-elements-not-equal-to-average-of-neighbors,"['Array', 'Greedy', 'Sorting']",False,False
36.19068092653303,Medium,1969,False,False,Minimum Non-Zero Product of the Array Elements,minimum-non-zero-product-of-the-array-elements,"['Math', 'Greedy', 'Recursion']",False,False
62.13077377196018,Hard,1970,False,False,Last Day Where You Can Still Cross,last-day-where-you-can-still-cross,"['Array', 'Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']",True,False
53.89967198044418,Easy,1971,False,False,Find if Path Exists in Graph,find-if-path-exists-in-graph,"['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
50.95746167823697,Hard,1972,False,True,First and Last Call On the Same Day,first-and-last-call-on-the-same-day,['Database'],True,False
76.9730010384216,Medium,1973,False,True,Count Nodes Equal to Sum of Descendants,count-nodes-equal-to-sum-of-descendants,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
77.03590041333167,Easy,1974,False,False,Minimum Time to Type Word Using Special Typewriter,minimum-time-to-type-word-using-special-typewriter,"['String', 'Greedy']",False,False
65.94546586027515,Medium,1975,False,False,Maximum Matrix Sum,maximum-matrix-sum,"['Array', 'Greedy', 'Matrix']",True,False
37.83673224840763,Medium,1976,False,False,Number of Ways to Arrive at Destination,number-of-ways-to-arrive-at-destination,"['Dynamic Programming', 'Graph', 'Topological Sort', 'Shortest Path']",True,False
20.91752518640788,Hard,1977,False,False,Number of Ways to Separate Numbers,number-of-ways-to-separate-numbers,"['String', 'Dynamic Programming', 'Suffix Array']",False,False
48.829022345535364,Easy,1978,False,False,Employees Whose Manager Left the Company,employees-whose-manager-left-the-company,['Database'],False,False
78.42926068948609,Easy,1979,False,False,Find Greatest Common Divisor of Array,find-greatest-common-divisor-of-array,"['Array', 'Math', 'Number Theory']",False,False
79.34988283699491,Medium,1980,False,False,Find Unique Binary String,find-unique-binary-string,"['Array', 'Hash Table', 'String', 'Backtracking']",True,False
35.708086446870745,Medium,1981,False,False,Minimize the Difference Between Target and Chosen Elements,minimize-the-difference-between-target-and-chosen-elements,"['Array', 'Dynamic Programming', 'Matrix']",False,False
48.51791771125203,Hard,1982,False,False,Find Array Given Subset Sums,find-array-given-subset-sums,"['Array', 'Divide and Conquer']",False,False
52.973061760841,Medium,1983,False,True,Widest Pair of Indices With Equal Range Sum,widest-pair-of-indices-with-equal-range-sum,"['Array', 'Hash Table', 'Prefix Sum']",False,False
58.19545071609099,Easy,1984,False,False,Minimum Difference Between Highest and Lowest of K Scores,minimum-difference-between-highest-and-lowest-of-k-scores,"['Array', 'Sliding Window', 'Sorting']",False,False
46.60746786646921,Medium,1985,False,False,Find the Kth Largest Integer in the Array,find-the-kth-largest-integer-in-the-array,"['Array', 'String', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Quickselect']",False,False
33.531647847406546,Medium,1986,False,False,Minimum Number of Work Sessions to Finish the Tasks,minimum-number-of-work-sessions-to-finish-the-tasks,"['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']",False,False
52.0147690559875,Hard,1987,False,False,Number of Unique Good Subsequences,number-of-unique-good-subsequences,"['String', 'Dynamic Programming']",False,False
66.9126234207453,Medium,1988,False,True,Find Cutoff Score for Each School,find-cutoff-score-for-each-school,['Database'],True,False
49.989764585465714,Medium,1989,False,True,Maximum Number of People That Can Be Caught in Tag,maximum-number-of-people-that-can-be-caught-in-tag,"['Array', 'Greedy']",False,False
49.01754999708472,Medium,1990,False,True,Count the Number of Experiments,count-the-number-of-experiments,['Database'],False,False
67.86643256600338,Easy,1991,False,False,Find the Middle Index in Array,find-the-middle-index-in-array,"['Array', 'Prefix Sum']",False,False
75.49192797873467,Medium,1992,False,False,Find All Groups of Farmland,find-all-groups-of-farmland,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix']",True,False
47.09192358615472,Medium,1993,False,False,Operations on Tree,operations-on-tree,"['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Design']",False,False
35.66888562939561,Hard,1994,False,False,The Number of Good Subsets,the-number-of-good-subsets,"['Array', 'Math', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']",False,False
62.46542035206113,Easy,1995,False,False,Count Special Quadruplets,count-special-quadruplets,"['Array', 'Hash Table', 'Enumeration']",False,False
44.13584815088905,Medium,1996,False,False,The Number of Weak Characters in the Game,the-number-of-weak-characters-in-the-game,"['Array', 'Stack', 'Greedy', 'Sorting', 'Monotonic Stack']",True,False
39.43289718406369,Medium,1997,False,False,First Day Where You Have Been in All the Rooms,first-day-where-you-have-been-in-all-the-rooms,"['Array', 'Dynamic Programming']",False,False
46.222391148274845,Hard,1998,False,False,GCD Sort of an Array,gcd-sort-of-an-array,"['Array', 'Math', 'Union Find', 'Sorting', 'Number Theory']",False,False
48.105745212323065,Medium,1999,False,True,Smallest Greater Multiple Made of Two Digits,smallest-greater-multiple-made-of-two-digits,"['Math', 'Enumeration']",False,False
86.38520722589332,Easy,2000,False,False,Reverse Prefix of Word,reverse-prefix-of-word,"['Two Pointers', 'String', 'Stack']",True,False
51.34219304283369,Medium,2001,False,False,Number of Pairs of Interchangeable Rectangles,number-of-pairs-of-interchangeable-rectangles,"['Array', 'Hash Table', 'Math', 'Counting', 'Number Theory']",False,False
61.07381380019879,Medium,2002,False,False,Maximum Product of the Length of Two Palindromic Subsequences,maximum-product-of-the-length-of-two-palindromic-subsequences,"['String', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']",False,False
46.34241434767776,Hard,2003,False,False,Smallest Missing Genetic Value in Each Subtree,smallest-missing-genetic-value-in-each-subtree,"['Dynamic Programming', 'Tree', 'Depth-First Search', 'Union Find']",False,False
44.85463774803876,Hard,2004,False,True,The Number of Seniors and Juniors to Join the Company,the-number-of-seniors-and-juniors-to-join-the-company,['Database'],True,False
57.056603773584904,Hard,2005,False,True,Subtree Removal Game with Fibonacci Tree,subtree-removal-game-with-fibonacci-tree,"['Math', 'Dynamic Programming', 'Tree', 'Binary Tree', 'Game Theory']",False,False
84.59781612807564,Easy,2006,False,False,Count Number of Pairs With Absolute Difference K,count-number-of-pairs-with-absolute-difference-k,"['Array', 'Hash Table', 'Counting']",False,False
40.44640943798428,Medium,2007,False,False,Find Original Array From Doubled Array,find-original-array-from-doubled-array,"['Array', 'Hash Table', 'Greedy', 'Sorting']",True,False
44.61702561152458,Medium,2008,False,False,Maximum Earnings From Taxi,maximum-earnings-from-taxi,"['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming', 'Sorting']",False,False
52.22761701301224,Hard,2009,False,False,Minimum Number of Operations to Make Array Continuous,minimum-number-of-operations-to-make-array-continuous,"['Array', 'Hash Table', 'Binary Search', 'Sliding Window']",True,False
64.22660098522167,Hard,2010,False,True,The Number of Seniors and Juniors to Join the Company II,the-number-of-seniors-and-juniors-to-join-the-company-ii,['Database'],False,False
89.51052034290797,Easy,2011,False,False,Final Value of Variable After Performing Operations,final-value-of-variable-after-performing-operations,"['Array', 'String', 'Simulation']",False,False
49.83802903220158,Medium,2012,False,False,Sum of Beauty in the Array,sum-of-beauty-in-the-array,['Array'],False,False
51.972535299411724,Medium,2013,False,False,Detect Squares,detect-squares,"['Array', 'Hash Table', 'Design', 'Counting']",False,False
53.99125961166122,Hard,2014,False,False,Longest Subsequence Repeated k Times,longest-subsequence-repeated-k-times,"['String', 'Backtracking', 'Greedy', 'Counting', 'Enumeration']",False,False
57.26415094339623,Medium,2015,False,True,Average Height of Buildings in Each Segment,average-height-of-buildings-in-each-segment,"['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",False,False
58.88786504853353,Easy,2016,False,False,Maximum Difference Between Increasing Elements,maximum-difference-between-increasing-elements,['Array'],False,False
61.01648339065956,Medium,2017,False,False,Grid Game,grid-game,"['Array', 'Matrix', 'Prefix Sum']",True,False
49.89306268470991,Medium,2018,False,False,Check if Word Can Be Placed In Crossword,check-if-word-can-be-placed-in-crossword,"['Array', 'Matrix', 'Enumeration']",False,False
32.99975690786808,Hard,2019,False,False,The Score of Students Solving Math Expression,the-score-of-students-solving-math-expression,"['Array', 'Math', 'String', 'Dynamic Programming', 'Stack', 'Memoization']",False,False
72.27646606308066,Medium,2020,False,True,Number of Accounts That Did Not Stream,number-of-accounts-that-did-not-stream,['Database'],False,False
60.90341478455253,Medium,2021,False,True,Brightest Position on Street,brightest-position-on-street,"['Array', 'Sorting', 'Prefix Sum', 'Ordered Set']",False,False
71.71614383878624,Easy,2022,False,False,Convert 1D Array Into 2D Array,convert-1d-array-into-2d-array,"['Array', 'Matrix', 'Simulation']",True,False
74.7445652173913,Medium,2023,False,False,Number of Pairs of Strings With Concatenation Equal to Target,number-of-pairs-of-strings-with-concatenation-equal-to-target,"['Array', 'Hash Table', 'String', 'Counting']",False,False
68.28476795299295,Medium,2024,False,False,Maximize the Confusion of an Exam,maximize-the-confusion-of-an-exam,"['String', 'Binary Search', 'Sliding Window', 'Prefix Sum']",True,False
34.51202263083451,Hard,2025,False,False,Maximum Number of Ways to Partition an Array,maximum-number-of-ways-to-partition-an-array,"['Array', 'Hash Table', 'Counting', 'Enumeration', 'Prefix Sum']",False,False
84.57608563435105,Easy,2026,False,True,Low-Quality Problems,low-quality-problems,['Database'],False,False
56.23691295243793,Easy,2027,False,False,Minimum Moves to Convert String,minimum-moves-to-convert-string,"['String', 'Greedy']",False,False
57.39533351042546,Medium,2028,False,False,Find Missing Observations,find-missing-observations,"['Array', 'Math', 'Simulation']",True,False
28.643465081030662,Medium,2029,False,False,Stone Game IX,stone-game-ix,"['Array', 'Math', 'Greedy', 'Counting', 'Game Theory']",False,False
38.73076772501272,Hard,2030,False,False,Smallest K-Length Subsequence With Occurrences of a Letter,smallest-k-length-subsequence-with-occurrences-of-a-letter,"['String', 'Stack', 'Greedy', 'Monotonic Stack']",False,False
51.19294040745179,Medium,2031,False,True,Count Subarrays With More Ones Than Zeros,count-subarrays-with-more-ones-than-zeros,"['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']",False,False
76.23241299058499,Easy,2032,False,False,Two Out of Three,two-out-of-three,"['Array', 'Hash Table', 'Bit Manipulation']",False,False
67.43509700088836,Medium,2033,False,False,Minimum Operations to Make a Uni-Value Grid,minimum-operations-to-make-a-uni-value-grid,"['Array', 'Math', 'Sorting', 'Matrix']",True,False
48.82513195981611,Medium,2034,False,False,Stock Price Fluctuation ,stock-price-fluctuation,"['Hash Table', 'Design', 'Heap (Priority Queue)', 'Data Stream', 'Ordered Set']",True,False
21.391969364942337,Hard,2035,False,False,Partition Array Into Two Arrays to Minimize Sum Difference,partition-array-into-two-arrays-to-minimize-sum-difference,"['Array', 'Two Pointers', 'Binary Search', 'Dynamic Programming', 'Bit Manipulation', 'Ordered Set', 'Bitmask']",False,False
39.6027911969941,Medium,2036,False,True,Maximum Alternating Subarray Sum,maximum-alternating-subarray-sum,"['Array', 'Dynamic Programming']",False,False
87.27371997911001,Easy,2037,False,False,Minimum Number of Moves to Seat Everyone,minimum-number-of-moves-to-seat-everyone,"['Array', 'Greedy', 'Sorting', 'Counting Sort']",True,False
62.762366489894184,Medium,2038,False,False,Remove Colored Pieces if Both Neighbors are the Same Color,remove-colored-pieces-if-both-neighbors-are-the-same-color,"['Math', 'String', 'Greedy', 'Game Theory']",True,False
53.23903002309469,Medium,2039,False,False,The Time When the Network Becomes Idle,the-time-when-the-network-becomes-idle,"['Array', 'Breadth-First Search', 'Graph']",False,False
30.35052840849639,Hard,2040,False,False,Kth Smallest Product of Two Sorted Arrays,kth-smallest-product-of-two-sorted-arrays,"['Array', 'Binary Search']",False,False
78.67052364366255,Medium,2041,False,True,Accepted Candidates From the Interviews,accepted-candidates-from-the-interviews,['Database'],True,False
71.3742563334778,Easy,2042,False,False,Check if Numbers Are Ascending in a Sentence,check-if-numbers-are-ascending-in-a-sentence,['String'],False,False
63.3451762776715,Medium,2043,False,False,Simple Bank System,simple-bank-system,"['Array', 'Hash Table', 'Design', 'Simulation']",False,False
87.94816334372463,Medium,2044,False,False,Count Number of Maximum Bitwise-OR Subsets,count-number-of-maximum-bitwise-or-subsets,"['Array', 'Backtracking', 'Bit Manipulation', 'Enumeration']",True,False
62.64484304281179,Hard,2045,False,False,Second Minimum Time to Reach Destination,second-minimum-time-to-reach-destination,"['Breadth-First Search', 'Graph', 'Shortest Path']",True,False
66.86485403166544,Medium,2046,False,True,Sort Linked List Already Sorted Using Absolute Values,sort-linked-list-already-sorted-using-absolute-values,"['Linked List', 'Two Pointers', 'Sorting']",False,False
29.73962068198116,Easy,2047,False,False,Number of Valid Words in a Sentence,number-of-valid-words-in-a-sentence,['String'],False,False
48.935568063897364,Medium,2048,False,False,Next Greater Numerically Balanced Number,next-greater-numerically-balanced-number,"['Hash Table', 'Math', 'Backtracking', 'Counting', 'Enumeration']",False,False
50.83975647062352,Medium,2049,False,False,Count Nodes With the Highest Score,count-nodes-with-the-highest-score,"['Array', 'Tree', 'Depth-First Search', 'Binary Tree']",False,False
66.78001342834247,Hard,2050,False,False,Parallel Courses III,parallel-courses-iii,"['Array', 'Dynamic Programming', 'Graph', 'Topological Sort']",True,False
70.58204241239284,Medium,2051,False,True,The Category of Each Member in the Store,the-category-of-each-member-in-the-store,['Database'],False,False
50.26261703585293,Medium,2052,False,True,Minimum Cost to Separate Sentence Into Rows,minimum-cost-to-separate-sentence-into-rows,"['Array', 'Dynamic Programming']",False,False
81.98001948034855,Easy,2053,False,False,Kth Distinct String in an Array,kth-distinct-string-in-an-array,"['Array', 'Hash Table', 'String', 'Counting']",True,False
61.07380585786796,Medium,2054,False,False,Two Best Non-Overlapping Events,two-best-non-overlapping-events,"['Array', 'Binary Search', 'Dynamic Programming', 'Sorting', 'Heap (Priority Queue)']",True,False
46.40864642305713,Medium,2055,False,False,Plates Between Candles,plates-between-candles,"['Array', 'String', 'Binary Search', 'Prefix Sum']",False,False
47.485006771135616,Hard,2056,False,False,Number of Valid Move Combinations On Chessboard,number-of-valid-move-combinations-on-chessboard,"['Array', 'String', 'Backtracking', 'Simulation']",False,False
72.39783148597327,Easy,2057,False,False,Smallest Index With Equal Value,smallest-index-with-equal-value,['Array'],False,False
69.44753333209364,Medium,2058,False,False,Find the Minimum and Maximum Number of Nodes Between Critical Points,find-the-minimum-and-maximum-number-of-nodes-between-critical-points,['Linked List'],True,False
50.28800930085081,Medium,2059,False,False,Minimum Operations to Convert Number,minimum-operations-to-convert-number,"['Array', 'Breadth-First Search']",False,False
43.02224314463928,Hard,2060,False,False,Check if an Original String Exists Given Two Encoded Strings,check-if-an-original-string-exists-given-two-encoded-strings,"['String', 'Dynamic Programming']",False,False
61.87906976744186,Medium,2061,False,True,Number of Spaces Cleaning Robot Cleaned,number-of-spaces-cleaning-robot-cleaned,"['Array', 'Matrix', 'Simulation']",True,False
70.6692622344882,Easy,2062,False,False,Count Vowel Substrings of a String,count-vowel-substrings-of-a-string,"['Hash Table', 'String']",False,False
54.53969690115359,Medium,2063,False,False,Vowels of All Substrings,vowels-of-all-substrings,"['Math', 'String', 'Dynamic Programming', 'Combinatorics']",False,False
62.541394422497895,Medium,2064,False,False,Minimized Maximum of Products Distributed to Any Store,minimized-maximum-of-products-distributed-to-any-store,"['Array', 'Binary Search', 'Greedy']",True,False
59.39557773618909,Hard,2065,False,False,Maximum Path Quality of a Graph,maximum-path-quality-of-a-graph,"['Array', 'Backtracking', 'Graph']",False,False
82.24278475435118,Medium,2066,False,True,Account Balance,account-balance,['Database'],False,False
44.62610560171536,Medium,2067,False,True,Number of Equal Count Substrings,number-of-equal-count-substrings,"['Hash Table', 'String', 'Sliding Window', 'Counting']",False,False
63.631719256527674,Easy,2068,False,False,Check Whether Two Strings are Almost Equivalent,check-whether-two-strings-are-almost-equivalent,"['Hash Table', 'String', 'Counting']",True,False
26.678712341900514,Medium,2069,False,False,Walking Robot Simulation II,walking-robot-simulation-ii,"['Design', 'Simulation']",False,False
62.04805929864846,Medium,2070,False,False,Most Beautiful Item for Each Query,most-beautiful-item-for-each-query,"['Array', 'Binary Search', 'Sorting']",True,False
34.46208007637687,Hard,2071,False,False,Maximum Number of Tasks You Can Assign,maximum-number-of-tasks-you-can-assign,"['Array', 'Binary Search', 'Greedy', 'Queue', 'Sorting', 'Monotonic Queue']",False,False
75.31794901306324,Easy,2072,False,True,The Winner University,the-winner-university,['Database'],True,False
70.46336583715984,Easy,2073,False,False,Time Needed to Buy Tickets,time-needed-to-buy-tickets,"['Array', 'Queue', 'Simulation']",True,False
60.27862306731632,Medium,2074,False,False,Reverse Nodes in Even Length Groups,reverse-nodes-in-even-length-groups,['Linked List'],False,False
48.957438979516745,Medium,2075,False,False,Decode the Slanted Ciphertext,decode-the-slanted-ciphertext,"['String', 'Simulation']",False,False
56.67599840027424,Hard,2076,False,False,Process Restricted Friend Requests,process-restricted-friend-requests,"['Union Find', 'Graph']",False,False
55.844808523469695,Medium,2077,False,True,Paths in Maze That Lead to Same Room,paths-in-maze-that-lead-to-same-room,['Graph'],False,False
65.48494801704715,Easy,2078,False,False,Two Furthest Houses With Different Colors,two-furthest-houses-with-different-colors,"['Array', 'Greedy']",False,False
79.934241302343,Medium,2079,False,False,Watering Plants,watering-plants,"['Array', 'Simulation']",False,False
41.4439793947199,Medium,2080,False,False,Range Frequency Queries,range-frequency-queries,"['Array', 'Hash Table', 'Binary Search', 'Design', 'Segment Tree']",False,False
41.407511590352655,Hard,2081,False,False,Sum of k-Mirror Numbers,sum-of-k-mirror-numbers,"['Math', 'Enumeration']",False,False
77.51854857407837,Easy,2082,False,True,The Number of Rich Customers,the-number-of-rich-customers,['Database'],True,False
74.18193898455236,Medium,2083,False,True,Substrings That Begin and End With the Same Letter,substrings-that-begin-and-end-with-the-same-letter,"['Hash Table', 'Math', 'String', 'Counting', 'Prefix Sum']",True,False
87.19749130820097,Medium,2084,False,True,Drop Type 1 Orders for Customers With Type 0 Orders,drop-type-1-orders-for-customers-with-type-0-orders,['Database'],False,False
72.09448373852905,Easy,2085,False,False,Count Common Words With One Occurrence,count-common-words-with-one-occurrence,"['Array', 'Hash Table', 'String', 'Counting']",False,False
46.81952103951046,Medium,2086,False,False,Minimum Number of Food Buckets to Feed the Hamsters,minimum-number-of-food-buckets-to-feed-the-hamsters,"['String', 'Dynamic Programming', 'Greedy']",False,False
50.993300455941196,Medium,2087,False,False,Minimum Cost Homecoming of a Robot in a Grid,minimum-cost-homecoming-of-a-robot-in-a-grid,"['Array', 'Greedy']",False,False
65.16,Hard,2088,False,False,Count Fertile Pyramids in a Land,count-fertile-pyramids-in-a-land,"['Array', 'Dynamic Programming', 'Matrix']",False,False
77.10495291101759,Easy,2089,False,False,Find Target Indices After Sorting Array,find-target-indices-after-sorting-array,"['Array', 'Binary Search', 'Sorting']",False,False
45.96699742784317,Medium,2090,False,False,K Radius Subarray Averages,k-radius-subarray-averages,"['Array', 'Sliding Window']",True,False
55.01422706835509,Medium,2091,False,False,Removing Minimum and Maximum From Array,removing-minimum-and-maximum-from-array,"['Array', 'Greedy']",False,False
45.346111478299186,Hard,2092,False,False,Find All People With Secret,find-all-people-with-secret,"['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph', 'Sorting']",True,False
59.85873403966313,Medium,2093,False,True,Minimum Cost to Reach City With Discounts,minimum-cost-to-reach-city-with-discounts,"['Graph', 'Heap (Priority Queue)', 'Shortest Path']",True,False
63.640386346643886,Easy,2094,False,False,Finding 3-Digit Even Numbers,finding-3-digit-even-numbers,"['Array', 'Hash Table', 'Sorting', 'Enumeration']",False,False
59.6057204562572,Medium,2095,False,False,Delete the Middle Node of a Linked List,delete-the-middle-node-of-a-linked-list,"['Linked List', 'Two Pointers']",True,False
56.25753417462214,Medium,2096,False,False,Step-By-Step Directions From a Binary Tree Node to Another,step-by-step-directions-from-a-binary-tree-node-to-another,"['String', 'Tree', 'Depth-First Search', 'Binary Tree']",True,False
66.35823399243344,Hard,2097,False,False,Valid Arrangement of Pairs,valid-arrangement-of-pairs,"['Depth-First Search', 'Graph', 'Eulerian Circuit']",True,False
35.597047329570124,Medium,2098,False,True,Subsequence of Size K With the Largest Even Sum,subsequence-of-size-k-with-the-largest-even-sum,"['Array', 'Greedy', 'Sorting']",False,False
45.10410705327935,Easy,2099,False,False,Find Subsequence of Length K With the Largest Sum,find-subsequence-of-length-k-with-the-largest-sum,"['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)']",False,False
50.04530092759042,Medium,2100,False,False,Find Good Days to Rob the Bank,find-good-days-to-rob-the-bank,"['Array', 'Dynamic Programming', 'Prefix Sum']",False,False
49.04010947401985,Medium,2101,False,False,Detonate the Maximum Bombs,detonate-the-maximum-bombs,"['Array', 'Math', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Geometry']",True,False
64.38310731132076,Hard,2102,False,False,Sequentially Ordinal Rank Tracker,sequentially-ordinal-rank-tracker,"['Design', 'Heap (Priority Queue)', 'Data Stream', 'Ordered Set']",False,False
81.02002882937562,Easy,2103,False,False,Rings and Rods,rings-and-rods,"['Hash Table', 'String']",False,False
60.1071108285511,Medium,2104,False,False,Sum of Subarray Ranges,sum-of-subarray-ranges,"['Array', 'Stack', 'Monotonic Stack']",True,False
48.09399583409169,Medium,2105,False,False,Watering Plants II,watering-plants-ii,"['Array', 'Two Pointers', 'Simulation']",False,False
36.126032461156356,Hard,2106,False,False,Maximum Fruits Harvested After at Most K Steps,maximum-fruits-harvested-after-at-most-k-steps,"['Array', 'Binary Search', 'Sliding Window', 'Prefix Sum']",False,False
59.74145891043398,Medium,2107,False,True,Number of Unique Flavors After Sharing K Candies,number-of-unique-flavors-after-sharing-k-candies,"['Array', 'Hash Table', 'Sliding Window']",True,False
83.85149319685685,Easy,2108,False,False,Find First Palindromic String in the Array,find-first-palindromic-string-in-the-array,"['Array', 'Two Pointers', 'String']",True,False
71.72974820232596,Medium,2109,False,False,Adding Spaces to a String,adding-spaces-to-a-string,"['Array', 'Two Pointers', 'String', 'Simulation']",True,False
59.043025764690945,Medium,2110,False,False,Number of Smooth Descent Periods of a Stock,number-of-smooth-descent-periods-of-a-stock,"['Array', 'Math', 'Dynamic Programming']",False,False
38.844126403190124,Hard,2111,False,False,Minimum Operations to Make the Array K-Increasing,minimum-operations-to-make-the-array-k-increasing,"['Array', 'Binary Search']",False,False
71.34372161274544,Medium,2112,False,True,The Airport With the Most Traffic,the-airport-with-the-most-traffic,['Database'],False,False
69.67316153362665,Medium,2113,False,True,Elements in Array After Removing and Replacing Elements,elements-in-array-after-removing-and-replacing-elements,['Array'],False,False
86.60905601138754,Easy,2114,False,False,Maximum Number of Words Found in Sentences,maximum-number-of-words-found-in-sentences,"['Array', 'String']",False,False
56.38883660903934,Medium,2115,False,False,Find All Possible Recipes from Given Supplies,find-all-possible-recipes-from-given-supplies,"['Array', 'Hash Table', 'String', 'Graph', 'Topological Sort']",True,False
44.751141791090646,Medium,2116,False,False,Check if a Parentheses String Can Be Valid,check-if-a-parentheses-string-can-be-valid,"['String', 'Stack', 'Greedy']",True,False
24.31544359255203,Hard,2117,False,False,Abbreviating the Product of a Range,abbreviating-the-product-of-a-range,['Math'],False,False
56.29747394453277,Hard,2118,False,True,Build the Equation,build-the-equation,['Database'],False,False
80.94445821091011,Easy,2119,False,False,A Number After a Double Reversal,a-number-after-a-double-reversal,['Math'],False,False
81.46022486710261,Medium,2120,False,False,Execution of All Suffix Instructions Staying in a Grid,execution-of-all-suffix-instructions-staying-in-a-grid,"['String', 'Simulation']",False,False
44.77028536219047,Medium,2121,False,False,Intervals Between Identical Elements,intervals-between-identical-elements,"['Array', 'Hash Table', 'Prefix Sum']",False,False
39.7025877463554,Hard,2122,False,False,Recover the Original Array,recover-the-original-array,"['Array', 'Hash Table', 'Two Pointers', 'Sorting', 'Enumeration']",False,False
40.6829992576095,Hard,2123,False,True,Minimum Operations to Remove Adjacent Ones in Matrix,minimum-operations-to-remove-adjacent-ones-in-matrix,"['Array', 'Graph', 'Matrix']",False,False
72.3401704096603,Easy,2124,False,False,Check if All A's Appears Before All B's,check-if-all-as-appears-before-all-bs,['String'],False,False
85.40692738803591,Medium,2125,False,False,Number of Laser Beams in a Bank,number-of-laser-beams-in-a-bank,"['Array', 'Math', 'String', 'Matrix']",True,False
52.4455366003497,Medium,2126,False,False,Destroying Asteroids,destroying-asteroids,"['Array', 'Greedy', 'Sorting']",False,False
62.17260467362633,Hard,2127,False,False,Maximum Employees to Be Invited to a Meeting,maximum-employees-to-be-invited-to-a-meeting,"['Depth-First Search', 'Graph', 'Topological Sort']",True,False
76.18141523583533,Medium,2128,False,True,Remove All Ones With Row and Column Flips,remove-all-ones-with-row-and-column-flips,"['Array', 'Math', 'Bit Manipulation', 'Matrix']",False,False
66.13072648414204,Easy,2129,False,False,Capitalize the Title,capitalize-the-title,['String'],False,False
81.30821277342905,Medium,2130,False,False,Maximum Twin Sum of a Linked List,maximum-twin-sum-of-a-linked-list,"['Linked List', 'Two Pointers', 'Stack']",True,False
47.83898415341781,Medium,2131,False,False,Longest Palindrome by Concatenating Two Letter Words,longest-palindrome-by-concatenating-two-letter-words,"['Array', 'Hash Table', 'String', 'Greedy', 'Counting']",True,False
32.78508341511285,Hard,2132,False,False,Stamping the Grid,stamping-the-grid,"['Array', 'Greedy', 'Matrix', 'Prefix Sum']",False,False
52.578226565652045,Easy,2133,False,False,Check if Every Row and Column Contains All Numbers,check-if-every-row-and-column-contains-all-numbers,"['Array', 'Hash Table', 'Matrix']",False,False
65.47425967388466,Medium,2134,False,False,Minimum Swaps to Group All 1's Together II,minimum-swaps-to-group-all-1s-together-ii,"['Array', 'Sliding Window']",True,False
43.34879095208909,Medium,2135,False,False,Count Words Obtained After Adding a Letter,count-words-obtained-after-adding-a-letter,"['Array', 'Hash Table', 'String', 'Bit Manipulation', 'Sorting']",False,False
71.06633020029501,Hard,2136,False,False,Earliest Possible Day of Full Bloom,earliest-possible-day-of-full-bloom,"['Array', 'Greedy', 'Sorting']",True,False
66.85308668530867,Medium,2137,False,True,Pour Water Between Buckets to Make Water Levels Equal,pour-water-between-buckets-to-make-water-levels-equal,"['Array', 'Binary Search']",False,False
67.31062910495015,Easy,2138,False,False,Divide a String Into Groups of Size k,divide-a-string-into-groups-of-size-k,"['String', 'Simulation']",False,False
51.33655361565385,Medium,2139,False,False,Minimum Moves to Reach Target Score,minimum-moves-to-reach-target-score,"['Math', 'Greedy']",False,False
60.358397751229795,Medium,2140,False,False,Solving Questions With Brainpower,solving-questions-with-brainpower,"['Array', 'Dynamic Programming']",True,False
49.839058296661435,Hard,2141,False,False,Maximum Running Time of N Computers,maximum-running-time-of-n-computers,"['Array', 'Binary Search', 'Greedy', 'Sorting']",True,False
48.80515985337107,Medium,2142,False,True,The Number of Passengers in Each Bus I,the-number-of-passengers-in-each-bus-i,['Database'],False,False
52.33487589398401,Hard,2143,False,True,Choose Numbers From Two Arrays in Range,choose-numbers-from-two-arrays-in-range,"['Array', 'Dynamic Programming']",False,False
61.89046301674658,Easy,2144,False,False,Minimum Cost of Buying Candies With Discount,minimum-cost-of-buying-candies-with-discount,"['Array', 'Greedy', 'Sorting']",False,False
39.282870036785624,Medium,2145,False,False,Count the Hidden Sequences,count-the-hidden-sequences,"['Array', 'Prefix Sum']",False,False
44.262773013289284,Medium,2146,False,False,K Highest Ranked Items Within a Price Range,k-highest-ranked-items-within-a-price-range,"['Array', 'Breadth-First Search', 'Sorting', 'Heap (Priority Queue)', 'Matrix']",False,False
48.8226502937348,Hard,2147,False,False,Number of Ways to Divide a Long Corridor,number-of-ways-to-divide-a-long-corridor,"['Math', 'String', 'Dynamic Programming']",True,False
59.12581834665643,Easy,2148,False,False,Count Elements With Strictly Smaller and Greater Elements ,count-elements-with-strictly-smaller-and-greater-elements,"['Array', 'Sorting', 'Counting']",False,False
84.238133144688,Medium,2149,False,False,Rearrange Array Elements by Sign,rearrange-array-elements-by-sign,"['Array', 'Two Pointers', 'Simulation']",True,False
61.31708415061578,Medium,2150,False,False,Find All Lonely Numbers in the Array,find-all-lonely-numbers-in-the-array,"['Array', 'Hash Table', 'Counting']",False,False
50.678899082568805,Hard,2151,False,False,Maximum Good People Based on Statements,maximum-good-people-based-on-statements,"['Array', 'Backtracking', 'Bit Manipulation', 'Enumeration']",False,False
42.58827746908048,Medium,2152,False,True,Minimum Number of Lines to Cover Points,minimum-number-of-lines-to-cover-points,"['Array', 'Hash Table', 'Math', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Geometry', 'Bitmask']",False,False
39.71672040534316,Hard,2153,False,True,The Number of Passengers in Each Bus II,the-number-of-passengers-in-each-bus-ii,['Database'],True,False
71.26909086455437,Easy,2154,False,False,Keep Multiplying Found Values by Two,keep-multiplying-found-values-by-two,"['Array', 'Hash Table', 'Sorting', 'Simulation']",False,False
64.19688006403874,Medium,2155,False,False,All Divisions With the Highest Score of a Binary Array,all-divisions-with-the-highest-score-of-a-binary-array,['Array'],False,False
24.493305285652276,Hard,2156,False,False,Find Substring With Given Hash Value,find-substring-with-given-hash-value,"['String', 'Sliding Window', 'Rolling Hash', 'Hash Function']",False,False
26.460698303542085,Hard,2157,False,False,Groups of Strings,groups-of-strings,"['String', 'Bit Manipulation', 'Union Find']",False,False
55.433032276132465,Hard,2158,False,True,Amount of New Area Painted Each Day,amount-of-new-area-painted-each-day,"['Array', 'Segment Tree', 'Ordered Set']",False,False
60.794028273219716,Medium,2159,False,True,Order Two Columns Independently,order-two-columns-independently,['Database'],False,False
86.01441575969905,Easy,2160,False,False,Minimum Sum of Four Digit Number After Splitting Digits,minimum-sum-of-four-digit-number-after-splitting-digits,"['Math', 'Greedy', 'Sorting']",False,False
89.93935316982846,Medium,2161,False,False,Partition Array According to Given Pivot,partition-array-according-to-given-pivot,"['Array', 'Two Pointers', 'Simulation']",True,False
40.8007145965507,Medium,2162,False,False,Minimum Cost to Set Cooking Time,minimum-cost-to-set-cooking-time,"['Math', 'Enumeration']",False,False
48.69787746500076,Hard,2163,False,False,Minimum Difference in Sums After Removal of Elements,minimum-difference-in-sums-after-removal-of-elements,"['Array', 'Dynamic Programming', 'Heap (Priority Queue)']",False,False
62.45458281956432,Easy,2164,False,False,Sort Even and Odd Indices Independently,sort-even-and-odd-indices-independently,"['Array', 'Sorting']",False,False
52.471806156385185,Medium,2165,False,False,Smallest Value of the Rearranged Number,smallest-value-of-the-rearranged-number,"['Math', 'Sorting']",False,False
33.014021753374394,Medium,2166,False,False,Design Bitset,design-bitset,"['Array', 'Hash Table', 'String', 'Design']",False,False
41.132443865929055,Hard,2167,False,False,Minimum Time to Remove All Cars Containing Illegal Goods,minimum-time-to-remove-all-cars-containing-illegal-goods,"['String', 'Dynamic Programming']",False,False
64.05842094122627,Medium,2168,False,True,Unique Substrings With Equal Digit Frequency,unique-substrings-with-equal-digit-frequency,"['Hash Table', 'String', 'Rolling Hash', 'Counting', 'Hash Function']",True,False
74.6682740272697,Easy,2169,False,False,Count Operations to Obtain Zero,count-operations-to-obtain-zero,"['Math', 'Simulation']",False,False
33.71923365378059,Medium,2170,False,False,Minimum Operations to Make the Array Alternating,minimum-operations-to-make-the-array-alternating,"['Array', 'Hash Table', 'Greedy', 'Counting']",False,False
43.343860248093776,Medium,2171,False,False,Removing Minimum Number of Magic Beans,removing-minimum-number-of-magic-beans,"['Array', 'Greedy', 'Sorting', 'Enumeration', 'Prefix Sum']",False,False
49.58693441789527,Hard,2172,False,False,Maximum AND Sum of Array,maximum-and-sum-of-array,"['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']",False,False
53.7064524578713,Hard,2173,False,True,Longest Winning Streak,longest-winning-streak,['Database'],True,False
66.84837728194725,Medium,2174,False,True,Remove All Ones With Row and Column Flips II,remove-all-ones-with-row-and-column-flips-ii,"['Array', 'Bit Manipulation', 'Breadth-First Search', 'Matrix']",False,False
60.63060916527678,Medium,2175,False,True,The Change in Global Rankings,the-change-in-global-rankings,['Database'],False,False
79.46648223212487,Easy,2176,False,False,Count Equal and Divisible Pairs in an Array,count-equal-and-divisible-pairs-in-an-array,['Array'],False,False
64.52236269237036,Medium,2177,False,False,Find Three Consecutive Integers That Sum to a Given Number,find-three-consecutive-integers-that-sum-to-a-given-number,"['Math', 'Simulation']",False,False
59.32892670463868,Medium,2178,False,False,Maximum Split of Positive Even Integers,maximum-split-of-positive-even-integers,"['Math', 'Backtracking', 'Greedy']",False,False
42.11066889202722,Hard,2179,False,False,Count Good Triplets in an Array,count-good-triplets-in-an-array,"['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']",False,False
68.40089910001154,Easy,2180,False,False,Count Integers With Even Digit Sum,count-integers-with-even-digit-sum,"['Math', 'Simulation']",False,False
89.57174547646693,Medium,2181,False,False,Merge Nodes in Between Zeros,merge-nodes-in-between-zeros,"['Linked List', 'Simulation']",True,False
70.86633634234467,Medium,2182,False,False,Construct String With Repeat Limit,construct-string-with-repeat-limit,"['Hash Table', 'String', 'Greedy', 'Heap (Priority Queue)', 'Counting']",True,False
29.619947109935772,Hard,2183,False,False,Count Array Pairs Divisible by K,count-array-pairs-divisible-by-k,"['Array', 'Math', 'Number Theory']",False,False
49.448860625331214,Medium,2184,False,True,Number of Ways to Build Sturdy Brick Wall,number-of-ways-to-build-sturdy-brick-wall,"['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']",False,False
84.52472410218888,Easy,2185,False,False,Counting Words With a Given Prefix,counting-words-with-a-given-prefix,"['Array', 'String', 'String Matching']",True,False
72.63164222168791,Medium,2186,False,False,Minimum Number of Steps to Make Two Strings Anagram II,minimum-number-of-steps-to-make-two-strings-anagram-ii,"['Hash Table', 'String', 'Counting']",False,False
38.94636249155262,Medium,2187,False,False,Minimum Time to Complete Trips,minimum-time-to-complete-trips,"['Array', 'Binary Search']",True,False
41.95516096065406,Hard,2188,False,False,Minimum Time to Finish the Race,minimum-time-to-finish-the-race,"['Array', 'Dynamic Programming']",False,False
61.9209945859234,Medium,2189,False,True,Number of Ways to Build House of Cards,number-of-ways-to-build-house-of-cards,"['Math', 'Dynamic Programming']",False,False
59.0696596748034,Easy,2190,False,False,Most Frequent Number Following Key In an Array,most-frequent-number-following-key-in-an-array,"['Array', 'Hash Table', 'Counting']",False,False
59.97683277803652,Medium,2191,False,False,Sort the Jumbled Numbers,sort-the-jumbled-numbers,"['Array', 'Sorting']",True,False
61.87334693895162,Medium,2192,False,False,All Ancestors of a Node in a Directed Acyclic Graph,all-ancestors-of-a-node-in-a-directed-acyclic-graph,"['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']",True,False
51.76491797367947,Hard,2193,False,False,Minimum Number of Moves to Make Palindrome,minimum-number-of-moves-to-make-palindrome,"['Two Pointers', 'String', 'Greedy', 'Binary Indexed Tree']",False,False
83.78953868429738,Easy,2194,False,False,Cells in a Range on an Excel Sheet,cells-in-a-range-on-an-excel-sheet,['String'],False,False
25.938259002428808,Medium,2195,False,False,Append K Integers With Minimal Sum,append-k-integers-with-minimal-sum,"['Array', 'Math', 'Greedy', 'Sorting']",False,False
81.64832851561096,Medium,2196,False,False,Create Binary Tree From Descriptions,create-binary-tree-from-descriptions,"['Array', 'Hash Table', 'Tree', 'Binary Tree']",True,False
40.20469626111016,Hard,2197,False,False,Replace Non-Coprime Numbers in Array,replace-non-coprime-numbers-in-array,"['Array', 'Math', 'Stack', 'Number Theory']",False,False
54.08560311284047,Medium,2198,False,True,Number of Single Divisor Triplets,number-of-single-divisor-triplets,['Math'],False,False
49.98845798707294,Hard,2199,False,True,Finding the Topic of Each Post,finding-the-topic-of-each-post,['Database'],False,False
66.97495955445474,Easy,2200,False,False,Find All K-Distant Indices in an Array,find-all-k-distant-indices-in-an-array,"['Array', 'Two Pointers']",False,False
56.16828342471531,Medium,2201,False,False,Count Artifacts That Can Be Extracted,count-artifacts-that-can-be-extracted,"['Array', 'Hash Table', 'Simulation']",False,False
23.325518970487206,Medium,2202,False,False,Maximize the Topmost Element After K Moves,maximize-the-topmost-element-after-k-moves,"['Array', 'Greedy']",False,False
37.8595231991797,Hard,2203,False,False,Minimum Weighted Subgraph With the Required Paths,minimum-weighted-subgraph-with-the-required-paths,"['Graph', 'Shortest Path']",False,False
72.73383893102204,Hard,2204,False,True,Distance to a Cycle in Undirected Graph,distance-to-a-cycle-in-undirected-graph,"['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
50.756314182625594,Easy,2205,False,True,The Number of Users That Are Eligible for Discount,the-number-of-users-that-are-eligible-for-discount,['Database'],False,False
79.24435635228289,Easy,2206,False,False,Divide Array Into Equal Pairs,divide-array-into-equal-pairs,"['Array', 'Hash Table', 'Bit Manipulation', 'Counting']",True,False
34.98733040382333,Medium,2207,False,False,Maximize Number of Subsequences in a String,maximize-number-of-subsequences-in-a-string,"['String', 'Greedy', 'Prefix Sum']",False,False
48.67374891427808,Medium,2208,False,False,Minimum Operations to Halve Array Sum,minimum-operations-to-halve-array-sum,"['Array', 'Greedy', 'Heap (Priority Queue)']",False,False
36.730415879506225,Hard,2209,False,False,Minimum White Tiles After Covering With Carpets,minimum-white-tiles-after-covering-with-carpets,"['String', 'Dynamic Programming', 'Prefix Sum']",False,False
61.462238047007965,Easy,2210,False,False,Count Hills and Valleys in an Array,count-hills-and-valleys-in-an-array,['Array'],False,False
44.149092561409134,Medium,2211,False,False,Count Collisions on a Road,count-collisions-on-a-road,"['String', 'Stack', 'Simulation']",False,False
50.08096229470276,Medium,2212,False,False,Maximum Points in an Archery Competition,maximum-points-in-an-archery-competition,"['Array', 'Backtracking', 'Bit Manipulation', 'Enumeration']",False,False
32.76076526683646,Hard,2213,False,False,Longest Substring of One Repeating Character,longest-substring-of-one-repeating-character,"['Array', 'String', 'Segment Tree', 'Ordered Set']",False,False
58.54398226546383,Medium,2214,False,True,Minimum Health to Beat Game,minimum-health-to-beat-game,"['Array', 'Greedy']",True,False
80.581811638127,Easy,2215,False,False,Find the Difference of Two Arrays,find-the-difference-of-two-arrays,"['Array', 'Hash Table']",True,False
48.643484388551606,Medium,2216,False,False,Minimum Deletions to Make Array Beautiful,minimum-deletions-to-make-array-beautiful,"['Array', 'Stack', 'Greedy']",False,False
37.30230050323508,Medium,2217,False,False,Find Palindrome With Fixed Length,find-palindrome-with-fixed-length,"['Array', 'Math']",False,False
60.38900440413235,Hard,2218,False,False,Maximum Value of K Coins From Piles,maximum-value-of-k-coins-from-piles,"['Array', 'Dynamic Programming', 'Prefix Sum']",True,False
61.98588464346556,Medium,2219,False,True,Maximum Sum Score of Array,maximum-sum-score-of-array,"['Array', 'Prefix Sum']",False,False
87.47444075765553,Easy,2220,False,False,Minimum Bit Flips to Convert Number,minimum-bit-flips-to-convert-number,['Bit Manipulation'],True,False
78.73962405830932,Medium,2221,False,False,Find Triangular Sum of an Array,find-triangular-sum-of-an-array,"['Array', 'Math', 'Simulation', 'Combinatorics']",False,False
50.40352494211272,Medium,2222,False,False,Number of Ways to Select Buildings,number-of-ways-to-select-buildings,"['String', 'Dynamic Programming', 'Prefix Sum']",False,False
41.68888159783456,Hard,2223,False,False,Sum of Scores of Built Strings,sum-of-scores-of-built-strings,"['String', 'Binary Search', 'Rolling Hash', 'Suffix Array', 'String Matching', 'Hash Function']",False,False
65.37491741164732,Easy,2224,False,False,Minimum Number of Operations to Convert Time,minimum-number-of-operations-to-convert-time,"['String', 'Greedy']",False,False
72.67003638036297,Medium,2225,False,False,Find Players With Zero or One Losses,find-players-with-zero-or-one-losses,"['Array', 'Hash Table', 'Sorting', 'Counting']",True,False
50.19470560398648,Medium,2226,False,False,Maximum Candies Allocated to K Children,maximum-candies-allocated-to-k-children,"['Array', 'Binary Search']",True,False
41.32449228720453,Hard,2227,False,False,Encrypt and Decrypt Strings,encrypt-and-decrypt-strings,"['Array', 'Hash Table', 'String', 'Design', 'Trie']",False,False
45.8641499160579,Medium,2228,False,True,Users With Two Purchases Within Seven Days,users-with-two-purchases-within-seven-days,['Database'],False,False
61.68734054719803,Easy,2229,False,True,Check if an Array Is Consecutive,check-if-an-array-is-consecutive,"['Array', 'Hash Table', 'Sorting']",False,False
50.70500196927924,Easy,2230,False,True,The Users That Are Eligible for Discount,the-users-that-are-eligible-for-discount,['Database'],False,False
63.365702455706916,Easy,2231,False,False,Largest Number After Digit Swaps by Parity,largest-number-after-digit-swaps-by-parity,"['Sorting', 'Heap (Priority Queue)']",False,False
67.340321453529,Medium,2232,False,False,Minimize Result by Adding Parentheses to Expression,minimize-result-by-adding-parentheses-to-expression,"['String', 'Enumeration']",False,False
42.11555025508514,Medium,2233,False,False,Maximum Product After K Increments,maximum-product-after-k-increments,"['Array', 'Greedy', 'Heap (Priority Queue)']",False,False
29.887906876482003,Hard,2234,False,False,Maximum Total Beauty of the Gardens,maximum-total-beauty-of-the-gardens,"['Array', 'Two Pointers', 'Binary Search', 'Greedy', 'Sorting', 'Enumeration', 'Prefix Sum']",False,False
88.12465398556401,Easy,2235,False,False,Add Two Integers,add-two-integers,['Math'],False,False
84.87244649482436,Easy,2236,False,False,Root Equals Sum of Children,root-equals-sum-of-children,"['Tree', 'Binary Tree']",False,False
61.92097084504958,Medium,2237,False,True,Count Positions on Street With Required Brightness,count-positions-on-street-with-required-brightness,"['Array', 'Prefix Sum']",False,False
71.97122948977298,Medium,2238,False,True,Number of Times a Driver Was a Passenger,number-of-times-a-driver-was-a-passenger,['Database'],False,False
46.97162767839013,Easy,2239,False,False,Find Closest Number to Zero,find-closest-number-to-zero,['Array'],False,False
55.731179018850256,Medium,2240,False,False,Number of Ways to Buy Pens and Pencils,number-of-ways-to-buy-pens-and-pencils,"['Math', 'Enumeration']",False,False
44.023170089520804,Medium,2241,False,False,Design an ATM Machine,design-an-atm-machine,"['Array', 'Greedy', 'Design']",False,False
38.764014219305444,Hard,2242,False,False,Maximum Score of a Node Sequence,maximum-score-of-a-node-sequence,"['Array', 'Graph', 'Sorting', 'Enumeration']",False,False
66.37440349565918,Easy,2243,False,False,Calculate Digit Sum of a String,calculate-digit-sum-of-a-string,"['String', 'Simulation']",False,False
62.90328289879925,Medium,2244,False,False,Minimum Rounds to Complete All Tasks,minimum-rounds-to-complete-all-tasks,"['Array', 'Hash Table', 'Greedy', 'Counting']",True,False
36.46395088359745,Medium,2245,False,False,Maximum Trailing Zeros in a Cornered Path,maximum-trailing-zeros-in-a-cornered-path,"['Array', 'Matrix', 'Prefix Sum']",False,False
53.91891536824404,Hard,2246,False,False,Longest Path With Different Adjacent Characters,longest-path-with-different-adjacent-characters,"['Array', 'String', 'Tree', 'Depth-First Search', 'Graph', 'Topological Sort']",True,False
50.0,Hard,2247,False,True,Maximum Cost of Trip With K Highways,maximum-cost-of-trip-with-k-highways,"['Dynamic Programming', 'Bit Manipulation', 'Graph', 'Bitmask']",False,False
68.32460048869086,Easy,2248,False,False,Intersection of Multiple Arrays,intersection-of-multiple-arrays,"['Array', 'Hash Table', 'Sorting', 'Counting']",False,False
54.74883998536745,Medium,2249,False,False,Count Lattice Points Inside a Circle,count-lattice-points-inside-a-circle,"['Array', 'Hash Table', 'Math', 'Geometry', 'Enumeration']",False,False
35.78721216350215,Medium,2250,False,False,Count Number of Rectangles Containing Each Point,count-number-of-rectangles-containing-each-point,"['Array', 'Hash Table', 'Binary Search', 'Binary Indexed Tree', 'Sorting']",False,False
57.04907572717847,Hard,2251,False,False,Number of Flowers in Full Bloom,number-of-flowers-in-full-bloom,"['Array', 'Hash Table', 'Binary Search', 'Sorting', 'Prefix Sum', 'Ordered Set']",True,False
56.96087352138307,Hard,2252,False,True,Dynamic Pivoting of a Table,dynamic-pivoting-of-a-table,['Database'],False,False
67.90750141003949,Hard,2253,False,True,Dynamic Unpivoting of a Table,dynamic-unpivoting-of-a-table,['Database'],False,False
63.615946097697915,Hard,2254,False,True,Design Video Sharing Platform,design-video-sharing-platform,"['Hash Table', 'Stack', 'Design', 'Ordered Set']",False,False
73.72890899194834,Easy,2255,False,False,Count Prefixes of a Given String,count-prefixes-of-a-given-string,"['Array', 'String']",False,False
43.41054256033608,Medium,2256,False,False,Minimum Average Difference,minimum-average-difference,"['Array', 'Prefix Sum']",True,False
65.80651875795867,Medium,2257,False,False,Count Unguarded Cells in the Grid,count-unguarded-cells-in-the-grid,"['Array', 'Matrix', 'Simulation']",True,False
35.958869921134074,Hard,2258,False,False,Escape the Spreading Fire,escape-the-spreading-fire,"['Array', 'Binary Search', 'Breadth-First Search', 'Matrix']",False,False
46.94640431219598,Easy,2259,False,False,Remove Digit From Number to Maximize Result,remove-digit-from-number-to-maximize-result,"['String', 'Greedy', 'Enumeration']",False,False
52.384569063261196,Medium,2260,False,False,Minimum Consecutive Cards to Pick Up,minimum-consecutive-cards-to-pick-up,"['Array', 'Hash Table', 'Sliding Window']",False,False
53.34425721879597,Medium,2261,False,False,K Divisible Elements Subarrays,k-divisible-elements-subarrays,"['Array', 'Hash Table', 'Trie', 'Rolling Hash', 'Hash Function', 'Enumeration']",False,False
55.80126725693425,Hard,2262,False,False,Total Appeal of A String,total-appeal-of-a-string,"['Hash Table', 'String', 'Dynamic Programming']",False,False
65.32056005895357,Hard,2263,False,True,Make Array Non-decreasing or Non-increasing,make-array-non-decreasing-or-non-increasing,"['Dynamic Programming', 'Greedy']",False,False
69.03823046590736,Easy,2264,False,False,Largest 3-Same-Digit Number in String,largest-3-same-digit-number-in-string,['String'],True,False
86.27603405818273,Medium,2265,False,False,Count Nodes Equal to Average of Subtree,count-nodes-equal-to-average-of-subtree,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
48.54640772071965,Medium,2266,False,False,Count Number of Texts,count-number-of-texts,"['Hash Table', 'Math', 'String', 'Dynamic Programming']",False,False
39.22622835699708,Hard,2267,False,False, Check if There Is a Valid Parentheses String Path,check-if-there-is-a-valid-parentheses-string-path,"['Array', 'Dynamic Programming', 'Matrix']",False,False
71.20123099350084,Medium,2268,False,True,Minimum Number of Keypresses,minimum-number-of-keypresses,"['Hash Table', 'String', 'Greedy', 'Sorting', 'Counting']",False,False
61.34116683520395,Easy,2269,False,False,Find the K-Beauty of a Number,find-the-k-beauty-of-a-number,"['Math', 'String', 'Sliding Window']",False,False
56.09045071927792,Medium,2270,False,False,Number of Ways to Split Array,number-of-ways-to-split-array,"['Array', 'Prefix Sum']",True,False
34.67908527525097,Medium,2271,False,False,Maximum White Tiles Covered by a Carpet,maximum-white-tiles-covered-by-a-carpet,"['Array', 'Binary Search', 'Greedy', 'Sliding Window', 'Sorting', 'Prefix Sum']",False,False
45.895640703676925,Hard,2272,False,False,Substring With Largest Variance,substring-with-largest-variance,"['Array', 'Dynamic Programming']",True,False
59.19901966245196,Easy,2273,False,False,Find Resultant Array After Removing Anagrams,find-resultant-array-after-removing-anagrams,"['Array', 'Hash Table', 'String', 'Sorting']",False,False
51.8960544449654,Medium,2274,False,False,Maximum Consecutive Floors Without Special Floors,maximum-consecutive-floors-without-special-floors,"['Array', 'Sorting']",False,False
80.91945945945946,Medium,2275,False,False,Largest Combination With Bitwise AND Greater Than Zero,largest-combination-with-bitwise-and-greater-than-zero,"['Array', 'Hash Table', 'Bit Manipulation', 'Counting']",True,False
36.01726637039869,Hard,2276,False,False,Count Integers in Intervals,count-integers-in-intervals,"['Design', 'Segment Tree', 'Ordered Set']",False,False
62.48530825942943,Hard,2277,False,True,Closest Node to Path in Tree,closest-node-to-path-in-tree,"['Array', 'Tree', 'Depth-First Search', 'Breadth-First Search']",False,False
74.39896698778395,Easy,2278,False,False,Percentage of Letter in String,percentage-of-letter-in-string,['String'],False,False
67.51252925697209,Medium,2279,False,False,Maximum Bags With Full Capacity of Rocks,maximum-bags-with-full-capacity-of-rocks,"['Array', 'Greedy', 'Sorting']",True,False
25.90653636884307,Medium,2280,False,False,Minimum Lines to Represent a Line Chart,minimum-lines-to-represent-a-line-chart,"['Array', 'Math', 'Geometry', 'Sorting', 'Number Theory']",False,False
28.1501940877874,Hard,2281,False,False,Sum of Total Strength of Wizards,sum-of-total-strength-of-wizards,"['Array', 'Stack', 'Monotonic Stack', 'Prefix Sum']",True,False
47.046545606345234,Medium,2282,False,True,Number of People That Can Be Seen in a Grid,number-of-people-that-can-be-seen-in-a-grid,"['Array', 'Stack', 'Matrix', 'Monotonic Stack']",False,False
72.25826726952008,Easy,2283,False,False,Check if Number Has Equal Digit Count and Digit Value,check-if-number-has-equal-digit-count-and-digit-value,"['Hash Table', 'String', 'Counting']",False,False
58.04566317871216,Medium,2284,False,False,Sender With Largest Word Count,sender-with-largest-word-count,"['Array', 'Hash Table', 'String', 'Counting']",False,False
69.16064837104798,Medium,2285,False,False,Maximum Total Importance of Roads,maximum-total-importance-of-roads,"['Greedy', 'Graph', 'Sorting', 'Heap (Priority Queue)']",True,False
18.51851851851852,Hard,2286,False,False,Booking Concert Tickets in Groups,booking-concert-tickets-in-groups,"['Binary Search', 'Design', 'Binary Indexed Tree', 'Segment Tree']",False,False
59.91039203484754,Easy,2287,False,False,Rearrange Characters to Make Target String,rearrange-characters-to-make-target-string,"['Hash Table', 'String', 'Counting']",False,False
32.47247456289954,Medium,2288,False,False,Apply Discount to Prices,apply-discount-to-prices,['String'],False,False
22.91014554264594,Medium,2289,False,False,Steps to Make Array Non-decreasing,steps-to-make-array-non-decreasing,"['Array', 'Linked List', 'Stack', 'Monotonic Stack']",False,False
69.95081492911564,Hard,2290,False,False,Minimum Obstacle Removal to Reach Corner,minimum-obstacle-removal-to-reach-corner,"['Array', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']",True,False
46.3822235368063,Medium,2291,False,True,Maximum Profit From Trading Stocks,maximum-profit-from-trading-stocks,"['Array', 'Dynamic Programming']",False,False
40.081855388813096,Medium,2292,False,True,Products With Three or More Orders in Two Consecutive Years,products-with-three-or-more-orders-in-two-consecutive-years,['Database'],False,False
63.61341874731195,Easy,2293,False,False,Min Max Game,min-max-game,"['Array', 'Simulation']",False,False
74.3098216268226,Medium,2294,False,False,Partition Array Such That Maximum Difference Is K,partition-array-such-that-maximum-difference-is-k,"['Array', 'Greedy', 'Sorting']",False,False
58.57657504325873,Medium,2295,False,False,Replace Elements in an Array,replace-elements-in-an-array,"['Array', 'Hash Table', 'Simulation']",False,False
47.72903993047615,Hard,2296,False,False,Design a Text Editor,design-a-text-editor,"['Linked List', 'String', 'Stack', 'Design', 'Simulation', 'Doubly-Linked List']",False,False
45.08861910017529,Medium,2297,False,True,Jump Game VIII,jump-game-viii,"['Array', 'Dynamic Programming', 'Stack', 'Graph', 'Monotonic Stack', 'Shortest Path']",False,False
82.25015981248667,Medium,2298,False,True,Tasks Count in the Weekend,tasks-count-in-the-weekend,['Database'],False,False
54.7882980957328,Easy,2299,False,False,Strong Password Checker II,strong-password-checker-ii,['String'],False,False
45.07828214752297,Medium,2300,False,False,Successful Pairs of Spells and Potions,successful-pairs-of-spells-and-potions,"['Array', 'Two Pointers', 'Binary Search', 'Sorting']",True,False
41.83198564779907,Hard,2301,False,False,Match Substring After Replacement,match-substring-after-replacement,"['Array', 'Hash Table', 'String', 'String Matching']",False,False
55.7357617002287,Hard,2302,False,False,Count Subarrays With Score Less Than K,count-subarrays-with-score-less-than-k,"['Array', 'Binary Search', 'Sliding Window', 'Prefix Sum']",False,False
66.9761838296872,Easy,2303,False,False,Calculate Amount Paid in Taxes,calculate-amount-paid-in-taxes,"['Array', 'Simulation']",False,False
67.02409294352918,Medium,2304,False,False,Minimum Path Cost in a Grid,minimum-path-cost-in-a-grid,"['Array', 'Dynamic Programming', 'Matrix']",False,False
69.29897281123301,Medium,2305,False,False,Fair Distribution of Cookies,fair-distribution-of-cookies,"['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']",True,False
46.32377715599959,Hard,2306,False,False,Naming a Company,naming-a-company,"['Array', 'Hash Table', 'String', 'Bit Manipulation', 'Enumeration']",True,False
43.11926605504588,Hard,2307,False,True,Check for Contradictions in Equations,check-for-contradictions-in-equations,"['Array', 'Depth-First Search', 'Union Find', 'Graph']",False,False
70.29760746936392,Medium,2308,False,True,Arrange Table by Gender,arrange-table-by-gender,['Database'],False,False
70.84913493256738,Easy,2309,False,False,Greatest English Letter in Upper and Lower Case,greatest-english-letter-in-upper-and-lower-case,"['Hash Table', 'String', 'Enumeration']",False,False
27.153365276633973,Medium,2310,False,False,Sum of Numbers With Units Digit K,sum-of-numbers-with-units-digit-k,"['Math', 'Dynamic Programming', 'Greedy', 'Enumeration']",False,False
38.084917897934,Medium,2311,False,False,Longest Binary Subsequence Less Than or Equal to K,longest-binary-subsequence-less-than-or-equal-to-k,"['String', 'Dynamic Programming', 'Greedy', 'Memoization']",False,False
51.33106602556585,Hard,2312,False,False,Selling Pieces of Wood,selling-pieces-of-wood,"['Array', 'Dynamic Programming', 'Memoization']",False,False
56.6735644076565,Hard,2313,False,True,Minimum Flips in Binary Tree to Get Result,minimum-flips-in-binary-tree-to-get-result,"['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree']",False,False
73.07333264184214,Medium,2314,False,True,The First Day of the Maximum Recorded Degree in Each City,the-first-day-of-the-maximum-recorded-degree-in-each-city,['Database'],False,False
82.63305870943093,Easy,2315,False,False,Count Asterisks,count-asterisks,['String'],False,False
49.18576081366779,Medium,2316,False,False,Count Unreachable Pairs of Nodes in an Undirected Graph,count-unreachable-pairs-of-nodes-in-an-undirected-graph,"['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
79.15910550266618,Medium,2317,False,False,Maximum XOR After Operations ,maximum-xor-after-operations,"['Array', 'Math', 'Bit Manipulation']",False,False
57.06791827719492,Hard,2318,False,False,Number of Distinct Roll Sequences,number-of-distinct-roll-sequences,"['Dynamic Programming', 'Memoization']",False,False
65.33988412317748,Easy,2319,False,False,Check if Matrix Is X-Matrix,check-if-matrix-is-x-matrix,"['Array', 'Matrix']",False,False
42.54815955559834,Medium,2320,False,False,Count Number of Ways to Place Houses,count-number-of-ways-to-place-houses,['Dynamic Programming'],False,False
57.307743926989666,Hard,2321,False,False,Maximum Score Of Spliced Array,maximum-score-of-spliced-array,"['Array', 'Dynamic Programming']",False,False
51.972349061390155,Hard,2322,False,False,Minimum Score After Removals on a Tree,minimum-score-after-removals-on-a-tree,"['Array', 'Bit Manipulation', 'Tree', 'Depth-First Search']",False,False
65.60059289664215,Medium,2323,False,True,Find Minimum Time to Finish All Jobs II,find-minimum-time-to-finish-all-jobs-ii,"['Array', 'Greedy', 'Sorting']",False,False
75.26413420437133,Medium,2324,False,True,Product Sales Analysis IV,product-sales-analysis-iv,['Database'],False,False
85.26542881009227,Easy,2325,False,False,Decode the Message,decode-the-message,"['Hash Table', 'String']",False,False
82.17372241438106,Medium,2326,False,False,Spiral Matrix IV,spiral-matrix-iv,"['Array', 'Linked List', 'Matrix', 'Simulation']",True,False
46.101485148514854,Medium,2327,False,False,Number of People Aware of a Secret,number-of-people-aware-of-a-secret,"['Dynamic Programming', 'Queue', 'Simulation']",False,False
57.71204743731664,Hard,2328,False,False,Number of Increasing Paths in a Grid,number-of-increasing-paths-in-a-grid,"['Array', 'Dynamic Programming', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort', 'Memoization', 'Matrix']",True,False
70.42725713394667,Easy,2329,False,True,Product Sales Analysis V,product-sales-analysis-v,['Database'],False,False
75.75426964877681,Medium,2330,False,True,Valid Palindrome IV,valid-palindrome-iv,"['Two Pointers', 'String']",False,False
82.43357475940073,Easy,2331,False,False,Evaluate Boolean Binary Tree,evaluate-boolean-binary-tree,"['Tree', 'Depth-First Search', 'Binary Tree']",True,False
28.06023187485111,Medium,2332,False,False,The Latest Time to Catch a Bus,the-latest-time-to-catch-a-bus,"['Array', 'Two Pointers', 'Binary Search', 'Sorting']",False,False
25.78040733455999,Medium,2333,False,False,Minimum Sum of Squared Difference,minimum-sum-of-squared-difference,"['Array', 'Binary Search', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",False,False
44.29026387625113,Hard,2334,False,False,Subarray With Elements Greater Than Varying Threshold,subarray-with-elements-greater-than-varying-threshold,"['Array', 'Stack', 'Union Find', 'Monotonic Stack']",False,False
58.599094126265186,Easy,2335,False,False,Minimum Amount of Time to Fill Cups,minimum-amount-of-time-to-fill-cups,"['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",False,False
71.36031786198535,Medium,2336,False,False,Smallest Number in Infinite Set,smallest-number-in-infinite-set,"['Hash Table', 'Design', 'Heap (Priority Queue)', 'Ordered Set']",True,False
56.90587916327765,Medium,2337,False,False,Move Pieces to Obtain a String,move-pieces-to-obtain-a-string,"['Two Pointers', 'String']",True,False
27.423158708679686,Hard,2338,False,False,Count the Number of Ideal Arrays,count-the-number-of-ideal-arrays,"['Math', 'Dynamic Programming', 'Combinatorics', 'Number Theory']",False,False
88.37082232947819,Easy,2339,False,True,All the Matches of the League,all-the-matches-of-the-league,['Database'],False,False
72.23883368929334,Medium,2340,False,True,Minimum Adjacent Swaps to Make a Valid Array,minimum-adjacent-swaps-to-make-a-valid-array,"['Array', 'Greedy']",False,False
75.41811830329893,Easy,2341,False,False,Maximum Number of Pairs in Array,maximum-number-of-pairs-in-array,"['Array', 'Hash Table', 'Counting']",False,False
65.99476759545162,Medium,2342,False,False,Max Sum of a Pair With Equal Sum of Digits,max-sum-of-a-pair-with-equal-sum-of-digits,"['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)']",True,False
45.17955439056357,Medium,2343,False,False,Query Kth Smallest Trimmed Number,query-kth-smallest-trimmed-number,"['Array', 'String', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Radix Sort', 'Quickselect']",False,False
57.02681013446011,Hard,2344,False,False,Minimum Deletions to Make Array Divisible,minimum-deletions-to-make-array-divisible,"['Array', 'Math', 'Sorting', 'Heap (Priority Queue)', 'Number Theory']",False,False
36.63042366815502,Medium,2345,False,True,Finding the Number of Visible Mountains,finding-the-number-of-visible-mountains,"['Array', 'Stack', 'Sorting', 'Monotonic Stack']",False,False
33.80706760316067,Medium,2346,False,True,Compute the Rank as a Percentage,compute-the-rank-as-a-percentage,['Database'],False,False
61.06408706166868,Easy,2347,False,False,Best Poker Hand,best-poker-hand,"['Array', 'Hash Table', 'Counting']",False,False
66.66524935275999,Medium,2348,False,False,Number of Zero-Filled Subarrays,number-of-zero-filled-subarrays,"['Array', 'Math']",True,False
58.10205070372074,Medium,2349,False,False,Design a Number Container System,design-a-number-container-system,"['Hash Table', 'Design', 'Heap (Priority Queue)', 'Ordered Set']",True,False
68.50679093479906,Hard,2350,False,False,Shortest Impossible Sequence of Rolls,shortest-impossible-sequence-of-rolls,"['Array', 'Hash Table', 'Greedy']",False,False
74.01376168830545,Easy,2351,False,False,First Letter to Appear Twice,first-letter-to-appear-twice,"['Hash Table', 'String', 'Bit Manipulation', 'Counting']",False,False
70.38539017865989,Medium,2352,False,False,Equal Row and Column Pairs,equal-row-and-column-pairs,"['Array', 'Hash Table', 'Matrix', 'Simulation']",True,False
45.24555850780087,Medium,2353,False,False,Design a Food Rating System,design-a-food-rating-system,"['Array', 'Hash Table', 'String', 'Design', 'Heap (Priority Queue)', 'Ordered Set']",True,False
47.81015579919215,Hard,2354,False,False,Number of Excellent Pairs,number-of-excellent-pairs,"['Array', 'Hash Table', 'Binary Search', 'Bit Manipulation']",False,False
39.25057825751735,Hard,2355,False,True,Maximum Number of Books You Can Take,maximum-number-of-books-you-can-take,"['Array', 'Dynamic Programming', 'Stack', 'Monotonic Stack']",True,False
89.30759844121083,Easy,2356,False,False,Number of Unique Subjects Taught by Each Teacher,number-of-unique-subjects-taught-by-each-teacher,['Database'],True,False
73.18265058322385,Easy,2357,False,False,Make Array Zero by Subtracting Equal Amounts,make-array-zero-by-subtracting-equal-amounts,"['Array', 'Hash Table', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Simulation']",False,False
68.01502693974395,Medium,2358,False,False,Maximum Number of Groups Entering a Competition,maximum-number-of-groups-entering-a-competition,"['Array', 'Math', 'Binary Search', 'Greedy']",False,False
45.69063358955188,Medium,2359,False,False,Find Closest Node to Given Two Nodes,find-closest-node-to-given-two-nodes,"['Depth-First Search', 'Graph']",True,False
49.78399012526287,Hard,2360,False,False,Longest Cycle in a Graph,longest-cycle-in-a-graph,"['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']",True,False
77.53882215060064,Hard,2361,False,True,Minimum Costs Using the Train Line,minimum-costs-using-the-train-line,"['Array', 'Dynamic Programming']",True,False
76.14541832669323,Hard,2362,False,True,Generate the Invoice,generate-the-invoice,['Database'],False,False
76.5888248503822,Easy,2363,False,False,Merge Similar Items,merge-similar-items,"['Array', 'Hash Table', 'Sorting', 'Ordered Set']",False,False
54.47441367631337,Medium,2364,False,False,Count Number of Bad Pairs,count-number-of-bad-pairs,"['Array', 'Hash Table', 'Math', 'Counting']",True,False
53.800043804539534,Medium,2365,False,False,Task Scheduler II,task-scheduler-ii,"['Array', 'Hash Table', 'Simulation']",False,False
53.2657126781125,Hard,2366,False,False,Minimum Replacements to Sort the Array,minimum-replacements-to-sort-the-array,"['Array', 'Math', 'Greedy']",True,False
84.80888347570375,Easy,2367,False,False,Number of Arithmetic Triplets,number-of-arithmetic-triplets,"['Array', 'Hash Table', 'Two Pointers', 'Enumeration']",False,False
59.27045221096954,Medium,2368,False,False,Reachable Nodes With Restrictions,reachable-nodes-with-restrictions,"['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
51.86975772076011,Medium,2369,False,False,Check if There is a Valid Partition For The Array,check-if-there-is-a-valid-partition-for-the-array,"['Array', 'Dynamic Programming']",True,False
46.89519815871614,Medium,2370,False,False,Longest Ideal Subsequence,longest-ideal-subsequence,"['Hash Table', 'String', 'Dynamic Programming']",True,False
70.67488508148767,Hard,2371,False,True,Minimize Maximum Value in a Grid,minimize-maximum-value-in-a-grid,"['Array', 'Union Find', 'Graph', 'Topological Sort', 'Sorting', 'Matrix']",True,False
83.56369069854314,Medium,2372,False,True,Calculate the Influence of Each Salesperson,calculate-the-influence-of-each-salesperson,['Database'],False,False
87.76566371335441,Easy,2373,False,False,Largest Local Values in a Matrix,largest-local-values-in-a-matrix,"['Array', 'Matrix']",True,False
48.22343823507565,Medium,2374,False,False,Node With Highest Edge Score,node-with-highest-edge-score,"['Hash Table', 'Graph']",False,False
85.84909857306508,Medium,2375,False,False,Construct Smallest Number From DI String,construct-smallest-number-from-di-string,"['String', 'Backtracking', 'Stack', 'Greedy']",True,False
39.33002481389578,Hard,2376,False,False,Count Special Integers,count-special-integers,"['Math', 'Dynamic Programming']",False,False
79.44859518046933,Easy,2377,False,True,Sort the Olympic Table,sort-the-olympic-table,['Database'],False,False
56.12181479179614,Medium,2378,False,True,Choose Edges to Maximize Score in a Tree,choose-edges-to-maximize-score-in-a-tree,"['Dynamic Programming', 'Tree', 'Depth-First Search']",False,False
68.47664936990363,Easy,2379,False,False,Minimum Recolors to Get K Consecutive Black Blocks,minimum-recolors-to-get-k-consecutive-black-blocks,"['String', 'Sliding Window']",True,False
51.389211890723544,Medium,2380,False,False,Time Needed to Rearrange a Binary String,time-needed-to-rearrange-a-binary-string,"['String', 'Dynamic Programming', 'Simulation']",False,False
53.23904469842137,Medium,2381,False,False,Shifting Letters II,shifting-letters-ii,"['Array', 'String', 'Prefix Sum']",True,False
48.12019820884666,Hard,2382,False,False,Maximum Segment Sum After Removals,maximum-segment-sum-after-removals,"['Array', 'Union Find', 'Prefix Sum', 'Ordered Set']",False,False
41.70884466939379,Easy,2383,False,False,Minimum Hours of Training to Win a Competition,minimum-hours-of-training-to-win-a-competition,"['Array', 'Greedy']",False,False
36.27856214007059,Medium,2384,False,False,Largest Palindromic Number,largest-palindromic-number,"['Hash Table', 'String', 'Greedy', 'Counting']",False,False
63.27134853358637,Medium,2385,False,False,Amount of Time for Binary Tree to Be Infected,amount-of-time-for-binary-tree-to-be-infected,"['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
39.419659049691695,Hard,2386,False,False,Find the K-Sum of an Array,find-the-k-sum-of-an-array,"['Array', 'Sorting', 'Heap (Priority Queue)']",False,False
69.3451486933013,Medium,2387,False,True,Median of a Row Wise Sorted Matrix,median-of-a-row-wise-sorted-matrix,"['Array', 'Binary Search', 'Matrix']",False,False
51.36010362694301,Medium,2388,False,True,Change Null Values in a Table to the Previous Value,change-null-values-in-a-table-to-the-previous-value,['Database'],False,False
72.62543669356359,Easy,2389,False,False,Longest Subsequence With Limited Sum,longest-subsequence-with-limited-sum,"['Array', 'Binary Search', 'Greedy', 'Sorting', 'Prefix Sum']",True,False
77.61284101462266,Medium,2390,False,False,Removing Stars From a String,removing-stars-from-a-string,"['String', 'Stack', 'Simulation']",True,False
85.09701381666915,Medium,2391,False,False,Minimum Amount of Time to Collect Garbage,minimum-amount-of-time-to-collect-garbage,"['Array', 'String', 'Prefix Sum']",True,False
79.2387231884295,Hard,2392,False,False,Build a Matrix With Conditions,build-a-matrix-with-conditions,"['Array', 'Graph', 'Topological Sort', 'Matrix']",True,False
71.1822188158651,Medium,2393,False,True,Count Strictly Increasing Subarrays,count-strictly-increasing-subarrays,"['Array', 'Math', 'Dynamic Programming']",True,False
41.90701678863539,Medium,2394,False,True,Employees With Deductions,employees-with-deductions,['Database'],False,False
66.04078008424563,Easy,2395,False,False,Find Subarrays With Equal Sum,find-subarrays-with-equal-sum,"['Array', 'Hash Table']",False,False
88.02916927862374,Medium,2396,False,False,Strictly Palindromic Number,strictly-palindromic-number,"['Math', 'Two Pointers', 'Brainteaser']",False,False
56.197522921023,Medium,2397,False,False,Maximum Rows Covered by Columns,maximum-rows-covered-by-columns,"['Array', 'Backtracking', 'Bit Manipulation', 'Matrix', 'Enumeration']",False,False
36.289812133863045,Hard,2398,False,False,Maximum Number of Robots Within Budget,maximum-number-of-robots-within-budget,"['Array', 'Binary Search', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Prefix Sum', 'Monotonic Queue']",False,False
70.68282686045488,Easy,2399,False,False,Check Distances Between Same Letters,check-distances-between-same-letters,"['Array', 'Hash Table', 'String']",False,False
35.92480615371959,Medium,2400,False,False,Number of Ways to Reach a Position After Exactly k Steps,number-of-ways-to-reach-a-position-after-exactly-k-steps,"['Math', 'Dynamic Programming', 'Combinatorics']",False,False
64.76313689454211,Medium,2401,False,False,Longest Nice Subarray,longest-nice-subarray,"['Array', 'Bit Manipulation', 'Sliding Window']",True,False
43.897701521528006,Hard,2402,False,False,Meeting Rooms III,meeting-rooms-iii,"['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)', 'Simulation']",True,False
55.75008582217645,Hard,2403,False,True,Minimum Time to Kill All Monsters,minimum-time-to-kill-all-monsters,"['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']",False,False
51.51749477914811,Easy,2404,False,False,Most Frequent Even Element,most-frequent-even-element,"['Array', 'Hash Table', 'Counting']",False,False
78.15619186531603,Medium,2405,False,False,Optimal Partition of String,optimal-partition-of-string,"['Hash Table', 'String', 'Greedy']",True,False
63.68060058979735,Medium,2406,False,False,Divide Intervals Into Minimum Number of Groups,divide-intervals-into-minimum-number-of-groups,"['Array', 'Two Pointers', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Prefix Sum']",True,False
25.33522434244456,Hard,2407,False,False,Longest Increasing Subsequence II,longest-increasing-subsequence-ii,"['Array', 'Divide and Conquer', 'Dynamic Programming', 'Binary Indexed Tree', 'Segment Tree', 'Queue', 'Monotonic Queue']",False,False
71.68837000449034,Medium,2408,False,True,Design SQL,design-sql,"['Array', 'Hash Table', 'String', 'Design']",False,False
46.22524539349062,Easy,2409,False,False,Count Days Spent Together,count-days-spent-together,"['Math', 'String']",False,False
66.42594924837213,Medium,2410,False,False,Maximum Matching of Players With Trainers,maximum-matching-of-players-with-trainers,"['Array', 'Two Pointers', 'Greedy', 'Sorting']",False,False
44.88777309543023,Medium,2411,False,False,Smallest Subarrays With Maximum Bitwise OR,smallest-subarrays-with-maximum-bitwise-or,"['Array', 'Binary Search', 'Bit Manipulation', 'Sliding Window']",False,False
40.926535087719294,Hard,2412,False,False,Minimum Money Required Before Transactions,minimum-money-required-before-transactions,"['Array', 'Greedy', 'Sorting']",False,False
88.04006437801772,Easy,2413,False,False,Smallest Even Multiple,smallest-even-multiple,"['Math', 'Number Theory']",False,False
59.088167231489706,Medium,2414,False,False,Length of the Longest Alphabetical Continuous Substring,length-of-the-longest-alphabetical-continuous-substring,['String'],False,False
86.61842008237736,Medium,2415,False,False,Reverse Odd Levels of Binary Tree,reverse-odd-levels-of-binary-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
60.68651830400705,Hard,2416,False,False,Sum of Prefix Scores of Strings,sum-of-prefix-scores-of-strings,"['Array', 'String', 'Trie', 'Counting']",True,False
45.073375262054505,Medium,2417,False,True,Closest Fair Integer,closest-fair-integer,"['Math', 'Enumeration']",False,False
84.80494358681008,Easy,2418,False,False,Sort the People,sort-the-people,"['Array', 'Hash Table', 'String', 'Sorting']",True,False
61.785603091096334,Medium,2419,False,False,Longest Subarray With Maximum Bitwise AND,longest-subarray-with-maximum-bitwise-and,"['Array', 'Bit Manipulation', 'Brainteaser']",True,False
39.571086125221164,Medium,2420,False,False,Find All Good Indices,find-all-good-indices,"['Array', 'Dynamic Programming', 'Prefix Sum']",False,False
55.93834656702475,Hard,2421,False,False,Number of Good Paths,number-of-good-paths,"['Array', 'Hash Table', 'Tree', 'Union Find', 'Graph', 'Sorting']",True,False
69.02960203881592,Medium,2422,False,True,Merge Operations to Turn Array Into a Palindrome,merge-operations-to-turn-array-into-a-palindrome,"['Array', 'Two Pointers', 'Greedy']",False,False
18.032621858243843,Easy,2423,False,False,Remove Letter To Equalize Frequency,remove-letter-to-equalize-frequency,"['Hash Table', 'String', 'Counting']",False,False
56.30209648901238,Medium,2424,False,False,Longest Uploaded Prefix,longest-uploaded-prefix,"['Binary Search', 'Union Find', 'Design', 'Binary Indexed Tree', 'Segment Tree', 'Heap (Priority Queue)', 'Ordered Set']",False,False
67.03801449222054,Medium,2425,False,False,Bitwise XOR of All Pairings,bitwise-xor-of-all-pairings,"['Array', 'Bit Manipulation', 'Brainteaser']",True,False
45.008711547799265,Hard,2426,False,False,Number of Pairs Satisfying Inequality,number-of-pairs-satisfying-inequality,"['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']",False,False
79.39646201873049,Easy,2427,False,False,Number of Common Factors,number-of-common-factors,"['Math', 'Enumeration', 'Number Theory']",False,False
75.76926866112771,Medium,2428,False,False,Maximum Sum of an Hourglass,maximum-sum-of-an-hourglass,"['Array', 'Matrix', 'Prefix Sum']",False,False
62.43908348009206,Medium,2429,False,False,Minimize XOR,minimize-xor,"['Greedy', 'Bit Manipulation']",True,False
34.35068688036278,Hard,2430,False,False,Maximum Deletions on a String,maximum-deletions-on-a-string,"['String', 'Dynamic Programming', 'Rolling Hash', 'String Matching', 'Hash Function']",False,False
64.39522998296422,Medium,2431,False,True,Maximize Total Tastiness of Purchased Fruits,maximize-total-tastiness-of-purchased-fruits,"['Array', 'Dynamic Programming']",False,False
50.39646331589837,Easy,2432,False,False,The Employee That Worked on the Longest Task,the-employee-that-worked-on-the-longest-task,['Array'],False,False
88.06687020627001,Medium,2433,False,False,Find The Original Array of Prefix Xor,find-the-original-array-of-prefix-xor,"['Array', 'Bit Manipulation']",True,False
41.3985125387749,Medium,2434,False,False,Using a Robot to Print the Lexicographically Smallest String,using-a-robot-to-print-the-lexicographically-smallest-string,"['Hash Table', 'String', 'Stack', 'Greedy']",False,False
43.8474252195612,Hard,2435,False,False,Paths in Matrix Whose Sum Is Divisible by K,paths-in-matrix-whose-sum-is-divisible-by-k,"['Array', 'Dynamic Programming', 'Matrix']",False,False
69.97585189160182,Medium,2436,False,True,Minimum Split Into Subarrays With GCD Greater Than One,minimum-split-into-subarrays-with-gcd-greater-than-one,"['Array', 'Math', 'Dynamic Programming', 'Greedy', 'Number Theory']",False,False
47.29565850109144,Easy,2437,False,False,Number of Valid Clock Times,number-of-valid-clock-times,"['String', 'Enumeration']",False,False
41.63282898169363,Medium,2438,False,False,Range Product Queries of Powers,range-product-queries-of-powers,"['Array', 'Bit Manipulation', 'Prefix Sum']",False,False
46.42037465883715,Medium,2439,False,False,Minimize Maximum of Array,minimize-maximum-of-array,"['Array', 'Binary Search', 'Dynamic Programming', 'Greedy', 'Prefix Sum']",True,False
52.14045214045214,Hard,2440,False,False,Create Components With Same Value,create-components-with-same-value,"['Array', 'Math', 'Tree', 'Depth-First Search', 'Enumeration']",False,False
74.70171462266325,Easy,2441,False,False,Largest Positive Integer That Exists With Its Negative,largest-positive-integer-that-exists-with-its-negative,"['Array', 'Hash Table', 'Two Pointers', 'Sorting']",True,False
79.96514807062523,Medium,2442,False,False,Count Number of Distinct Integers After Reverse Operations,count-number-of-distinct-integers-after-reverse-operations,"['Array', 'Hash Table', 'Math', 'Counting']",False,False
48.003170322000614,Medium,2443,False,False,Sum of Number and Its Reverse,sum-of-number-and-its-reverse,"['Math', 'Enumeration']",False,False
67.68264835120982,Hard,2444,False,False,Count Subarrays With Fixed Bounds,count-subarrays-with-fixed-bounds,"['Array', 'Queue', 'Sliding Window', 'Monotonic Queue']",True,False
65.55075593952483,Medium,2445,False,True,Number of Nodes With Value One,number-of-nodes-with-value-one,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",False,False
52.13342941667298,Easy,2446,False,False,Determine if Two Events Have Conflict,determine-if-two-events-have-conflict,"['Array', 'String']",False,False
50.82859562114431,Medium,2447,False,False,Number of Subarrays With GCD Equal to K,number-of-subarrays-with-gcd-equal-to-k,"['Array', 'Math', 'Number Theory']",False,False
46.18138502496274,Hard,2448,False,False,Minimum Cost to Make Array Equal,minimum-cost-to-make-array-equal,"['Array', 'Binary Search', 'Greedy', 'Sorting', 'Prefix Sum']",True,False
60.218588215958576,Hard,2449,False,False,Minimum Number of Operations to Make Arrays Similar,minimum-number-of-operations-to-make-arrays-similar,"['Array', 'Greedy', 'Sorting']",False,False
63.438632832729155,Medium,2450,False,True,Number of Distinct Binary Strings After Applying Operations,number-of-distinct-binary-strings-after-applying-operations,"['Math', 'String']",False,False
60.794795089336795,Easy,2451,False,False,Odd String Difference,odd-string-difference,"['Array', 'Hash Table', 'String']",False,False
61.16447007793322,Medium,2452,False,False,Words Within Two Edits of Dictionary,words-within-two-edits-of-dictionary,"['Array', 'String', 'Trie']",False,False
40.335248851683204,Medium,2453,False,False,Destroy Sequential Targets,destroy-sequential-targets,"['Array', 'Hash Table', 'Counting']",False,False
39.69014165777098,Hard,2454,False,False,Next Greater Element IV,next-greater-element-iv,"['Array', 'Binary Search', 'Stack', 'Sorting', 'Heap (Priority Queue)', 'Monotonic Stack']",False,False
61.132513500328045,Easy,2455,False,False,Average Value of Even Numbers That Are Divisible by Three,average-value-of-even-numbers-that-are-divisible-by-three,"['Array', 'Math']",False,False
44.32216544290772,Medium,2456,False,False,Most Popular Video Creator,most-popular-video-creator,"['Array', 'Hash Table', 'String', 'Sorting', 'Heap (Priority Queue)']",False,False
37.844756963407974,Medium,2457,False,False,Minimum Addition to Make Integer Beautiful,minimum-addition-to-make-integer-beautiful,"['Math', 'Greedy']",False,False
54.92992243842699,Hard,2458,False,False,Height of Binary Tree After Subtree Removal Queries,height-of-binary-tree-after-subtree-removal-queries,"['Array', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
44.53750910415149,Hard,2459,False,True,Sort Array by Moving Items to Empty Space,sort-array-by-moving-items-to-empty-space,"['Array', 'Greedy', 'Sorting']",False,False
74.87904880352946,Easy,2460,False,False,Apply Operations to an Array,apply-operations-to-an-array,"['Array', 'Two Pointers', 'Simulation']",True,False
42.67042009895155,Medium,2461,False,False,Maximum Sum of Distinct Subarrays With Length K,maximum-sum-of-distinct-subarrays-with-length-k,"['Array', 'Hash Table', 'Sliding Window']",True,False
42.940300047729,Medium,2462,False,False,Total Cost to Hire K Workers,total-cost-to-hire-k-workers,"['Array', 'Two Pointers', 'Heap (Priority Queue)', 'Simulation']",True,False
59.060990605084015,Hard,2463,False,False,Minimum Total Distance Traveled,minimum-total-distance-traveled,"['Array', 'Dynamic Programming', 'Sorting']",True,False
54.33320142461417,Medium,2464,False,True,Minimum Subarrays in a Valid Split,minimum-subarrays-in-a-valid-split,"['Array', 'Math', 'Dynamic Programming', 'Number Theory']",False,False
58.3685433352613,Easy,2465,False,False,Number of Distinct Averages,number-of-distinct-averages,"['Array', 'Hash Table', 'Two Pointers', 'Sorting']",False,False
59.255696951760875,Medium,2466,False,False,Count Ways To Build Good Strings,count-ways-to-build-good-strings,['Dynamic Programming'],True,False
67.79835946142846,Medium,2467,False,False,Most Profitable Path in a Tree,most-profitable-path-in-a-tree,"['Array', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Graph']",True,False
42.983138780804154,Hard,2468,False,False,Split Message Based on Limit,split-message-based-on-limit,"['String', 'Binary Search', 'Enumeration']",False,False
90.0587890800973,Easy,2469,False,False,Convert the Temperature,convert-the-temperature,['Math'],False,False
39.59640468093938,Medium,2470,False,False,Number of Subarrays With LCM Equal to K,number-of-subarrays-with-lcm-equal-to-k,"['Array', 'Math', 'Number Theory']",False,False
74.28083844480659,Medium,2471,False,False,Minimum Number of Operations to Sort a Binary Tree by Level,minimum-number-of-operations-to-sort-a-binary-tree-by-level,"['Tree', 'Breadth-First Search', 'Binary Tree']",True,False
41.266076208299786,Hard,2472,False,False,Maximum Number of Non-overlapping Palindrome Substrings,maximum-number-of-non-overlapping-palindrome-substrings,"['Two Pointers', 'String', 'Dynamic Programming', 'Greedy']",False,False
67.17928365909316,Medium,2473,False,True,Minimum Cost to Buy Apples,minimum-cost-to-buy-apples,"['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path']",True,False
47.937868237814676,Hard,2474,False,True,Customers With Strictly Increasing Purchases,customers-with-strictly-increasing-purchases,['Database'],False,False
72.05114301207226,Easy,2475,False,False,Number of Unequal Triplets in Array,number-of-unequal-triplets-in-array,"['Array', 'Hash Table', 'Sorting']",False,False
42.18261103481474,Medium,2476,False,False,Closest Nodes Queries in a Binary Search Tree,closest-nodes-queries-in-a-binary-search-tree,"['Array', 'Binary Search', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']",False,False
64.2115832530884,Medium,2477,False,False,Minimum Fuel Cost to Report to the Capital,minimum-fuel-cost-to-report-to-the-capital,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Graph']",True,False
32.02928700726771,Hard,2478,False,False,Number of Beautiful Partitions,number-of-beautiful-partitions,"['String', 'Dynamic Programming']",False,False
49.44717444717445,Hard,2479,False,True,Maximum XOR of Two Non-Overlapping Subtrees,maximum-xor-of-two-non-overlapping-subtrees,"['Tree', 'Depth-First Search', 'Graph', 'Trie']",False,False
78.52639873916469,Easy,2480,False,True,Form a Chemical Bond,form-a-chemical-bond,['Database'],False,False
54.89567825317712,Easy,2481,False,False,Minimum Cuts to Divide a Circle,minimum-cuts-to-divide-a-circle,"['Math', 'Geometry']",False,False
84.2746449365545,Medium,2482,False,False,Difference Between Ones and Zeros in Row and Column,difference-between-ones-and-zeros-in-row-and-column,"['Array', 'Matrix', 'Simulation']",True,False
67.55134805956928,Medium,2483,False,False,Minimum Penalty for a Shop,minimum-penalty-for-a-shop,"['String', 'Prefix Sum']",True,True
38.875643457057706,Hard,2484,False,False,Count Palindromic Subsequences,count-palindromic-subsequences,"['String', 'Dynamic Programming']",False,False
83.7113976440624,Easy,2485,False,False,Find the Pivot Integer,find-the-pivot-integer,"['Math', 'Prefix Sum']",True,False
72.96515762028916,Medium,2486,False,False,Append Characters to String to Make Subsequence,append-characters-to-string-to-make-subsequence,"['Two Pointers', 'String', 'Greedy']",True,False
74.24928848426343,Medium,2487,False,False,Remove Nodes From Linked List,remove-nodes-from-linked-list,"['Linked List', 'Stack', 'Recursion', 'Monotonic Stack']",True,False
44.952618909777875,Hard,2488,False,False,Count Subarrays With Median K,count-subarrays-with-median-k,"['Array', 'Hash Table', 'Prefix Sum']",False,False
55.4786150712831,Medium,2489,False,True,Number of Substrings With Fixed Ratio,number-of-substrings-with-fixed-ratio,"['Hash Table', 'Math', 'String', 'Prefix Sum']",False,False
70.47665963861357,Easy,2490,False,False,Circular Sentence,circular-sentence,['String'],True,False
68.94836151362826,Medium,2491,False,False,Divide Players Into Teams of Equal Skill,divide-players-into-teams-of-equal-skill,"['Array', 'Hash Table', 'Two Pointers', 'Sorting']",True,False
57.670753064798596,Medium,2492,False,False,Minimum Score of a Path Between Two Cities,minimum-score-of-a-path-between-two-cities,"['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
67.51020543626166,Hard,2493,False,False,Divide Nodes Into the Maximum Number of Groups,divide-nodes-into-the-maximum-number-of-groups,"['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
34.49794063343275,Hard,2494,False,True,Merge Overlapping Events in the Same Hall,merge-overlapping-events-in-the-same-hall,['Database'],False,False
61.01973684210527,Medium,2495,False,True,Number of Subarrays Having Even Product,number-of-subarrays-having-even-product,"['Array', 'Math', 'Dynamic Programming']",False,False
73.23951141795007,Easy,2496,False,False,Maximum Value of a String in an Array,maximum-value-of-a-string-in-an-array,"['Array', 'String']",False,False
40.592587857382576,Medium,2497,False,False,Maximum Star Sum of a Graph,maximum-star-sum-of-a-graph,"['Array', 'Greedy', 'Graph', 'Sorting', 'Heap (Priority Queue)']",False,False
62.06612892169184,Medium,2498,False,False,Frog Jump II,frog-jump-ii,"['Array', 'Binary Search', 'Greedy']",False,False
40.56277389098178,Hard,2499,False,False,Minimum Total Cost to Make Arrays Unequal,minimum-total-cost-to-make-arrays-unequal,"['Array', 'Hash Table', 'Greedy', 'Counting']",False,False
78.78284072249589,Easy,2500,False,False,Delete Greatest Value in Each Row,delete-greatest-value-in-each-row,"['Array', 'Sorting', 'Heap (Priority Queue)', 'Matrix', 'Simulation']",False,False
53.05967059417961,Medium,2501,False,False,Longest Square Streak in an Array,longest-square-streak-in-an-array,"['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming', 'Sorting']",True,False
53.047556719022694,Medium,2502,False,False,Design Memory Allocator,design-memory-allocator,"['Array', 'Hash Table', 'Design', 'Simulation']",False,False
59.63159985154607,Hard,2503,False,False,Maximum Number of Points From Grid Queries,maximum-number-of-points-from-grid-queries,"['Array', 'Two Pointers', 'Breadth-First Search', 'Union Find', 'Sorting', 'Heap (Priority Queue)', 'Matrix']",True,False
78.58421704999311,Easy,2504,False,True,Concatenate the Name and the Profession,concatenate-the-name-and-the-profession,['Database'],False,False
64.95105778339122,Medium,2505,False,True,Bitwise OR of All Subsequence Sums,bitwise-or-of-all-subsequence-sums,"['Array', 'Math', 'Bit Manipulation', 'Brainteaser']",False,False
72.16366423917209,Easy,2506,False,False,Count Pairs Of Similar Strings,count-pairs-of-similar-strings,"['Array', 'Hash Table', 'String', 'Bit Manipulation', 'Counting']",False,False
48.95712630359212,Medium,2507,False,False,Smallest Value After Replacing With Sum of Prime Factors,smallest-value-after-replacing-with-sum-of-prime-factors,"['Math', 'Simulation', 'Number Theory']",False,False
33.28501831944276,Hard,2508,False,False,Add Edges to Make Degrees of All Nodes Even,add-edges-to-make-degrees-of-all-nodes-even,"['Hash Table', 'Graph']",False,False
57.83301371883759,Hard,2509,False,False,Cycle Length Queries in a Tree,cycle-length-queries-in-a-tree,"['Array', 'Tree', 'Binary Tree']",False,False
51.238642540964506,Medium,2510,False,True,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,"['Array', 'Dynamic Programming', 'Matrix']",False,False
39.778563145397314,Easy,2511,False,False,Maximum Enemy Forts That Can Be Captured,maximum-enemy-forts-that-can-be-captured,"['Array', 'Two Pointers']",False,False
45.72346554398405,Medium,2512,False,False,Reward Top K Students,reward-top-k-students,"['Array', 'Hash Table', 'String', 'Sorting', 'Heap (Priority Queue)']",False,False
31.098415887165963,Medium,2513,False,False,Minimize the Maximum of Two Arrays,minimize-the-maximum-of-two-arrays,"['Math', 'Binary Search', 'Number Theory']",False,False
34.79452685893301,Hard,2514,False,False,Count Anagrams,count-anagrams,"['Hash Table', 'Math', 'String', 'Combinatorics', 'Counting']",False,False
50.27901311503271,Easy,2515,False,False,Shortest Distance to Target String in a Circular Array,shortest-distance-to-target-string-in-a-circular-array,"['Array', 'String']",False,False
51.71780206213409,Medium,2516,False,False,Take K of Each Character From Left and Right,take-k-of-each-character-from-left-and-right,"['Hash Table', 'String', 'Sliding Window']",True,False
65.69556732645665,Medium,2517,False,False,Maximum Tastiness of Candy Basket,maximum-tastiness-of-candy-basket,"['Array', 'Binary Search', 'Greedy', 'Sorting']",False,False
32.2358124166715,Hard,2518,False,False,Number of Great Partitions,number-of-great-partitions,"['Array', 'Dynamic Programming']",False,False
53.098690364826936,Hard,2519,False,True,Count the Number of K-Big Indices,count-the-number-of-k-big-indices,"['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']",False,False
85.59336830358836,Easy,2520,False,False,Count the Digits That Divide a Number,count-the-digits-that-divide-a-number,['Math'],False,False
52.59529602595296,Medium,2521,False,False,Distinct Prime Factors of Product of Array,distinct-prime-factors-of-product-of-array,"['Array', 'Hash Table', 'Math', 'Number Theory']",False,False
46.35590587869846,Medium,2522,False,False,Partition String Into Substrings With Values at Most K,partition-string-into-substrings-with-values-at-most-k,"['String', 'Dynamic Programming', 'Greedy']",False,False
51.543034693411826,Medium,2523,False,False,Closest Prime Numbers in Range,closest-prime-numbers-in-range,"['Math', 'Number Theory']",True,False
34.418604651162795,Hard,2524,False,True,Maximum Frequency Score of a Subarray,maximum-frequency-score-of-a-subarray,"['Array', 'Hash Table', 'Math', 'Stack', 'Sliding Window']",False,False
37.14092065437394,Easy,2525,False,False,Categorize Box According to Criteria,categorize-box-according-to-criteria,['Math'],False,False
50.50967815828656,Medium,2526,False,False,Find Consecutive Integers from a Data Stream,find-consecutive-integers-from-a-data-stream,"['Hash Table', 'Design', 'Queue', 'Counting', 'Data Stream']",False,False
68.9540059347181,Medium,2527,False,False,Find Xor-Beauty of Array,find-xor-beauty-of-array,"['Array', 'Math', 'Bit Manipulation']",False,False
32.89364230540701,Hard,2528,False,False,Maximize the Minimum Powered City,maximize-the-minimum-powered-city,"['Array', 'Binary Search', 'Greedy', 'Queue', 'Sliding Window', 'Prefix Sum']",False,False
74.5483340439788,Easy,2529,False,False,Maximum Count of Positive Integer and Negative Integer,maximum-count-of-positive-integer-and-negative-integer,"['Array', 'Binary Search', 'Counting']",True,False
63.76075170777483,Medium,2530,False,False,Maximal Score After Applying K Operations,maximal-score-after-applying-k-operations,"['Array', 'Greedy', 'Heap (Priority Queue)']",True,False
26.80338234929452,Medium,2531,False,False,Make Number of Distinct Characters Equal,make-number-of-distinct-characters-equal,"['Hash Table', 'String', 'Counting']",False,False
43.40181058495822,Hard,2532,False,False,Time to Cross a Bridge,time-to-cross-a-bridge,"['Array', 'Heap (Priority Queue)', 'Simulation']",False,False
52.36830119933201,Medium,2533,False,True,Number of Good Binary Strings,number-of-good-binary-strings,['Dynamic Programming'],False,False
48.98798886164332,Hard,2534,False,True,Time Taken to Cross the Door,time-taken-to-cross-the-door,"['Array', 'Queue', 'Simulation']",False,False
84.74970141429644,Easy,2535,False,False,Difference Between Element Sum and Digit Sum of an Array,difference-between-element-sum-and-digit-sum-of-an-array,"['Array', 'Math']",False,False
51.241150249104095,Medium,2536,False,False,Increment Submatrices by One,increment-submatrices-by-one,"['Array', 'Matrix', 'Prefix Sum']",False,False
52.93385776208059,Medium,2537,False,False,Count the Number of Good Subarrays,count-the-number-of-good-subarrays,"['Array', 'Hash Table', 'Sliding Window']",False,False
31.59738192110384,Hard,2538,False,False,Difference Between Maximum and Minimum Price Sum,difference-between-maximum-and-minimum-price-sum,"['Array', 'Dynamic Programming', 'Tree', 'Depth-First Search']",False,False
51.55490767735665,Medium,2539,False,True,Count the Number of Good Subsequences,count-the-number-of-good-subsequences,"['Hash Table', 'Math', 'String', 'Combinatorics', 'Counting']",False,False
58.26082313491809,Easy,2540,False,False,Minimum Common Value,minimum-common-value,"['Array', 'Hash Table', 'Two Pointers', 'Binary Search']",True,False
32.204716327525595,Medium,2541,False,False,Minimum Operations to Make Array Equal II,minimum-operations-to-make-array-equal-ii,"['Array', 'Math', 'Greedy']",False,False
54.14420306506638,Medium,2542,False,False,Maximum Subsequence Score,maximum-subsequence-score,"['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",True,False
43.14794791030041,Hard,2543,False,False,Check if Point Is Reachable,check-if-point-is-reachable,"['Math', 'Number Theory']",False,False
68.35651927035275,Easy,2544,False,False,Alternating Digit Sum,alternating-digit-sum,['Math'],False,False
85.54666666666667,Medium,2545,False,False,Sort the Students by Their Kth Score,sort-the-students-by-their-kth-score,"['Array', 'Sorting', 'Matrix']",False,False
41.51355905006419,Medium,2546,False,False,Apply Bitwise Operations to Make Strings Equal,apply-bitwise-operations-to-make-strings-equal,"['String', 'Bit Manipulation']",False,False
41.79308297461778,Hard,2547,False,False,Minimum Cost to Split an Array,minimum-cost-to-split-an-array,"['Array', 'Hash Table', 'Dynamic Programming', 'Counting']",False,False
63.46737481031867,Medium,2548,False,True,Maximum Price to Fill a Bag,maximum-price-to-fill-a-bag,"['Array', 'Greedy', 'Sorting']",False,False
61.18857060080397,Easy,2549,False,False,Count Distinct Numbers on Board,count-distinct-numbers-on-board,"['Array', 'Hash Table', 'Math', 'Simulation']",False,False
28.63473436119022,Medium,2550,False,False,Count Collisions of Monkeys on a Polygon,count-collisions-of-monkeys-on-a-polygon,"['Math', 'Recursion']",False,False
72.60851629463264,Hard,2551,False,False,Put Marbles in Bags,put-marbles-in-bags,"['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",True,False
33.9321608040201,Hard,2552,False,False,Count Increasing Quadruplets,count-increasing-quadruplets,"['Array', 'Dynamic Programming', 'Binary Indexed Tree', 'Enumeration', 'Prefix Sum']",False,False
80.0933339433591,Easy,2553,False,False,Separate the Digits in an Array,separate-the-digits-in-an-array,"['Array', 'Simulation']",False,False
67.8537829797693,Medium,2554,False,False,Maximum Number of Integers to Choose From a Range I,maximum-number-of-integers-to-choose-from-a-range-i,"['Array', 'Hash Table', 'Binary Search', 'Greedy', 'Sorting']",True,False
34.79467258601554,Medium,2555,False,False,Maximize Win From Two Segments,maximize-win-from-two-segments,"['Array', 'Binary Search', 'Sliding Window']",False,False
27.2483378047358,Medium,2556,False,False,Disconnect Path in a Binary Matrix by at Most One Flip,disconnect-path-in-a-binary-matrix-by-at-most-one-flip,"['Array', 'Dynamic Programming', 'Depth-First Search', 'Breadth-First Search', 'Matrix']",False,False
35.37366548042705,Medium,2557,False,True,Maximum Number of Integers to Choose From a Range II,maximum-number-of-integers-to-choose-from-a-range-ii,"['Array', 'Binary Search', 'Greedy', 'Sorting']",False,False
75.69860088396568,Easy,2558,False,False,Take Gifts From the Richest Pile,take-gifts-from-the-richest-pile,"['Array', 'Heap (Priority Queue)', 'Simulation']",True,False
67.91048337071146,Medium,2559,False,False,Count Vowel Strings in Ranges,count-vowel-strings-in-ranges,"['Array', 'String', 'Prefix Sum']",True,False
65.17316630470135,Medium,2560,False,False,House Robber IV,house-robber-iv,"['Array', 'Binary Search']",True,False
34.91360080897005,Hard,2561,False,False,Rearranging Fruits,rearranging-fruits,"['Array', 'Hash Table', 'Greedy']",False,False
70.74435853309741,Easy,2562,False,False,Find the Array Concatenation Value,find-the-array-concatenation-value,"['Array', 'Two Pointers', 'Simulation']",False,False
48.81354655214631,Medium,2563,False,False,Count the Number of Fair Pairs,count-the-number-of-fair-pairs,"['Array', 'Two Pointers', 'Binary Search', 'Sorting']",True,False
34.273105002464845,Medium,2564,False,False,Substring XOR Queries,substring-xor-queries,"['Array', 'Hash Table', 'String', 'Bit Manipulation']",False,False
32.46777096264737,Hard,2565,False,False,Subsequence With the Minimum Score,subsequence-with-the-minimum-score,"['Two Pointers', 'String', 'Binary Search']",False,False
60.302850356294535,Easy,2566,False,False,Maximum Difference by Remapping a Digit,maximum-difference-by-remapping-a-digit,"['Math', 'Greedy']",False,False
48.661952474950645,Medium,2567,False,False,Minimum Score by Changing Two Elements,minimum-score-by-changing-two-elements,"['Array', 'Greedy', 'Sorting']",False,False
57.55871001504546,Medium,2568,False,False,Minimum Impossible OR,minimum-impossible-or,"['Array', 'Bit Manipulation', 'Brainteaser']",False,False
29.03798367057153,Hard,2569,False,False,Handling Sum Queries After Update,handling-sum-queries-after-update,"['Array', 'Segment Tree']",False,False
82.10280696306265,Easy,2570,False,False,Merge Two 2D Arrays by Summing Values,merge-two-2d-arrays-by-summing-values,"['Array', 'Hash Table', 'Two Pointers']",True,False
56.85597843949254,Medium,2571,False,False,Minimum Operations to Reduce an Integer to 0,minimum-operations-to-reduce-an-integer-to-0,"['Dynamic Programming', 'Greedy', 'Bit Manipulation']",False,False
24.64745030065695,Medium,2572,False,False,Count the Number of Square-Free Subsets,count-the-number-of-square-free-subsets,"['Array', 'Math', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']",False,False
31.44857582347637,Hard,2573,False,False,Find the String with LCP,find-the-string-with-lcp,"['Array', 'String', 'Dynamic Programming', 'Greedy', 'Union Find', 'Matrix']",False,False
87.32943469785575,Easy,2574,False,False,Left and Right Sum Differences,left-and-right-sum-differences,"['Array', 'Prefix Sum']",False,False
34.277141354670405,Medium,2575,False,False,Find the Divisibility Array of a String,find-the-divisibility-array-of-a-string,"['Array', 'Math', 'String']",False,False
39.645338587576475,Medium,2576,False,False,Find the Maximum Number of Marked Indices,find-the-maximum-number-of-marked-indices,"['Array', 'Two Pointers', 'Binary Search', 'Greedy', 'Sorting']",False,False
57.02568756107777,Hard,2577,False,False,Minimum Time to Visit a Cell In a Grid,minimum-time-to-visit-a-cell-in-a-grid,"['Array', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']",True,False
71.84995935431425,Easy,2578,False,False,Split With Minimum Sum,split-with-minimum-sum,"['Math', 'Greedy', 'Sorting']",False,False
66.19868829917942,Medium,2579,False,False,Count Total Number of Colored Cells,count-total-number-of-colored-cells,['Math'],True,False
37.74126685302451,Medium,2580,False,False,Count Ways to Group Overlapping Ranges,count-ways-to-group-overlapping-ranges,"['Array', 'Sorting']",False,False
46.07059402287542,Hard,2581,False,False,Count Number of Possible Root Nodes,count-number-of-possible-root-nodes,"['Array', 'Hash Table', 'Dynamic Programming', 'Tree', 'Depth-First Search']",False,False
56.565014292686335,Easy,2582,False,False,Pass the Pillow,pass-the-pillow,"['Math', 'Simulation']",True,False
59.30345844183596,Medium,2583,False,False,Kth Largest Sum in a Binary Tree,kth-largest-sum-in-a-binary-tree,"['Tree', 'Breadth-First Search', 'Sorting', 'Binary Tree']",True,False
23.221922731356692,Hard,2584,False,False,Split the Array to Make Coprime Products,split-the-array-to-make-coprime-products,"['Array', 'Hash Table', 'Math', 'Number Theory']",False,False
58.33671517189403,Hard,2585,False,False,Number of Ways to Earn Points,number-of-ways-to-earn-points,"['Array', 'Dynamic Programming']",False,False
73.36255174093012,Easy,2586,False,False,Count the Number of Vowel Strings in Range,count-the-number-of-vowel-strings-in-range,"['Array', 'String', 'Counting']",False,False
41.16527504911591,Medium,2587,False,False,Rearrange Array to Maximize Prefix Score,rearrange-array-to-maximize-prefix-score,"['Array', 'Greedy', 'Sorting', 'Prefix Sum']",False,False
51.38845023201575,Medium,2588,False,False,Count the Number of Beautiful Subarrays,count-the-number-of-beautiful-subarrays,"['Array', 'Hash Table', 'Bit Manipulation', 'Prefix Sum']",False,False
36.92520166985781,Hard,2589,False,False,Minimum Time to Complete All Tasks,minimum-time-to-complete-all-tasks,"['Array', 'Binary Search', 'Stack', 'Greedy', 'Sorting']",False,False
58.713692946058096,Medium,2590,False,True,Design a Todo List,design-a-todo-list,"['Array', 'Hash Table', 'String', 'Design', 'Sorting']",False,False
19.33628430504616,Easy,2591,False,False,Distribute Money to Maximum Children,distribute-money-to-maximum-children,"['Math', 'Greedy']",False,False
57.92293466033671,Medium,2592,False,False,Maximize Greatness of an Array,maximize-greatness-of-an-array,"['Array', 'Two Pointers', 'Greedy', 'Sorting']",False,False
64.68160169342035,Medium,2593,False,False,Find Score of an Array After Marking All Elements,find-score-of-an-array-after-marking-all-elements,"['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)', 'Simulation']",True,False
59.97331184638538,Medium,2594,False,False,Minimum Time to Repair Cars,minimum-time-to-repair-cars,"['Array', 'Binary Search']",True,False
72.29004000463077,Easy,2595,False,False,Number of Even and Odd Bits,number-of-even-and-odd-bits,['Bit Manipulation'],False,False
57.191384235312285,Medium,2596,False,False,Check Knight Tour Configuration,check-knight-tour-configuration,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix', 'Simulation']",False,False
50.703521943528386,Medium,2597,False,False,The Number of Beautiful Subsets,the-number-of-beautiful-subsets,"['Array', 'Hash Table', 'Math', 'Dynamic Programming', 'Backtracking', 'Sorting', 'Combinatorics']",True,False
39.566499119849,Medium,2598,False,False,Smallest Missing Non-negative Integer After Operations,smallest-missing-non-negative-integer-after-operations,"['Array', 'Hash Table', 'Math', 'Greedy']",False,False
51.63777763131879,Medium,2599,False,True,Make the Prefix Sum Non-negative,make-the-prefix-sum-non-negative,"['Array', 'Greedy', 'Heap (Priority Queue)']",True,False
60.72339185546733,Easy,2600,False,False,K Items With the Maximum Sum,k-items-with-the-maximum-sum,"['Math', 'Greedy']",False,False
55.58840696194659,Medium,2601,False,False,Prime Subtraction Operation,prime-subtraction-operation,"['Array', 'Math', 'Binary Search', 'Greedy', 'Number Theory']",True,False
36.55100718665722,Medium,2602,False,False,Minimum Operations to Make All Array Elements Equal,minimum-operations-to-make-all-array-elements-equal,"['Array', 'Binary Search', 'Sorting', 'Prefix Sum']",False,False
35.51760604755004,Hard,2603,False,False,Collect Coins in a Tree,collect-coins-in-a-tree,"['Array', 'Tree', 'Graph', 'Topological Sort']",False,False
39.3146120894812,Hard,2604,False,True,Minimum Time to Eat All Grains,minimum-time-to-eat-all-grains,"['Array', 'Two Pointers', 'Binary Search', 'Sorting']",False,False
54.13182488932612,Easy,2605,False,False,Form Smallest Number From Two Digit Arrays,form-smallest-number-from-two-digit-arrays,"['Array', 'Hash Table', 'Enumeration']",False,False
56.50598042769119,Medium,2606,False,False,Find the Substring With Maximum Cost,find-the-substring-with-maximum-cost,"['Array', 'Hash Table', 'String', 'Dynamic Programming']",False,False
36.17978206405264,Medium,2607,False,False,Make K-Subarray Sums Equal,make-k-subarray-sums-equal,"['Array', 'Math', 'Greedy', 'Sorting', 'Number Theory']",False,False
37.10931174089069,Hard,2608,False,False,Shortest Cycle in a Graph,shortest-cycle-in-a-graph,"['Breadth-First Search', 'Graph']",False,False
45.2443660235868,Easy,2609,False,False,Find the Longest Balanced Substring of a Binary String,find-the-longest-balanced-substring-of-a-binary-string,['String'],False,False
86.2853633538857,Medium,2610,False,False,Convert an Array Into a 2D Array With Conditions,convert-an-array-into-a-2d-array-with-conditions,"['Array', 'Hash Table']",True,False
46.92416683885822,Medium,2611,False,False,Mice and Cheese,mice-and-cheese,"['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",False,False
16.033790333748787,Hard,2612,False,False,Minimum Reverse Operations,minimum-reverse-operations,"['Array', 'Breadth-First Search', 'Ordered Set']",False,False
40.198511166253105,Hard,2613,False,True,Beautiful Pairs,beautiful-pairs,"['Array', 'Math', 'Divide and Conquer', 'Geometry', 'Sorting', 'Ordered Set']",False,False
35.83012661764519,Easy,2614,False,False,Prime In Diagonal,prime-in-diagonal,"['Array', 'Math', 'Matrix', 'Number Theory']",False,False
30.95825028847162,Medium,2615,False,False,Sum of Distances,sum-of-distances,"['Array', 'Hash Table', 'Prefix Sum']",False,False
43.657460296127056,Medium,2616,False,False,Minimize the Maximum Difference of Pairs,minimize-the-maximum-difference-of-pairs,"['Array', 'Binary Search', 'Greedy']",True,False
22.514956541370356,Hard,2617,False,False,Minimum Number of Visited Cells in a Grid,minimum-number-of-visited-cells-in-a-grid,"['Array', 'Dynamic Programming', 'Stack', 'Breadth-First Search', 'Union Find', 'Heap (Priority Queue)', 'Matrix', 'Monotonic Stack']",False,False
27.913440928621064,Medium,2618,False,False,Check if Object Instance of Class,check-if-object-instance-of-class,[],True,False
74.4455836875093,Easy,2619,False,False,Array Prototype Last,array-prototype-last,[],True,False
82.12723230294772,Easy,2620,False,False,Counter,counter,[],True,False
87.72812572769652,Easy,2621,False,False,Sleep,sleep,[],True,False
75.60473740878095,Medium,2622,False,False,Cache With Time Limit,cache-with-time-limit,[],True,False
63.213205267289354,Medium,2623,False,False,Memoize,memoize,[],True,False
66.91703653123933,Medium,2624,False,False,Snail Traversal,snail-traversal,[],True,False
64.12467052411606,Medium,2625,False,False,Flatten Deeply Nested Array,flatten-deeply-nested-array,[],True,False
85.36254749894447,Easy,2626,False,False,Array Reduce Transformation,array-reduce-transformation,[],True,False
91.74134713936559,Medium,2627,False,False,Debounce,debounce,[],True,False
39.10267229254571,Medium,2628,False,True,JSON Deep Equal,json-deep-equal,[],True,False
86.94400344428598,Easy,2629,False,False,Function Composition,function-composition,[],True,False
32.219437482595374,Hard,2630,False,False,Memoize II,memoize-ii,[],True,False
81.05302236777555,Medium,2631,False,False,Group By,group-by,[],True,False
89.35506590200222,Medium,2632,False,True,Curry,curry,[],True,False
77.82462057335582,Medium,2633,False,True,Convert Object to JSON String,convert-object-to-json-string,[],True,False
85.40335518490858,Easy,2634,False,False,Filter Elements from Array,filter-elements-from-array,[],True,False
86.04785712039744,Easy,2635,False,False,Apply Transform Over Each Element in Array,apply-transform-over-each-element-in-array,[],True,False
79.86896271815388,Medium,2636,False,True,Promise Pool,promise-pool,[],True,False
82.61635274156482,Medium,2637,False,False,Promise Time Limit,promise-time-limit,[],True,False
46.60571873176425,Medium,2638,False,True,Count the Number of K-Free Subsets,count-the-number-of-k-free-subsets,"['Array', 'Math', 'Dynamic Programming', 'Sorting', 'Combinatorics']",False,False
68.95406404712665,Easy,2639,False,False,Find the Width of Columns of a Grid,find-the-width-of-columns-of-a-grid,"['Array', 'Matrix']",False,False
71.81242415048543,Medium,2640,False,False,Find the Score of All Prefixes of an Array,find-the-score-of-all-prefixes-of-an-array,"['Array', 'Prefix Sum']",False,False
75.37526330105194,Medium,2641,False,False,Cousins in Binary Tree II,cousins-in-binary-tree-ii,"['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",True,False
70.52109911678116,Hard,2642,False,False,Design Graph With Shortest Path Calculator,design-graph-with-shortest-path-calculator,"['Graph', 'Design', 'Heap (Priority Queue)', 'Shortest Path']",True,False
74.73197431288781,Easy,2643,False,False,Row With Maximum Ones,row-with-maximum-ones,"['Array', 'Matrix']",False,False
50.1868444814892,Easy,2644,False,False,Find the Maximum Divisibility Score,find-the-maximum-divisibility-score,['Array'],False,False
50.07019954594336,Medium,2645,False,False,Minimum Additions to Make Valid String,minimum-additions-to-make-valid-string,"['String', 'Dynamic Programming', 'Stack', 'Greedy']",False,False
45.65339315759955,Hard,2646,False,False,Minimize the Total Price of the Trips,minimize-the-total-price-of-the-trips,"['Array', 'Dynamic Programming', 'Tree', 'Depth-First Search', 'Graph']",False,False
59.165424739195224,Hard,2647,False,True,Color the Triangle Red,color-the-triangle-red,"['Array', 'Math']",False,False
83.57389251997095,Easy,2648,False,False,Generate Fibonacci Sequence,generate-fibonacci-sequence,[],True,False
79.7041294167731,Medium,2649,False,False,Nested Array Generator,nested-array-generator,[],True,False
51.393456811493856,Hard,2650,False,False,Design Cancellable Function,design-cancellable-function,[],False,False
76.95660876720859,Easy,2651,False,False,Calculate Delayed Arrival Time,calculate-delayed-arrival-time,['Math'],False,False
85.01591150174269,Easy,2652,False,False,Sum Multiples,sum-multiples,['Math'],False,False
33.54392455189662,Medium,2653,False,False,Sliding Subarray Beauty,sliding-subarray-beauty,"['Array', 'Hash Table', 'Sliding Window']",False,False
33.474313022700116,Medium,2654,False,False,Minimum Number of Operations to Make All Array Elements Equal to 1,minimum-number-of-operations-to-make-all-array-elements-equal-to-1,"['Array', 'Math', 'Number Theory']",False,False
48.53919583453862,Medium,2655,False,True,Find Maximal Uncovered Ranges,find-maximal-uncovered-ranges,"['Array', 'Sorting']",False,False
79.60801861464113,Easy,2656,False,False,Maximum Sum With Exactly K Elements ,maximum-sum-with-exactly-k-elements,"['Array', 'Greedy']",False,False
87.05921571497102,Medium,2657,False,False,Find the Prefix Common Array of Two Arrays,find-the-prefix-common-array-of-two-arrays,"['Array', 'Hash Table', 'Bit Manipulation']",True,False
70.46514414436004,Medium,2658,False,False,Maximum Number of Fish in a Grid,maximum-number-of-fish-in-a-grid,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']",True,False
25.246067985794014,Hard,2659,False,False,Make Array Empty,make-array-empty,"['Array', 'Binary Search', 'Greedy', 'Binary Indexed Tree', 'Segment Tree', 'Sorting', 'Ordered Set']",False,False
35.33465800261354,Easy,2660,False,False,Determine the Winner of a Bowling Game,determine-the-winner-of-a-bowling-game,"['Array', 'Simulation']",False,False
63.962606308401405,Medium,2661,False,False,First Completely Painted Row or Column,first-completely-painted-row-or-column,"['Array', 'Hash Table', 'Matrix']",True,False
39.91386217948718,Medium,2662,False,False,Minimum Cost of a Path With Special Roads,minimum-cost-of-a-path-with-special-roads,"['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path']",False,False
38.90432224854972,Hard,2663,False,False,Lexicographically Smallest Beautiful String,lexicographically-smallest-beautiful-string,"['String', 'Greedy']",False,False
72.94738103799592,Medium,2664,False,True,The Knight’s Tour,the-knights-tour,"['Array', 'Backtracking', 'Matrix']",True,False
80.99159107462094,Easy,2665,False,False,Counter II,counter-ii,[],True,False
86.5795677909627,Easy,2666,False,False,Allow One Function Call,allow-one-function-call,[],True,False
82.04328420930604,Easy,2667,False,False,Create Hello World Function,create-hello-world-function,[],True,False
74.58160492061222,Easy,2668,False,True,Find Latest Salaries,find-latest-salaries,['Database'],True,False
74.11764705882354,Easy,2669,False,True,Count Artist Occurrences On Spotify Ranking List,count-artist-occurrences-on-spotify-ranking-list,['Database'],False,False
75.83237851317651,Easy,2670,False,False,Find the Distinct Difference Array,find-the-distinct-difference-array,"['Array', 'Hash Table']",False,False
30.835102010771553,Medium,2671,False,False,Frequency Tracker,frequency-tracker,"['Hash Table', 'Design']",False,False
54.338302403407354,Medium,2672,False,False,Number of Adjacent Elements With the Same Color,number-of-adjacent-elements-with-the-same-color,['Array'],False,False
56.131782508045845,Medium,2673,False,False,Make Costs of Paths Equal in a Binary Tree,make-costs-of-paths-equal-in-a-binary-tree,"['Array', 'Dynamic Programming', 'Greedy', 'Tree', 'Binary Tree']",False,False
76.18433773767322,Medium,2674,False,True,Split a Circular Linked List,split-a-circular-linked-list,"['Linked List', 'Two Pointers']",False,False
68.68194192377496,Hard,2675,False,True,Array of Objects to Matrix,array-of-objects-to-matrix,[],True,False
83.21633694958518,Medium,2676,False,True,Throttle,throttle,[],True,False
84.44079665246558,Easy,2677,False,False,Chunk Array,chunk-array,[],True,False
81.31498941241881,Easy,2678,False,False,Number of Senior Citizens,number-of-senior-citizens,"['Array', 'String']",True,False
58.79222315170046,Medium,2679,False,False,Sum in a Matrix,sum-in-a-matrix,"['Array', 'Sorting', 'Heap (Priority Queue)', 'Matrix', 'Simulation']",False,False
40.92960057427062,Medium,2680,False,False,Maximum OR,maximum-or,"['Array', 'Greedy', 'Bit Manipulation', 'Prefix Sum']",False,False
29.34451010031606,Hard,2681,False,False,Power of Heroes,power-of-heroes,"['Array', 'Math', 'Dynamic Programming', 'Sorting', 'Prefix Sum']",False,False
48.662170292264335,Easy,2682,False,False,Find the Losers of the Circular Game,find-the-losers-of-the-circular-game,"['Array', 'Hash Table', 'Simulation']",False,False
79.73720046340522,Medium,2683,False,False,Neighboring Bitwise XOR,neighboring-bitwise-xor,"['Array', 'Bit Manipulation']",True,False
58.84655856120794,Medium,2684,False,False,Maximum Number of Moves in a Grid,maximum-number-of-moves-in-a-grid,"['Array', 'Dynamic Programming', 'Matrix']",True,False
77.69588649868719,Medium,2685,False,False,Count the Number of Complete Components,count-the-number-of-complete-components,"['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",True,False
69.26178660049628,Medium,2686,False,True,Immediate Food Delivery III,immediate-food-delivery-iii,['Database'],False,False
81.30094554939681,Easy,2687,False,True,Bikes Last Time Used ,bikes-last-time-used,['Database'],False,False
44.31840217180532,Medium,2688,False,True,Find Active Users,find-active-users,['Database'],False,False
73.98499134115836,Easy,2689,False,True,Extract Kth Character From The Rope Tree,extract-kth-character-from-the-rope-tree,"['Tree', 'Depth-First Search', 'Binary Tree']",False,False
92.97566371681415,Easy,2690,False,True,Infinite Method Object,infinite-method-object,[],True,False
41.123882503192846,Hard,2691,False,True,Immutability Helper,immutability-helper,[],False,False
64.91620111731844,Medium,2692,False,True,Make Object Immutable,make-object-immutable,[],True,False
78.73728150273936,Medium,2693,False,False,Call Function with Custom Context,call-function-with-custom-context,[],True,False
74.37728329458652,Medium,2694,False,False,Event Emitter,event-emitter,[],True,False
89.10368232420946,Easy,2695,False,False,Array Wrapper,array-wrapper,[],True,False
77.05769617004184,Easy,2696,False,False,Minimum String Length After Removing Substrings,minimum-string-length-after-removing-substrings,"['String', 'Stack', 'Simulation']",True,False
78.92322030253065,Easy,2697,False,False,Lexicographically Smallest Palindrome,lexicographically-smallest-palindrome,"['Two Pointers', 'String', 'Greedy']",False,False
81.84400915563428,Medium,2698,False,False,Find the Punishment Number of an Integer,find-the-punishment-number-of-an-integer,"['Math', 'Backtracking']",True,False
56.16028963479717,Hard,2699,False,False,Modify Graph Edge Weights,modify-graph-edge-weights,"['Graph', 'Heap (Priority Queue)', 'Shortest Path']",True,False
75.20220950877885,Medium,2700,False,True,Differences Between Two Objects,differences-between-two-objects,[],True,False
33.949210483477124,Hard,2701,False,True,Consecutive Transactions with Increasing Amounts,consecutive-transactions-with-increasing-amounts,['Database'],True,False
41.53986332574032,Hard,2702,False,True,Minimum Operations to Make Numbers Non-positive,minimum-operations-to-make-numbers-non-positive,"['Array', 'Binary Search']",False,False
94.45842310042124,Easy,2703,False,False,Return Length of Arguments Passed,return-length-of-arguments-passed,[],True,False
62.84171523599419,Easy,2704,False,False,To Be Or Not To Be,to-be-or-not-to-be,[],True,False
66.6823008517504,Medium,2705,False,False,Compact Object,compact-object,[],True,False
68.25067939375093,Easy,2706,False,False,Buy Two Chocolates,buy-two-chocolates,"['Array', 'Greedy', 'Sorting']",True,False
56.98979498471992,Medium,2707,False,False,Extra Characters in a String,extra-characters-in-a-string,"['Array', 'Hash Table', 'String', 'Dynamic Programming', 'Trie']",True,False
24.56979826571416,Medium,2708,False,False,Maximum Strength of a Group,maximum-strength-of-a-group,"['Array', 'Dynamic Programming', 'Backtracking', 'Greedy', 'Bit Manipulation', 'Sorting', 'Enumeration']",False,False
41.798996534423004,Hard,2709,False,False,Greatest Common Divisor Traversal,greatest-common-divisor-traversal,"['Array', 'Math', 'Union Find', 'Number Theory']",True,False
78.46570361441022,Easy,2710,False,False,Remove Trailing Zeros From a String,remove-trailing-zeros-from-a-string,['String'],False,False
67.59830069952407,Medium,2711,False,False,Difference of Number of Distinct Values on Diagonals,difference-of-number-of-distinct-values-on-diagonals,"['Array', 'Hash Table', 'Matrix']",False,False
53.04496300512237,Medium,2712,False,False,Minimum Cost to Make All Characters Equal,minimum-cost-to-make-all-characters-equal,"['String', 'Dynamic Programming', 'Greedy']",False,False
30.44890123355935,Hard,2713,False,False,Maximum Strictly Increasing Cells in a Matrix,maximum-strictly-increasing-cells-in-a-matrix,"['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming', 'Memoization', 'Sorting', 'Matrix', 'Ordered Set']",False,False
61.82692307692308,Hard,2714,False,True,Find Shortest Path with K Hops,find-shortest-path-with-k-hops,"['Graph', 'Heap (Priority Queue)', 'Shortest Path']",False,False
89.51202001019037,Easy,2715,False,False,Timeout Cancellation,timeout-cancellation,[],True,False
76.8125151644695,Easy,2716,False,False,Minimize String Length,minimize-string-length,"['Hash Table', 'String']",False,False
63.07187766121288,Easy,2717,False,False,Semi-Ordered Permutation,semi-ordered-permutation,"['Array', 'Simulation']",False,False
31.01637996024947,Medium,2718,False,False,Sum of Matrix After Queries,sum-of-matrix-after-queries,"['Array', 'Hash Table']",False,False
37.412421640415104,Hard,2719,False,False,Count of Integers,count-of-integers,"['Math', 'String', 'Dynamic Programming']",False,False
54.8006509357201,Hard,2720,False,True,Popularity Percentage,popularity-percentage,['Database'],True,False
77.28472824652057,Medium,2721,False,False,Execute Asynchronous Functions in Parallel,execute-asynchronous-functions-in-parallel,[],True,False
55.918991855814184,Medium,2722,False,False,Join Two Arrays by ID,join-two-arrays-by-id,[],True,False
91.75199816143612,Easy,2723,False,False,Add Two Promises,add-two-promises,[],True,False
83.07704924754992,Easy,2724,False,False,Sort By,sort-by,[],True,False
83.61464486337863,Easy,2725,False,False,Interval Cancellation,interval-cancellation,[],True,False
77.21638422260045,Easy,2726,False,False,Calculator with Method Chaining,calculator-with-method-chaining,[],True,False
81.30203596165956,Easy,2727,False,False,Is Object Empty,is-object-empty,[],True,False
85.3697238971755,Easy,2728,False,True,Count Houses in a Circular Street,count-houses-in-a-circular-street,"['Array', 'Interactive']",False,False
52.1670316543898,Easy,2729,False,False,Check if The Number is Fascinating,check-if-the-number-is-fascinating,"['Hash Table', 'Math']",False,False
36.71258034894399,Medium,2730,False,False,Find the Longest Semi-Repetitive Substring,find-the-longest-semi-repetitive-substring,"['String', 'Sliding Window']",False,False
26.93099625151787,Medium,2731,False,False,Movement of Robots,movement-of-robots,"['Array', 'Brainteaser', 'Sorting', 'Prefix Sum']",False,False
45.758712487899324,Hard,2732,False,False,Find a Good Subset of the Matrix,find-a-good-subset-of-the-matrix,"['Array', 'Hash Table', 'Bit Manipulation', 'Matrix']",False,False
75.8410569242695,Easy,2733,False,False,Neither Minimum nor Maximum,neither-minimum-nor-maximum,"['Array', 'Sorting']",False,False
31.884704807772152,Medium,2734,False,False,Lexicographically Smallest String After Substring Operation,lexicographically-smallest-string-after-substring-operation,"['String', 'Greedy']",False,False
33.427320620316095,Medium,2735,False,False,Collecting Chocolates,collecting-chocolates,"['Array', 'Enumeration']",False,False
27.61447956380929,Hard,2736,False,False,Maximum Sum Queries,maximum-sum-queries,"['Array', 'Binary Search', 'Stack', 'Binary Indexed Tree', 'Segment Tree', 'Sorting', 'Monotonic Stack']",False,False
64.65002447381302,Medium,2737,False,True,Find the Closest Marked Node,find-the-closest-marked-node,"['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path']",True,False
55.47136323298518,Medium,2738,False,True,Count Occurrences in Text,count-occurrences-in-text,['Database'],True,False
39.84446977623011,Easy,2739,False,False,Total Distance Traveled,total-distance-traveled,"['Math', 'Simulation']",False,False
64.11903490795116,Medium,2740,False,False,Find the Value of the Partition,find-the-value-of-the-partition,"['Array', 'Sorting']",False,False
28.265023662827037,Medium,2741,False,False,Special Permutations,special-permutations,"['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']",False,False
49.77738584303013,Hard,2742,False,False,Painting the Walls,painting-the-walls,"['Array', 'Dynamic Programming']",True,False
75.9417233777437,Medium,2743,False,True,Count Substrings Without Repeating Character,count-substrings-without-repeating-character,"['Hash Table', 'String', 'Sliding Window']",True,False
81.33326237737924,Easy,2744,False,False,Find Maximum Number of String Pairs,find-maximum-number-of-string-pairs,"['Array', 'Hash Table', 'String', 'Simulation']",False,False
53.56417359187442,Medium,2745,False,False,Construct the Longest New String,construct-the-longest-new-string,"['Math', 'Dynamic Programming', 'Greedy', 'Brainteaser']",False,False
25.949918345127927,Medium,2746,False,False,Decremental String Concatenation,decremental-string-concatenation,"['Array', 'String', 'Dynamic Programming']",False,False
32.60192966075319,Medium,2747,False,False,Count Zero Request Servers,count-zero-request-servers,"['Array', 'Hash Table', 'Sliding Window', 'Sorting']",False,False
50.52757465150175,Easy,2748,False,False,Number of Beautiful Pairs,number-of-beautiful-pairs,"['Array', 'Hash Table', 'Math', 'Counting', 'Number Theory']",False,False
29.945754455883982,Medium,2749,False,False,Minimum Operations to Make the Integer Zero,minimum-operations-to-make-the-integer-zero,"['Bit Manipulation', 'Brainteaser', 'Enumeration']",False,False
33.621843117578194,Medium,2750,False,False,Ways to Split Array Into Good Subarrays,ways-to-split-array-into-good-subarrays,"['Array', 'Math', 'Dynamic Programming']",False,False
56.08739499138073,Hard,2751,False,False,Robot Collisions,robot-collisions,"['Array', 'Stack', 'Sorting', 'Simulation']",True,False
40.76691995052129,Hard,2752,False,True,Customers with Maximum Number of Transactions on Consecutive Days,customers-with-maximum-number-of-transactions-on-consecutive-days,['Database'],False,False
61.14890400604687,Hard,2753,False,True,Count Houses in a Circular Street II,count-houses-in-a-circular-street-ii,[],True,False
86.70634920634922,Medium,2754,False,True,Bind Function to Context,bind-function-to-context,[],True,False
65.96330275229357,Medium,2755,False,True,Deep Merge of Two Objects,deep-merge-of-two-objects,[],True,False
66.25954198473283,Hard,2756,False,True,Query Batching,query-batching,[],True,False
73.31536388140162,Medium,2757,False,True,Generate Circular Array Values,generate-circular-array-values,[],True,False
84.94337108594272,Easy,2758,False,True,Next Day,next-day,[],True,False
61.87793427230047,Hard,2759,False,True,Convert JSON String to Object,convert-json-string-to-object,[],True,False
29.965043607217257,Easy,2760,False,False,Longest Even Odd Subarray With Threshold,longest-even-odd-subarray-with-threshold,"['Array', 'Sliding Window']",False,False
35.17194664443518,Medium,2761,False,False,Prime Pairs With Target Sum,prime-pairs-with-target-sum,"['Array', 'Math', 'Enumeration', 'Number Theory']",False,False
58.04853782087972,Medium,2762,False,False,Continuous Subarrays,continuous-subarrays,"['Array', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Ordered Set', 'Monotonic Queue']",True,False
41.86771547796057,Hard,2763,False,False,Sum of Imbalance Numbers of All Subarrays,sum-of-imbalance-numbers-of-all-subarrays,"['Array', 'Hash Table', 'Ordered Set']",False,False
65.96601073345259,Medium,2764,False,True,Is Array a Preorder of Some ‌Binary Tree,is-array-a-preorder-of-some-binary-tree,"['Stack', 'Tree', 'Depth-First Search', 'Binary Tree']",False,False
34.25206715108995,Easy,2765,False,False,Longest Alternating Subarray,longest-alternating-subarray,"['Array', 'Enumeration']",False,False
49.9402734150334,Medium,2766,False,False,Relocate Marbles,relocate-marbles,"['Array', 'Hash Table', 'Sorting', 'Simulation']",False,False
52.23613595706619,Medium,2767,False,False,Partition String Into Minimum Beautiful Substrings,partition-string-into-minimum-beautiful-substrings,"['Hash Table', 'String', 'Dynamic Programming', 'Backtracking']",False,False
37.302785018521064,Medium,2768,False,False,Number of Black Blocks,number-of-black-blocks,"['Array', 'Hash Table', 'Enumeration']",False,False
90.76835556416277,Easy,2769,False,False,Find the Maximum Achievable Number,find-the-maximum-achievable-number,['Math'],False,False
30.97866975741678,Medium,2770,False,False,Maximum Number of Jumps to Reach the Last Index,maximum-number-of-jumps-to-reach-the-last-index,"['Array', 'Dynamic Programming']",False,False
29.64915838572298,Medium,2771,False,False,Longest Non-decreasing Subarray From Two Arrays,longest-non-decreasing-subarray-from-two-arrays,"['Array', 'Dynamic Programming']",False,False
32.35089347876537,Medium,2772,False,False,Apply Operations to Make All Array Elements Equal to Zero,apply-operations-to-make-all-array-elements-equal-to-zero,"['Array', 'Prefix Sum']",False,False
73.40286831812256,Medium,2773,False,True,Height of Special Binary Tree,height-of-special-binary-tree,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",False,False
82.66129032258065,Easy,2774,False,True,Array Upper Bound,array-upper-bound,[],True,False
70.47704770477048,Medium,2775,False,True,Undefined to Null,undefined-to-null,[],True,False
92.33543733092876,Medium,2776,False,True,Convert Callback Based Function to Promise Based Function,convert-callback-based-function-to-promise-based-function,[],True,False
82.05521472392638,Medium,2777,False,True,Date Range Generator,date-range-generator,[],True,False
80.92827330344721,Easy,2778,False,False,Sum of Squares of Special Elements ,sum-of-squares-of-special-elements,"['Array', 'Enumeration']",False,False
58.0016800448012,Medium,2779,False,False,Maximum Beauty of an Array After Applying Operation,maximum-beauty-of-an-array-after-applying-operation,"['Array', 'Binary Search', 'Sliding Window', 'Sorting']",True,False
75.84845018249169,Medium,2780,False,False,Minimum Index of a Valid Split,minimum-index-of-a-valid-split,"['Array', 'Hash Table', 'Sorting']",True,False
37.57210559046169,Hard,2781,False,False,Length of the Longest Valid Substring,length-of-the-longest-valid-substring,"['Array', 'Hash Table', 'String', 'Sliding Window']",False,False
82.86224337994645,Medium,2782,False,True,Number of Unique Categories,number-of-unique-categories,"['Union Find', 'Interactive', 'Counting']",True,False
38.23680691286905,Medium,2783,False,True,Flight Occupancy and Waitlist Analysis,flight-occupancy-and-waitlist-analysis,['Database'],True,False
48.29933125958824,Easy,2784,False,False,Check if Array is Good,check-if-array-is-good,"['Array', 'Hash Table', 'Sorting']",False,False
79.93444560866178,Medium,2785,False,False,Sort Vowels in a String,sort-vowels-in-a-string,"['String', 'Sorting']",True,False
36.299336069128884,Medium,2786,False,False,Visit Array Positions to Maximize Score,visit-array-positions-to-maximize-score,"['Array', 'Dynamic Programming']",False,False
33.434896810506565,Medium,2787,False,False,Ways to Express an Integer as Sum of Powers,ways-to-express-an-integer-as-sum-of-powers,['Dynamic Programming'],False,False
74.52328258779872,Easy,2788,False,False,Split Strings by Separator,split-strings-by-separator,"['Array', 'String']",False,False
46.41818181818182,Medium,2789,False,False,Largest Element in an Array after Merge Operations,largest-element-in-an-array-after-merge-operations,"['Array', 'Greedy']",False,False
21.624684678097466,Hard,2790,False,False,Maximum Number of Groups With Increasing Length,maximum-number-of-groups-with-increasing-length,"['Array', 'Math', 'Binary Search', 'Greedy', 'Sorting']",False,False
45.1500505788468,Hard,2791,False,False,Count Paths That Can Form a Palindrome in a Tree,count-paths-that-can-form-a-palindrome-in-a-tree,"['Dynamic Programming', 'Bit Manipulation', 'Tree', 'Depth-First Search', 'Bitmask']",False,False
57.63239875389408,Hard,2792,False,True,Count Nodes That Are Great Enough,count-nodes-that-are-great-enough,"['Divide and Conquer', 'Tree', 'Depth-First Search', 'Binary Tree']",False,False
78.61482381530985,Hard,2793,False,True,Status of Flight Tickets,status-of-flight-tickets,[],False,False
65.08538899430741,Easy,2794,False,True,Create Object from Two Arrays,create-object-from-two-arrays,[],True,False
89.7914379802415,Medium,2795,False,True,Parallel Execution of Promises for Individual Results Retrieval,parallel-execution-of-promises-for-individual-results-retrieval,[],True,False
93.19667260843731,Easy,2796,False,True,Repeat String,repeat-string,[],True,False
89.4342194955692,Easy,2797,False,True,Partial Function with Placeholders,partial-function-with-placeholders,[],False,False
87.57153487712833,Easy,2798,False,False,Number of Employees Who Met the Target,number-of-employees-who-met-the-target,['Array'],False,False
64.51630368575644,Medium,2799,False,False,Count Complete Subarrays in an Array,count-complete-subarrays-in-an-array,"['Array', 'Hash Table', 'Sliding Window']",False,False
30.516645125231424,Medium,2800,False,False,Shortest String That Contains Three Strings,shortest-string-that-contains-three-strings,"['String', 'Greedy', 'Enumeration']",False,False
25.58703529344632,Hard,2801,False,False,Count Stepping Numbers in Range,count-stepping-numbers-in-range,"['String', 'Dynamic Programming']",False,False
75.99796592931605,Medium,2802,False,True,Find The K-th Lucky Number,find-the-k-th-lucky-number,"['Math', 'String', 'Bit Manipulation']",True,False
87.20682302771856,Easy,2803,False,True,Factorial Generator,factorial-generator,[],True,False
89.2465252377469,Easy,2804,False,True,Array Prototype ForEach,array-prototype-foreach,[],True,False
82.75862068965517,Medium,2805,False,True,Custom Interval,custom-interval,[],True,False
54.777475794122644,Easy,2806,False,False,Account Balance After Rounded Purchase,account-balance-after-rounded-purchase,['Math'],False,False
91.53373730451656,Medium,2807,False,False,Insert Greatest Common Divisors in Linked List,insert-greatest-common-divisors-in-linked-list,"['Linked List', 'Math', 'Number Theory']",True,False
27.208989782865658,Medium,2808,False,False,Minimum Seconds to Equalize a Circular Array,minimum-seconds-to-equalize-a-circular-array,"['Array', 'Hash Table']",False,False
24.951162336393825,Hard,2809,False,False,Minimum Time to Make Array Sum At Most x,minimum-time-to-make-array-sum-at-most-x,"['Array', 'Dynamic Programming', 'Sorting']",False,False
82.6789682806923,Easy,2810,False,False,Faulty Keyboard,faulty-keyboard,"['String', 'Simulation']",False,False
33.7978150951159,Medium,2811,False,False,Check if it is Possible to Split Array,check-if-it-is-possible-to-split-array,"['Array', 'Dynamic Programming', 'Greedy']",False,False
48.32408970340005,Medium,2812,False,False,Find the Safest Path in a Grid,find-the-safest-path-in-a-grid,"['Array', 'Binary Search', 'Breadth-First Search', 'Union Find', 'Heap (Priority Queue)', 'Matrix']",True,False
29.40405244338498,Hard,2813,False,False,Maximum Elegance of a K-Length Subsequence,maximum-elegance-of-a-k-length-subsequence,"['Array', 'Hash Table', 'Stack', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",False,False
55.17841601392516,Hard,2814,False,True,Minimum Time Takes to Reach Destination Without Drowning,minimum-time-takes-to-reach-destination-without-drowning,"['Array', 'Breadth-First Search', 'Matrix']",False,False
58.79516986572948,Easy,2815,False,False,Max Pair Sum in an Array,max-pair-sum-in-an-array,"['Array', 'Hash Table']",False,False
61.20840454408364,Medium,2816,False,False,Double a Number Represented as a Linked List,double-a-number-represented-as-a-linked-list,"['Linked List', 'Math', 'Stack']",True,False
33.69600647416516,Medium,2817,False,False,Minimum Absolute Difference Between Elements With Constraint,minimum-absolute-difference-between-elements-with-constraint,"['Array', 'Binary Search', 'Ordered Set']",False,False
54.50599282501846,Hard,2818,False,False,Apply Operations to Maximize Score,apply-operations-to-maximize-score,"['Array', 'Math', 'Stack', 'Greedy', 'Sorting', 'Monotonic Stack', 'Number Theory']",True,False
41.886151231945625,Hard,2819,False,True,Minimum Relative Loss After Buying Chocolates,minimum-relative-loss-after-buying-chocolates,"['Array', 'Binary Search', 'Sorting', 'Prefix Sum']",False,False
68.39542760372565,Medium,2820,False,True,Election Results,election-results,[],False,False
71.30044843049326,Medium,2821,False,True,Delay the Resolution of Each Promise,delay-the-resolution-of-each-promise,[],True,False
59.44924406047516,Easy,2822,False,True,Inversion of Object,inversion-of-object,[],False,False
55.347871235721705,Medium,2823,False,True,Deep Object Filter,deep-object-filter,[],True,False
87.3769567297833,Easy,2824,False,False,Count Pairs Whose Sum is Less than Target,count-pairs-whose-sum-is-less-than-target,"['Array', 'Two Pointers', 'Binary Search', 'Sorting']",False,False
65.66149365891623,Medium,2825,False,False,Make String a Subsequence Using Cyclic Increments,make-string-a-subsequence-using-cyclic-increments,"['Two Pointers', 'String']",True,False
41.59707820213996,Medium,2826,False,False,Sorting Three Groups,sorting-three-groups,"['Array', 'Binary Search', 'Dynamic Programming']",False,False
19.056870363829034,Hard,2827,False,False,Number of Beautiful Integers in the Range,number-of-beautiful-integers-in-the-range,"['Math', 'Dynamic Programming']",False,False
82.51083780461775,Easy,2828,False,False,Check if a String Is an Acronym of Words,check-if-a-string-is-an-acronym-of-words,"['Array', 'String']",False,False
59.70442877021256,Medium,2829,False,False,Determine the Minimum Sum of a k-avoiding Array,determine-the-minimum-sum-of-a-k-avoiding-array,"['Math', 'Greedy']",False,False
36.77176095519826,Medium,2830,False,False,Maximize the Profit as the Salesman,maximize-the-profit-as-the-salesman,"['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming', 'Sorting']",False,False
35.801518957930966,Medium,2831,False,False,Find the Longest Equal Subarray,find-the-longest-equal-subarray,"['Array', 'Hash Table', 'Binary Search', 'Sliding Window']",False,False
75.30974581683485,Medium,2832,False,True,Maximal Range That Each Element Is Maximum in It,maximal-range-that-each-element-is-maximum-in-it,"['Array', 'Stack', 'Monotonic Stack']",True,False
64.14553499214996,Easy,2833,False,False,Furthest Point From Origin,furthest-point-from-origin,"['String', 'Counting']",False,False
36.08771303135407,Medium,2834,False,False,Find the Minimum Possible Sum of a Beautiful Array,find-the-minimum-possible-sum-of-a-beautiful-array,"['Math', 'Greedy']",False,False
31.13344635504965,Hard,2835,False,False,Minimum Operations to Form Subsequence With Target Sum,minimum-operations-to-form-subsequence-with-target-sum,"['Array', 'Greedy', 'Bit Manipulation']",False,False
28.129655314121333,Hard,2836,False,False,Maximize Value of Function in a Ball Passing Game,maximize-value-of-function-in-a-ball-passing-game,"['Array', 'Dynamic Programming', 'Bit Manipulation']",False,False
77.35849056603774,Easy,2837,False,True,Total Traveled Distance,total-traveled-distance,['Database'],True,False
68.53096247286261,Medium,2838,False,True,Maximum Coins Heroes Can Collect,maximum-coins-heroes-can-collect,"['Array', 'Two Pointers', 'Binary Search', 'Sorting', 'Prefix Sum']",True,False
46.9175948061954,Easy,2839,False,False,Check if Strings Can be Made Equal With Operations I,check-if-strings-can-be-made-equal-with-operations-i,['String'],False,False
54.982883225561054,Medium,2840,False,False,Check if Strings Can be Made Equal With Operations II,check-if-strings-can-be-made-equal-with-operations-ii,"['Hash Table', 'String', 'Sorting']",False,False
38.92117180298962,Medium,2841,False,False,Maximum Sum of Almost Unique Subarray,maximum-sum-of-almost-unique-subarray,"['Array', 'Hash Table', 'Sliding Window']",False,False
29.40175725730037,Hard,2842,False,False,Count K-Subsequences of a String With Maximum Beauty,count-k-subsequences-of-a-string-with-maximum-beauty,"['Hash Table', 'Math', 'String', 'Greedy', 'Combinatorics']",False,False
73.85649429440075,Easy,2843,False,False,  Count Symmetric Integers,count-symmetric-integers,"['Math', 'Enumeration']",True,False
37.893969005477715,Medium,2844,False,False,Minimum Operations to Make a Special Number,minimum-operations-to-make-a-special-number,"['Math', 'String', 'Greedy', 'Enumeration']",False,False
35.494309305958495,Medium,2845,False,False,Count of Interesting Subarrays,count-of-interesting-subarrays,"['Array', 'Hash Table', 'Prefix Sum']",False,False
41.94188353366787,Hard,2846,False,False,Minimum Edge Weight Equilibrium Queries in a Tree,minimum-edge-weight-equilibrium-queries-in-a-tree,"['Array', 'Tree', 'Graph', 'Strongly Connected Component']",False,False
43.446244477172314,Medium,2847,False,True,Smallest Number With Given Digit Product,smallest-number-with-given-digit-product,"['Math', 'Greedy']",False,False
72.69640159720839,Easy,2848,False,False,Points That Intersect With Cars,points-that-intersect-with-cars,"['Array', 'Hash Table', 'Prefix Sum']",False,False
35.73948075517532,Medium,2849,False,False,Determine if a Cell Is Reachable at a Given Time,determine-if-a-cell-is-reachable-at-a-given-time,['Math'],True,False
44.065612185120095,Medium,2850,False,False,Minimum Moves to Spread Stones Over Grid,minimum-moves-to-spread-stones-over-grid,"['Array', 'Dynamic Programming', 'Breadth-First Search', 'Matrix']",False,False
28.79016717879277,Hard,2851,False,False,String Transformation,string-transformation,"['Math', 'String', 'Dynamic Programming', 'String Matching']",False,False
70.75394506136762,Medium,2852,False,True,Sum of Remoteness of All Cells,sum-of-remoteness-of-all-cells,"['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']",True,False
74.06058599569609,Easy,2853,False,True,Highest Salaries Difference,highest-salaries-difference,['Database'],False,False
70.20984506766032,Medium,2854,False,True,Rolling Average Steps,rolling-average-steps,['Database'],False,False
56.429243065350256,Easy,2855,False,False,Minimum Right Shifts to Sort the Array,minimum-right-shifts-to-sort-the-array,['Array'],False,False
24.55963673964843,Medium,2856,False,False,Minimum Array Length After Pair Removals,minimum-array-length-after-pair-removals,"['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Greedy', 'Counting']",False,False
31.914276676507804,Medium,2857,False,False,Count Pairs of Points With Distance k,count-pairs-of-points-with-distance-k,"['Array', 'Hash Table', 'Bit Manipulation']",False,False
55.264266161297115,Hard,2858,False,False,Minimum Edge Reversals So Every Node Is Reachable,minimum-edge-reversals-so-every-node-is-reachable,"['Dynamic Programming', 'Depth-First Search', 'Breadth-First Search', 'Graph']",False,False
85.59737796833772,Easy,2859,False,False,Sum of Values at Indices With K Set Bits,sum-of-values-at-indices-with-k-set-bits,"['Array', 'Bit Manipulation']",False,False
50.013835380260105,Medium,2860,False,False,Happy Students,happy-students,"['Array', 'Sorting', 'Enumeration']",False,False
38.517952270609875,Medium,2861,False,False,Maximum Number of Alloys,maximum-number-of-alloys,"['Array', 'Binary Search']",False,False
41.270072992700726,Hard,2862,False,False,Maximum Element-Sum of a Complete Subset of Indices,maximum-element-sum-of-a-complete-subset-of-indices,"['Array', 'Math', 'Number Theory']",False,False
70.07157464212679,Medium,2863,False,True,Maximum Length of Semi-Decreasing Subarrays,maximum-length-of-semi-decreasing-subarrays,"['Array', 'Stack', 'Sorting', 'Monotonic Stack']",False,False
82.64577601569088,Easy,2864,False,False,Maximum Odd Binary Number,maximum-odd-binary-number,"['Math', 'String', 'Greedy']",True,False
43.16640858727844,Medium,2865,False,False,Beautiful Towers I,beautiful-towers-i,"['Array', 'Stack', 'Monotonic Stack']",False,False
34.15437715720113,Medium,2866,False,False,Beautiful Towers II,beautiful-towers-ii,"['Array', 'Stack', 'Monotonic Stack']",False,False
34.245517714677874,Hard,2867,False,False,Count Valid Paths in a Tree,count-valid-paths-in-a-tree,"['Math', 'Dynamic Programming', 'Tree', 'Depth-First Search', 'Number Theory']",False,False
53.497164461247635,Hard,2868,False,True,The Wording Game,the-wording-game,"['Array', 'Math', 'Two Pointers', 'String', 'Greedy', 'Game Theory']",False,False
60.5201048951049,Easy,2869,False,False,Minimum Operations to Collect Elements,minimum-operations-to-collect-elements,"['Array', 'Hash Table', 'Bit Manipulation']",False,False
61.79015622506571,Medium,2870,False,False,Minimum Number of Operations to Make Array Empty,minimum-number-of-operations-to-make-array-empty,"['Array', 'Hash Table', 'Greedy', 'Counting']",True,False
41.4004448861754,Medium,2871,False,False,Split Array Into Maximum Number of Subarrays,split-array-into-maximum-number-of-subarrays,"['Array', 'Greedy', 'Bit Manipulation']",False,False
69.78342926437685,Hard,2872,False,False,Maximum Number of K-Divisible Components,maximum-number-of-k-divisible-components,"['Tree', 'Depth-First Search']",True,False
58.338917221953366,Easy,2873,False,False,Maximum Value of an Ordered Triplet I,maximum-value-of-an-ordered-triplet-i,['Array'],True,False
56.858747499615326,Medium,2874,False,False,Maximum Value of an Ordered Triplet II,maximum-value-of-an-ordered-triplet-ii,['Array'],True,False
30.941481596961406,Medium,2875,False,False,Minimum Size Subarray in Infinite Array,minimum-size-subarray-in-infinite-array,"['Array', 'Hash Table', 'Sliding Window', 'Prefix Sum']",False,False
31.554573202820755,Hard,2876,False,False,Count Visited Nodes in a Directed Graph,count-visited-nodes-in-a-directed-graph,"['Dynamic Programming', 'Graph', 'Memoization']",False,False
81.47275180289427,Easy,2877,False,False,Create a DataFrame from List,create-a-dataframe-from-list,[],True,False
85.17231518003119,Easy,2878,False,False,Get the Size of a DataFrame,get-the-size-of-a-dataframe,[],True,False
93.07449801692674,Easy,2879,False,False,Display the First Three Rows,display-the-first-three-rows,[],True,False
79.28976981943198,Easy,2880,False,False,Select Data,select-data,[],True,False
90.26164711409987,Easy,2881,False,False,Create a New Column,create-a-new-column,[],True,False
85.59790155840147,Easy,2882,False,False,Drop Duplicate Rows,drop-duplicate-rows,[],True,False
64.31343237098632,Easy,2883,False,False,Drop Missing Data,drop-missing-data,[],True,False
92.50762257931603,Easy,2884,False,False,Modify Columns,modify-columns,[],True,False
85.59403770276195,Easy,2885,False,False,Rename Columns,rename-columns,[],True,False
87.48829953198128,Easy,2886,False,False,Change Data Type,change-data-type,[],True,False
72.27550544384968,Easy,2887,False,False,Fill Missing Data,fill-missing-data,[],True,False
90.73704611525964,Easy,2888,False,False,Reshape Data: Concatenate,reshape-data-concatenate,[],True,False
83.55766747585352,Easy,2889,False,False,Reshape Data: Pivot,reshape-data-pivot,[],True,False
86.14745023611017,Easy,2890,False,False,Reshape Data: Melt,reshape-data-melt,[],True,False
76.63526036214184,Easy,2891,False,False,Method Chaining,method-chaining,[],True,False
39.22922059246477,Medium,2892,False,True,Minimizing Array After Replacing Pairs With Their Product,minimizing-array-after-replacing-pairs-with-their-product,"['Array', 'Dynamic Programming', 'Greedy']",False,False
68.14101160499234,Medium,2893,False,True,Calculate Orders Within Each Interval,calculate-orders-within-each-interval,['Database'],False,False
88.28438440906407,Easy,2894,False,False,Divisible and Non-divisible Sums Difference,divisible-and-non-divisible-sums-difference,['Math'],False,False
68.85338511783917,Medium,2895,False,False,Minimum Processing Time,minimum-processing-time,"['Array', 'Greedy', 'Sorting']",False,False
27.036647992530344,Medium,2896,False,False,Apply Operations to Make Two Strings Equal,apply-operations-to-make-two-strings-equal,"['String', 'Dynamic Programming']",False,False
42.998690279596836,Hard,2897,False,False,Apply Operations on Array to Maximize Sum of Squares,apply-operations-on-array-to-maximize-sum-of-squares,"['Array', 'Hash Table', 'Greedy', 'Bit Manipulation']",False,False
58.61875350926445,Medium,2898,False,True,Maximum Linear Stock Score,maximum-linear-stock-score,"['Array', 'Hash Table']",False,False
63.37034590055626,Easy,2899,False,False,Last Visited Integers,last-visited-integers,"['Array', 'Simulation']",False,False
59.662363141573316,Easy,2900,False,False,Longest Unequal Adjacent Groups Subsequence I,longest-unequal-adjacent-groups-subsequence-i,"['Array', 'String', 'Dynamic Programming', 'Greedy']",False,False
27.750881316098706,Medium,2901,False,False,Longest Unequal Adjacent Groups Subsequence II,longest-unequal-adjacent-groups-subsequence-ii,"['Array', 'String', 'Dynamic Programming']",False,False
20.232117869783522,Hard,2902,False,False,Count of Sub-Multisets With Bounded Sum,count-of-sub-multisets-with-bounded-sum,"['Array', 'Hash Table', 'Dynamic Programming', 'Sliding Window']",False,False
60.30886220995338,Easy,2903,False,False,Find Indices With Index and Value Difference I,find-indices-with-index-and-value-difference-i,"['Array', 'Two Pointers']",False,False
39.570040653207464,Medium,2904,False,False,Shortest and Lexicographically Smallest Beautiful String,shortest-and-lexicographically-smallest-beautiful-string,"['String', 'Sliding Window']",False,False
31.607625124374184,Medium,2905,False,False,Find Indices With Index and Value Difference II,find-indices-with-index-and-value-difference-ii,"['Array', 'Two Pointers']",False,False
30.6785558938669,Medium,2906,False,False,Construct Product Matrix,construct-product-matrix,"['Array', 'Matrix', 'Prefix Sum']",False,False
54.577341283760084,Medium,2907,False,True,Maximum Profitable Triplets With Increasing Prices I,maximum-profitable-triplets-with-increasing-prices-i,"['Array', 'Binary Indexed Tree', 'Segment Tree']",False,False
65.61008210807714,Easy,2908,False,False,Minimum Sum of Mountain Triplets I,minimum-sum-of-mountain-triplets-i,['Array'],False,False
53.40410581689044,Medium,2909,False,False,Minimum Sum of Mountain Triplets II,minimum-sum-of-mountain-triplets-ii,['Array'],False,False
23.8994689775656,Medium,2910,False,False,Minimum Number of Groups to Create a Valid Assignment,minimum-number-of-groups-to-create-a-valid-assignment,"['Array', 'Hash Table', 'Greedy']",False,False
34.549224389494704,Hard,2911,False,False,Minimum Changes to Make K Semi-palindromes,minimum-changes-to-make-k-semi-palindromes,"['Two Pointers', 'String', 'Dynamic Programming']",False,False
58.59550561797753,Hard,2912,False,True,Number of Ways to Reach Destination in the Grid,number-of-ways-to-reach-destination-in-the-grid,"['Math', 'Dynamic Programming', 'Combinatorics']",False,False
79.35649260208716,Easy,2913,False,False,Subarrays Distinct Element Sum of Squares I,subarrays-distinct-element-sum-of-squares-i,"['Array', 'Hash Table']",False,False
76.49216821765728,Medium,2914,False,False,Minimum Number of Changes to Make Binary String Beautiful,minimum-number-of-changes-to-make-binary-string-beautiful,['String'],True,False
36.788998182401365,Medium,2915,False,False,Length of the Longest Subsequence That Sums to Target,length-of-the-longest-subsequence-that-sums-to-target,"['Array', 'Dynamic Programming']",False,False
20.434639807313335,Hard,2916,False,False,Subarrays Distinct Element Sum of Squares II,subarrays-distinct-element-sum-of-squares-ii,"['Array', 'Dynamic Programming', 'Binary Indexed Tree', 'Segment Tree']",False,False
71.98187353961623,Easy,2917,False,False,Find the K-or of an Array,find-the-k-or-of-an-array,"['Array', 'Bit Manipulation']",False,False
36.49859721259896,Medium,2918,False,False,Minimum Equal Sum of Two Arrays After Replacing Zeros,minimum-equal-sum-of-two-arrays-after-replacing-zeros,"['Array', 'Greedy']",False,False
33.682316015890784,Medium,2919,False,False,Minimum Increment Operations to Make Array Beautiful,minimum-increment-operations-to-make-array-beautiful,"['Array', 'Dynamic Programming']",False,False
35.419393218322426,Hard,2920,False,False,Maximum Points After Collecting Coins From All Nodes,maximum-points-after-collecting-coins-from-all-nodes,"['Array', 'Dynamic Programming', 'Bit Manipulation', 'Tree', 'Depth-First Search', 'Memoization']",False,False
45.9053343350864,Hard,2921,False,True,Maximum Profitable Triplets With Increasing Prices II,maximum-profitable-triplets-with-increasing-prices-ii,"['Array', 'Binary Indexed Tree', 'Segment Tree']",False,False
41.455331412103746,Medium,2922,False,True,Market Analysis III,market-analysis-iii,['Database'],False,False
72.17924821373097,Easy,2923,False,False,Find Champion I,find-champion-i,"['Array', 'Matrix']",False,False
69.9863620481724,Medium,2924,False,False,Find Champion II,find-champion-ii,['Graph'],True,False
46.70350731489171,Medium,2925,False,False,Maximum Score After Applying Operations on a Tree,maximum-score-after-applying-operations-on-a-tree,"['Dynamic Programming', 'Tree', 'Depth-First Search']",False,False
24.62270070341138,Hard,2926,False,False,Maximum Balanced Subsequence Sum,maximum-balanced-subsequence-sum,"['Array', 'Binary Search', 'Dynamic Programming', 'Binary Indexed Tree', 'Segment Tree']",False,False
43.76141205112599,Hard,2927,False,True,Distribute Candies Among Children III,distribute-candies-among-children-iii,"['Math', 'Combinatorics']",False,False
72.98692117355957,Easy,2928,False,False,Distribute Candies Among Children I,distribute-candies-among-children-i,"['Math', 'Combinatorics', 'Enumeration']",False,False
34.82316937732916,Medium,2929,False,False,Distribute Candies Among Children II,distribute-candies-among-children-ii,"['Math', 'Combinatorics', 'Enumeration']",False,False
55.87945039095119,Medium,2930,False,False,Number of Strings Which Can Be Rearranged to Contain Substring,number-of-strings-which-can-be-rearranged-to-contain-substring,"['Math', 'Dynamic Programming', 'Combinatorics']",False,False
59.60787873286739,Hard,2931,False,False,Maximum Spending After Buying Items,maximum-spending-after-buying-items,"['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Matrix']",False,False
74.54712877260387,Easy,2932,False,False,Maximum Strong Pair XOR I,maximum-strong-pair-xor-i,"['Array', 'Hash Table', 'Bit Manipulation', 'Trie', 'Sliding Window']",False,False
45.6223743451554,Medium,2933,False,False,High-Access Employees,high-access-employees,"['Array', 'Hash Table', 'String', 'Sorting']",False,False
42.99065420560748,Medium,2934,False,False,Minimum Operations to Maximize Last Elements in Arrays,minimum-operations-to-maximize-last-elements-in-arrays,"['Array', 'Enumeration']",False,False
30.38207507733467,Hard,2935,False,False,Maximum Strong Pair XOR II,maximum-strong-pair-xor-ii,"['Array', 'Hash Table', 'Bit Manipulation', 'Trie', 'Sliding Window']",False,False
62.559665871121716,Medium,2936,False,True,Number of Equal Numbers Blocks,number-of-equal-numbers-blocks,"['Array', 'Binary Search', 'Interactive']",False,False
42.846861861293135,Easy,2937,False,False,Make Three Strings Equal,make-three-strings-equal,['String'],False,False
64.66779225629905,Medium,2938,False,False,Separate Black and White Balls,separate-black-and-white-balls,"['Two Pointers', 'String', 'Greedy']",True,False
26.68522328452136,Medium,2939,False,False,Maximum Xor Product,maximum-xor-product,"['Math', 'Greedy', 'Bit Manipulation']",False,False
52.43168627929501,Hard,2940,False,False,Find Building Where Alice and Bob Can Meet,find-building-where-alice-and-bob-can-meet,"['Array', 'Binary Search', 'Stack', 'Binary Indexed Tree', 'Segment Tree', 'Heap (Priority Queue)', 'Monotonic Stack']",True,False
36.287508722958826,Hard,2941,False,True,Maximum GCD-Sum of a Subarray,maximum-gcd-sum-of-a-subarray,"['Array', 'Math', 'Binary Search', 'Number Theory']",False,False
88.37427148849379,Easy,2942,False,False,Find Words Containing Character,find-words-containing-character,"['Array', 'String']",False,False
36.63746045964785,Medium,2943,False,False,Maximize Area of Square Hole in Grid,maximize-area-of-square-hole-in-grid,"['Array', 'Sorting']",False,False
46.36194255571418,Medium,2944,False,False,Minimum Number of Coins for Fruits,minimum-number-of-coins-for-fruits,"['Array', 'Dynamic Programming', 'Queue', 'Heap (Priority Queue)', 'Monotonic Queue']",False,False
16.81316502544445,Hard,2945,False,False,Find Maximum Non-decreasing Array Length,find-maximum-non-decreasing-array-length,"['Array', 'Binary Search', 'Dynamic Programming', 'Stack', 'Queue', 'Monotonic Stack', 'Monotonic Queue']",False,False
57.88643873782424,Easy,2946,False,False,Matrix Similarity After Cyclic Shifts,matrix-similarity-after-cyclic-shifts,"['Array', 'Math', 'Matrix', 'Simulation']",False,False
59.272763106030744,Medium,2947,False,False,Count Beautiful Substrings I,count-beautiful-substrings-i,"['Hash Table', 'Math', 'String', 'Enumeration', 'Number Theory', 'Prefix Sum']",False,False
60.2490873419922,Medium,2948,False,False,Make Lexicographically Smallest Array by Swapping Elements,make-lexicographically-smallest-array-by-swapping-elements,"['Array', 'Union Find', 'Sorting']",True,False
24.511760792141207,Hard,2949,False,False,Count Beautiful Substrings II,count-beautiful-substrings-ii,"['Hash Table', 'Math', 'String', 'Number Theory', 'Prefix Sum']",False,False
73.31215250198571,Medium,2950,False,True,Number of Divisible Substrings,number-of-divisible-substrings,"['Hash Table', 'String', 'Counting', 'Prefix Sum']",False,False
73.93715995006713,Easy,2951,False,False,Find the Peaks,find-the-peaks,"['Array', 'Enumeration']",False,False
56.39502325241654,Medium,2952,False,False,Minimum Number of Coins to be Added,minimum-number-of-coins-to-be-added,"['Array', 'Greedy', 'Sorting']",False,False
28.165422885572138,Hard,2953,False,False,Count Complete Substrings,count-complete-substrings,"['Hash Table', 'String', 'Sliding Window']",False,False
32.97605091274494,Hard,2954,False,False,Count the Number of Infection Sequences,count-the-number-of-infection-sequences,"['Array', 'Math', 'Combinatorics']",False,False
61.338739507753594,Medium,2955,False,True,Number of Same-End Substrings,number-of-same-end-substrings,"['Array', 'Hash Table', 'String', 'Counting', 'Prefix Sum']",True,False
83.38068181818183,Easy,2956,False,False,Find Common Elements Between Two Arrays,find-common-elements-between-two-arrays,"['Array', 'Hash Table']",False,False
51.398982932202344,Medium,2957,False,False,Remove Adjacent Almost-Equal Characters,remove-adjacent-almost-equal-characters,"['String', 'Dynamic Programming', 'Greedy']",False,False
55.61592871884956,Medium,2958,False,False,Length of Longest Subarray With at Most K Frequency,length-of-longest-subarray-with-at-most-k-frequency,"['Array', 'Hash Table', 'Sliding Window']",True,False
47.85673998871968,Hard,2959,False,False,Number of Possible Sets of Closing Branches,number-of-possible-sets-of-closing-branches,"['Bit Manipulation', 'Graph', 'Heap (Priority Queue)', 'Enumeration', 'Shortest Path']",False,False
78.3334153664419,Easy,2960,False,False,Count Tested Devices After Test Operations,count-tested-devices-after-test-operations,"['Array', 'Simulation', 'Counting']",False,False
46.84303279518707,Medium,2961,False,False,Double Modular Exponentiation,double-modular-exponentiation,"['Array', 'Math', 'Simulation']",False,False
58.44205663373688,Medium,2962,False,False,Count Subarrays Where Max Element Appears at Least K Times,count-subarrays-where-max-element-appears-at-least-k-times,"['Array', 'Sliding Window']",True,False
46.22465015340866,Hard,2963,False,False,Count the Number of Good Partitions,count-the-number-of-good-partitions,"['Array', 'Hash Table', 'Math', 'Combinatorics']",False,False
67.20569210866752,Medium,2964,False,True,Number of Divisible Triplet Sums,number-of-divisible-triplet-sums,"['Array', 'Hash Table']",False,False
83.69592948684344,Easy,2965,False,False,Find Missing and Repeated Values,find-missing-and-repeated-values,"['Array', 'Hash Table', 'Math', 'Matrix']",True,False
71.65184940285596,Medium,2966,False,False,Divide Array Into Arrays With Max Difference,divide-array-into-arrays-with-max-difference,"['Array', 'Greedy', 'Sorting']",True,False
22.307620789041437,Medium,2967,False,False,Minimum Cost to Make Array Equalindromic,minimum-cost-to-make-array-equalindromic,"['Array', 'Math', 'Binary Search', 'Greedy', 'Sorting']",False,False
36.00871702137525,Hard,2968,False,False,Apply Operations to Maximize Frequency Score,apply-operations-to-maximize-frequency-score,"['Array', 'Binary Search', 'Sliding Window', 'Sorting', 'Prefix Sum']",False,False
45.028901734104046,Hard,2969,False,True,Minimum Number of Coins for Fruits II,minimum-number-of-coins-for-fruits-ii,"['Array', 'Dynamic Programming', 'Queue', 'Heap (Priority Queue)', 'Monotonic Queue']",False,False
54.26730400724378,Easy,2970,False,False,Count the Number of Incremovable Subarrays I,count-the-number-of-incremovable-subarrays-i,"['Array', 'Two Pointers', 'Binary Search', 'Enumeration']",False,False
65.31567626839863,Medium,2971,False,False,Find Polygon With the Largest Perimeter,find-polygon-with-the-largest-perimeter,"['Array', 'Greedy', 'Sorting', 'Prefix Sum']",True,False
38.644806977871106,Hard,2972,False,False,Count the Number of Incremovable Subarrays II,count-the-number-of-incremovable-subarrays-ii,"['Array', 'Two Pointers', 'Binary Search']",False,False
35.83974069048696,Hard,2973,False,False,Find Number of Coins to Place in Tree Nodes,find-number-of-coins-to-place-in-tree-nodes,"['Dynamic Programming', 'Tree', 'Depth-First Search', 'Sorting', 'Heap (Priority Queue)']",False,False
84.711298232627,Easy,2974,False,False,Minimum Number Game,minimum-number-game,"['Array', 'Sorting', 'Heap (Priority Queue)', 'Simulation']",False,False
23.829336783451197,Medium,2975,False,False,Maximum Square Area by Removing Fences From a Field,maximum-square-area-by-removing-fences-from-a-field,"['Array', 'Hash Table', 'Enumeration']",False,False
57.71435408259824,Medium,2976,False,False,Minimum Cost to Convert String I,minimum-cost-to-convert-string-i,"['Array', 'String', 'Graph', 'Shortest Path']",True,False
25.28584570902878,Hard,2977,False,False,Minimum Cost to Convert String II,minimum-cost-to-convert-string-ii,"['Array', 'String', 'Dynamic Programming', 'Graph', 'Trie', 'Shortest Path']",False,False
40.727677742713944,Medium,2978,False,True,Symmetric Coordinates,symmetric-coordinates,['Database'],False,False
80.24244113139196,Medium,2979,False,True,Most Expensive Item That Can Not Be Bought,most-expensive-item-that-can-not-be-bought,"['Math', 'Dynamic Programming', 'Number Theory']",False,False
69.45349513024182,Easy,2980,False,False,Check if Bitwise OR Has Trailing Zeros,check-if-bitwise-or-has-trailing-zeros,"['Array', 'Bit Manipulation']",False,False
61.863102870105536,Medium,2981,False,False,Find Longest Special Substring That Occurs Thrice I,find-longest-special-substring-that-occurs-thrice-i,"['Hash Table', 'String', 'Binary Search', 'Sliding Window', 'Counting']",True,False
38.160685267303826,Medium,2982,False,False,Find Longest Special Substring That Occurs Thrice II,find-longest-special-substring-that-occurs-thrice-ii,"['Hash Table', 'String', 'Binary Search', 'Sliding Window', 'Counting']",True,False
22.866637406733965,Hard,2983,False,False,Palindrome Rearrangement Queries,palindrome-rearrangement-queries,"['Hash Table', 'String', 'Prefix Sum']",False,False
61.96993493381198,Medium,2984,False,True,Find Peak Calling Hours for Each City,find-peak-calling-hours-for-each-city,['Database'],False,False
88.26342099543577,Easy,2985,False,True,Calculate Compressed Mean,calculate-compressed-mean,['Database'],False,False
53.64472753007785,Medium,2986,False,True,Find Third Transaction,find-third-transaction,['Database'],False,False
79.96936039831482,Easy,2987,False,True,Find Expensive Cities,find-expensive-cities,['Database'],False,False
80.78159782339847,Medium,2988,False,True,Manager of the Largest Department,manager-of-the-largest-department,['Database'],False,False
89.42428035043804,Medium,2989,False,True,Class Performance,class-performance,['Database'],False,False
63.66287547389909,Easy,2990,False,True,Loan Types,loan-types,['Database'],False,False
57.071713147410364,Hard,2991,False,True,Top Three Wineries ,top-three-wineries,['Database'],False,False
71.8927701056052,Medium,2992,False,True,Number of Self-Divisible Permutations,number-of-self-divisible-permutations,"['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']",False,False
80.91390359431597,Medium,2993,False,True,Friday Purchases I,friday-purchases-i,['Database'],False,False
76.48494711147275,Hard,2994,False,True,Friday Purchases II ,friday-purchases-ii,['Database'],False,False
43.20439100888657,Hard,2995,False,True,Viewers Turned Streamers,viewers-turned-streamers,['Database'],False,False
33.34490290029291,Easy,2996,False,False,Smallest Missing Integer Greater Than Sequential Prefix Sum,smallest-missing-integer-greater-than-sequential-prefix-sum,"['Array', 'Hash Table', 'Sorting']",False,False
85.73505749671553,Medium,2997,False,False,Minimum Number of Operations to Make Array XOR Equal to K,minimum-number-of-operations-to-make-array-xor-equal-to-k,"['Array', 'Bit Manipulation']",True,False
46.98755024017253,Medium,2998,False,False,Minimum Number of Operations to Make X and Y Equal,minimum-number-of-operations-to-make-x-and-y-equal,"['Dynamic Programming', 'Breadth-First Search', 'Memoization']",False,False
25.59251825596789,Hard,2999,False,False,Count the Number of Powerful Integers,count-the-number-of-powerful-integers,"['Math', 'String', 'Dynamic Programming']",True,False
36.28911221310396,Easy,3000,False,False,Maximum Area of Longest Diagonal Rectangle,maximum-area-of-longest-diagonal-rectangle,['Array'],False,False
21.251525075451102,Medium,3001,False,False,Minimum Moves to Capture The Queen,minimum-moves-to-capture-the-queen,"['Math', 'Enumeration']",False,False
44.53227268150236,Medium,3002,False,False,Maximum Size of a Set After Removals,maximum-size-of-a-set-after-removals,"['Array', 'Hash Table', 'Greedy']",False,False
27.124093583253522,Hard,3003,False,False,Maximize the Number of Partitions After Operations,maximize-the-number-of-partitions-after-operations,"['String', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']",False,False
56.656346749226,Medium,3004,False,True,Maximum Subtree of the Same Color,maximum-subtree-of-the-same-color,"['Array', 'Dynamic Programming', 'Tree', 'Depth-First Search']",False,False
77.88816944104664,Easy,3005,False,False,Count Elements With Maximum Frequency,count-elements-with-maximum-frequency,"['Array', 'Hash Table', 'Counting']",True,False
37.860684014530165,Medium,3006,False,False,Find Beautiful Indices in the Given Array I,find-beautiful-indices-in-the-given-array-i,"['Two Pointers', 'String', 'Binary Search', 'Rolling Hash', 'String Matching', 'Hash Function']",False,False
36.980949417418664,Medium,3007,False,False,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,"['Binary Search', 'Dynamic Programming', 'Bit Manipulation']",False,False
26.00729176404599,Hard,3008,False,False,Find Beautiful Indices in the Given Array II,find-beautiful-indices-in-the-given-array-ii,"['Two Pointers', 'String', 'Binary Search', 'Rolling Hash', 'String Matching', 'Hash Function']",False,False
45.11361129494816,Hard,3009,False,True,Maximum Number of Intersections on the Chart,maximum-number-of-intersections-on-the-chart,"['Array', 'Math', 'Binary Indexed Tree', 'Geometry']",False,False
65.50214592274678,Easy,3010,False,False,Divide an Array Into Subarrays With Minimum Cost I,divide-an-array-into-subarrays-with-minimum-cost-i,"['Array', 'Sorting', 'Enumeration']",False,False
66.53143271498986,Medium,3011,False,False,Find if Array Can Be Sorted,find-if-array-can-be-sorted,"['Array', 'Bit Manipulation', 'Sorting']",True,False
34.58690221270521,Medium,3012,False,False,Minimize Length of Array Using Operations,minimize-length-of-array-using-operations,"['Array', 'Math', 'Greedy', 'Number Theory']",False,False
29.69474497681607,Hard,3013,False,False,Divide an Array Into Subarrays With Minimum Cost II,divide-an-array-into-subarrays-with-minimum-cost-ii,"['Array', 'Hash Table', 'Sliding Window', 'Heap (Priority Queue)']",False,False
65.99563000728332,Easy,3014,False,False,Minimum Number of Pushes to Type Word I,minimum-number-of-pushes-to-type-word-i,"['Math', 'String', 'Greedy']",False,False
56.50790469270663,Medium,3015,False,False,Count the Number of Houses at a Certain Distance I,count-the-number-of-houses-at-a-certain-distance-i,"['Breadth-First Search', 'Graph', 'Prefix Sum']",False,False
79.89931711121649,Medium,3016,False,False,Minimum Number of Pushes to Type Word II,minimum-number-of-pushes-to-type-word-ii,"['Hash Table', 'String', 'Greedy', 'Sorting', 'Counting']",True,False
21.36741757240877,Hard,3017,False,False,Count the Number of Houses at a Certain Distance II,count-the-number-of-houses-at-a-certain-distance-ii,"['Graph', 'Prefix Sum']",False,False
43.04482225656878,Hard,3018,False,True,Maximum Number of Removal Queries That Can Be Processed I,maximum-number-of-removal-queries-that-can-be-processed-i,"['Array', 'Dynamic Programming']",False,False
79.50969444726424,Easy,3019,False,False,Number of Changing Keys,number-of-changing-keys,['String'],False,False
26.265562274505815,Medium,3020,False,False,Find the Maximum Number of Elements in Subset,find-the-maximum-number-of-elements-in-subset,"['Array', 'Hash Table', 'Enumeration']",False,False
46.9452392914091,Medium,3021,False,False,Alice and Bob Playing Flower Game,alice-and-bob-playing-flower-game,['Math'],False,False
28.663342448126105,Hard,3022,False,False,Minimize OR of Remaining Elements Using Operations,minimize-or-of-remaining-elements-using-operations,"['Array', 'Greedy', 'Bit Manipulation']",False,False
56.461001164144356,Medium,3023,False,True,Find Pattern in Infinite Stream I,find-pattern-in-infinite-stream-i,"['Array', 'Sliding Window', 'Rolling Hash', 'String Matching', 'Hash Function']",False,False
37.96600059648077,Easy,3024,False,False,Type of Triangle,type-of-triangle,"['Array', 'Math', 'Sorting']",False,False
40.524957877000844,Medium,3025,False,False,Find the Number of Ways to Place People I,find-the-number-of-ways-to-place-people-i,"['Array', 'Math', 'Geometry', 'Sorting', 'Enumeration']",False,False
20.002197353758262,Medium,3026,False,False,Maximum Good Subarray Sum,maximum-good-subarray-sum,"['Array', 'Hash Table', 'Prefix Sum']",False,False
45.717879021461314,Hard,3027,False,False,Find the Number of Ways to Place People II,find-the-number-of-ways-to-place-people-ii,"['Array', 'Math', 'Geometry', 'Sorting', 'Enumeration']",False,False
73.47393669214648,Easy,3028,False,False,Ant on the Boundary,ant-on-the-boundary,"['Array', 'Simulation', 'Prefix Sum']",False,False
41.03653355989805,Medium,3029,False,False,Minimum Time to Revert Word to Initial State I,minimum-time-to-revert-word-to-initial-state-i,"['String', 'Rolling Hash', 'String Matching', 'Hash Function']",False,False
41.964493371579195,Medium,3030,False,False,Find the Grid of Region Average,find-the-grid-of-region-average,"['Array', 'Matrix']",False,False
34.17307746498718,Hard,3031,False,False,Minimum Time to Revert Word to Initial State II,minimum-time-to-revert-word-to-initial-state-ii,"['String', 'Rolling Hash', 'String Matching', 'Hash Function']",False,False
88.00720121866777,Easy,3032,False,True,Count Numbers With Unique Digits II,count-numbers-with-unique-digits-ii,"['Hash Table', 'Math', 'Dynamic Programming']",False,False
68.17414307423876,Easy,3033,False,False,Modify the Matrix,modify-the-matrix,"['Array', 'Matrix']",False,False
66.24337430923649,Medium,3034,False,False,Number of Subarrays That Match a Pattern I,number-of-subarrays-that-match-a-pattern-i,"['Array', 'Rolling Hash', 'String Matching', 'Hash Function']",False,False
42.821953660226306,Medium,3035,False,False,Maximum Palindromes After Operations,maximum-palindromes-after-operations,"['Array', 'Hash Table', 'String', 'Greedy', 'Sorting', 'Counting']",False,False
31.801132983263926,Hard,3036,False,False,Number of Subarrays That Match a Pattern II,number-of-subarrays-that-match-a-pattern-ii,"['Array', 'Rolling Hash', 'String Matching', 'Hash Function']",False,False
68.1735985533454,Hard,3037,False,True,Find Pattern in Infinite Stream II,find-pattern-in-infinite-stream-ii,"['Array', 'Sliding Window', 'Rolling Hash', 'String Matching', 'Hash Function']",False,False
51.684387395328336,Easy,3038,False,False,Maximum Number of Operations With the Same Score I,maximum-number-of-operations-with-the-same-score-i,"['Array', 'Simulation']",False,False
55.881783321067516,Medium,3039,False,False,Apply Operations to Make String Empty,apply-operations-to-make-string-empty,"['Array', 'Hash Table', 'Sorting', 'Counting']",False,False
32.897782204904345,Medium,3040,False,False,Maximum Number of Operations With the Same Score II,maximum-number-of-operations-with-the-same-score-ii,"['Array', 'Dynamic Programming', 'Memoization']",False,False
32.00359329252063,Hard,3041,False,False,Maximize Consecutive Elements in an Array After Modification,maximize-consecutive-elements-in-an-array-after-modification,"['Array', 'Dynamic Programming', 'Sorting']",False,False
77.6267256405268,Easy,3042,False,False,Count Prefix and Suffix Pairs I,count-prefix-and-suffix-pairs-i,"['Array', 'String', 'Trie', 'Rolling Hash', 'String Matching', 'Hash Function']",True,False
56.2696352453576,Medium,3043,False,False,Find the Length of the Longest Common Prefix,find-the-length-of-the-longest-common-prefix,"['Array', 'Hash Table', 'String', 'Trie']",True,False
44.70712123206529,Medium,3044,False,False,Most Frequent Prime,most-frequent-prime,"['Array', 'Hash Table', 'Math', 'Matrix', 'Counting', 'Enumeration', 'Number Theory']",False,False
26.87407529179681,Hard,3045,False,False,Count Prefix and Suffix Pairs II,count-prefix-and-suffix-pairs-ii,"['Array', 'String', 'Trie', 'Rolling Hash', 'String Matching', 'Hash Function']",False,False
58.85997296880527,Easy,3046,False,False,Split the Array,split-the-array,"['Array', 'Hash Table', 'Counting']",False,False
44.81028203608029,Medium,3047,False,False,Find the Largest Area of Square Inside Two Rectangles,find-the-largest-area-of-square-inside-two-rectangles,"['Array', 'Math', 'Geometry']",False,False
34.1227125941873,Medium,3048,False,False,Earliest Second to Mark Indices I,earliest-second-to-mark-indices-i,"['Array', 'Binary Search']",False,False
20.096277713743305,Hard,3049,False,False,Earliest Second to Mark Indices II,earliest-second-to-mark-indices-ii,"['Array', 'Binary Search', 'Greedy', 'Heap (Priority Queue)']",False,False
67.76334776334775,Medium,3050,False,True,Pizza Toppings Cost Analysis,pizza-toppings-cost-analysis,['Database'],False,False
76.05133267522211,Easy,3051,False,True,Find Candidates for Data Scientist Position,find-candidates-for-data-scientist-position,['Database'],False,False
74.78021978021978,Hard,3052,False,True,Maximize Items,maximize-items,['Database'],False,False
50.53110773899848,Easy,3053,False,True,Classifying Triangles by Lengths,classifying-triangles-by-lengths,['Database'],True,False
79.13217242363689,Medium,3054,False,True,Binary Tree Nodes,binary-tree-nodes,['Database'],True,False
58.385416666666664,Medium,3055,False,True,Top Percentile Fraud,top-percentile-fraud,['Database'],False,False
58.566131025957965,Medium,3056,False,True,Snaps Analysis,snaps-analysis,['Database'],False,False
68.63453815261045,Hard,3057,False,True,Employees Project Allocation,employees-project-allocation,['Database'],False,False
48.83502000470699,Medium,3058,False,True,Friends With No Mutual Friends,friends-with-no-mutual-friends,['Database'],False,False
70.19022393450518,Easy,3059,False,True,Find All Unique Email Domains,find-all-unique-email-domains,['Database'],True,False
39.64834076275384,Hard,3060,False,True,User Activities within Time Bounds,user-activities-within-time-bounds,['Database'],True,False
82.05307262569832,Hard,3061,False,True,Calculate Trapping Rain Water,calculate-trapping-rain-water,['Database'],False,False
79.012062910368,Easy,3062,False,True,Winner of the Linked List Game,winner-of-the-linked-list-game,['Linked List'],True,False
85.68278903128015,Easy,3063,False,True,Linked List Frequency,linked-list-frequency,"['Hash Table', 'Linked List', 'Counting']",True,False
90.2377339403136,Medium,3064,False,True,Guess the Number Using Bitwise Questions I,guess-the-number-using-bitwise-questions-i,"['Bit Manipulation', 'Interactive']",False,False
85.86130362863544,Easy,3065,False,False,Minimum Operations to Exceed Threshold Value I,minimum-operations-to-exceed-threshold-value-i,['Array'],False,False
45.691410773469634,Medium,3066,False,False,Minimum Operations to Exceed Threshold Value II,minimum-operations-to-exceed-threshold-value-ii,"['Array', 'Heap (Priority Queue)', 'Simulation']",True,False
53.77972227506183,Medium,3067,False,False,Count Pairs of Connectable Servers in a Weighted Tree Network,count-pairs-of-connectable-servers-in-a-weighted-tree-network,"['Array', 'Tree', 'Depth-First Search']",False,False
65.21216973578862,Hard,3068,False,False,Find the Maximum Sum of Node Values,find-the-maximum-sum-of-node-values,"['Array', 'Dynamic Programming', 'Greedy', 'Bit Manipulation', 'Tree', 'Sorting']",True,False
72.7510819176202,Easy,3069,False,False,Distribute Elements Into Two Arrays I,distribute-elements-into-two-arrays-i,"['Array', 'Simulation']",False,False
56.915291974496505,Medium,3070,False,False,Count Submatrices with Top-Left Element and Sum Less Than k,count-submatrices-with-top-left-element-and-sum-less-than-k,"['Array', 'Matrix', 'Prefix Sum']",False,False
61.15830943638946,Medium,3071,False,False,Minimum Operations to Write the Letter Y on a Grid,minimum-operations-to-write-the-letter-y-on-a-grid,"['Array', 'Hash Table', 'Matrix', 'Counting']",False,False
29.014851136710227,Hard,3072,False,False,Distribute Elements Into Two Arrays II,distribute-elements-into-two-arrays-ii,"['Array', 'Binary Indexed Tree', 'Segment Tree', 'Simulation']",False,False
35.32321899736148,Medium,3073,False,True,Maximum Increasing Triplet Value,maximum-increasing-triplet-value,"['Array', 'Ordered Set']",False,False
67.83858110318258,Easy,3074,False,False,Apple Redistribution into Boxes,apple-redistribution-into-boxes,"['Array', 'Greedy', 'Sorting']",False,False
54.79942846827662,Medium,3075,False,False,Maximize Happiness of Selected Children,maximize-happiness-of-selected-children,"['Array', 'Greedy', 'Sorting']",True,False
47.28805444410246,Medium,3076,False,False,Shortest Uncommon Substring in an Array,shortest-uncommon-substring-in-an-array,"['Array', 'Hash Table', 'String', 'Trie']",False,False
26.5535674511842,Hard,3077,False,False,Maximum Strength of K Disjoint Subarrays,maximum-strength-of-k-disjoint-subarrays,"['Array', 'Dynamic Programming', 'Prefix Sum']",False,False
63.624678663239074,Medium,3078,False,True,Match Alphanumerical Pattern in Matrix I,match-alphanumerical-pattern-in-matrix-i,"['Array', 'Hash Table', 'String', 'Matrix']",False,False
73.31487506056621,Easy,3079,False,False,Find the Sum of Encrypted Integers,find-the-sum-of-encrypted-integers,"['Array', 'Math']",False,False
47.39435781454589,Medium,3080,False,False,Mark Elements on Array by Performing Queries,mark-elements-on-array-by-performing-queries,"['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)', 'Simulation']",False,False
27.57082754013109,Medium,3081,False,False,Replace Question Marks in String to Minimize Its Value,replace-question-marks-in-string-to-minimize-its-value,"['Hash Table', 'String', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Counting']",False,False
36.14926940239741,Hard,3082,False,False,Find the Sum of the Power of All Subsequences,find-the-sum-of-the-power-of-all-subsequences,"['Array', 'Dynamic Programming']",False,False
65.45311887014516,Easy,3083,False,False,Existence of a Substring in a String and Its Reverse,existence-of-a-substring-in-a-string-and-its-reverse,"['Hash Table', 'String']",False,False
48.7003842757238,Medium,3084,False,False,Count Substrings Starting and Ending with Given Character,count-substrings-starting-and-ending-with-given-character,"['Math', 'String', 'Counting']",False,False
44.19788070483527,Medium,3085,False,False,Minimum Deletions to Make String K-Special,minimum-deletions-to-make-string-k-special,"['Hash Table', 'String', 'Greedy', 'Sorting', 'Counting']",False,False
20.609986814194805,Hard,3086,False,False,Minimum Moves to Pick K Ones,minimum-moves-to-pick-k-ones,"['Array', 'Greedy', 'Sliding Window', 'Prefix Sum']",False,False
61.45695364238411,Medium,3087,False,True,Find Trending Hashtags,find-trending-hashtags,['Database'],False,False
42.18009478672986,Hard,3088,False,True,Make String Anti-palindrome,make-string-anti-palindrome,"['String', 'Greedy', 'Sorting', 'Counting Sort']",False,False
39.65825044631471,Medium,3089,False,True,Find Bursty Behavior,find-bursty-behavior,['Database'],False,False
63.07423869989939,Easy,3090,False,False,Maximum Length Substring With Two Occurrences,maximum-length-substring-with-two-occurrences,"['Hash Table', 'String', 'Sliding Window']",False,False
43.18688524590164,Medium,3091,False,False,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,"['Math', 'Greedy', 'Enumeration']",False,False
41.34568134568134,Medium,3092,False,False,Most Frequent IDs,most-frequent-ids,"['Array', 'Hash Table', 'Heap (Priority Queue)', 'Ordered Set']",False,False
36.7170626349892,Hard,3093,False,False,Longest Common Suffix Queries,longest-common-suffix-queries,"['Array', 'String', 'Trie']",False,False
83.10740354535974,Medium,3094,False,True,Guess the Number Using Bitwise Questions II,guess-the-number-using-bitwise-questions-ii,"['Bit Manipulation', 'Interactive']",False,False
42.43942026045167,Easy,3095,False,False,Shortest Subarray With OR at Least K I,shortest-subarray-with-or-at-least-k-i,"['Array', 'Bit Manipulation', 'Sliding Window']",False,False
38.847393788502664,Medium,3096,False,False,Minimum Levels to Gain More Points,minimum-levels-to-gain-more-points,"['Array', 'Prefix Sum']",False,False
50.2559691158575,Medium,3097,False,False,Shortest Subarray With OR at Least K II,shortest-subarray-with-or-at-least-k-ii,"['Array', 'Bit Manipulation', 'Sliding Window']",True,False
23.10309904800486,Hard,3098,False,False,Find the Sum of Subsequence Powers,find-the-sum-of-subsequence-powers,"['Array', 'Dynamic Programming', 'Sorting']",False,False
83.04739202709908,Easy,3099,False,False,Harshad Number,harshad-number,['Math'],False,False
62.04803334546296,Medium,3100,False,False,Water Bottles II,water-bottles-ii,"['Math', 'Simulation']",False,False
56.81497886047916,Medium,3101,False,False,Count Alternating Subarrays,count-alternating-subarrays,"['Array', 'Math']",False,False
31.227466675487054,Hard,3102,False,False,Minimize Manhattan Distances,minimize-manhattan-distances,"['Array', 'Math', 'Geometry', 'Sorting', 'Ordered Set']",False,False
65.66890653634697,Hard,3103,False,True,Find Trending Hashtags II ,find-trending-hashtags-ii,['Database'],False,False
58.86994146093153,Hard,3104,False,True,Find Longest Self-Contained Substring,find-longest-self-contained-substring,"['Hash Table', 'String', 'Binary Search', 'Prefix Sum']",False,False
65.09342404359252,Easy,3105,False,False,Longest Strictly Increasing or Strictly Decreasing Subarray,longest-strictly-increasing-or-strictly-decreasing-subarray,['Array'],True,False
62.05911915204678,Medium,3106,False,False,Lexicographically Smallest String After Operations With Constraint,lexicographically-smallest-string-after-operations-with-constraint,"['String', 'Greedy']",False,False
46.47530244508346,Medium,3107,False,False,Minimum Operations to Make Median of Array Equal to K,minimum-operations-to-make-median-of-array-equal-to-k,"['Array', 'Greedy', 'Sorting']",False,False
68.6178538085562,Hard,3108,False,False,Minimum Cost Walk in Weighted Graph,minimum-cost-walk-in-weighted-graph,"['Array', 'Bit Manipulation', 'Union Find', 'Graph']",True,False
36.68069753457607,Medium,3109,False,True,Find the Index of Permutation,find-the-index-of-permutation,"['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']",False,False
91.96905180866925,Easy,3110,False,False,Score of a String,score-of-a-string,['String'],True,False
61.999278238902924,Medium,3111,False,False,Minimum Rectangles to Cover Points,minimum-rectangles-to-cover-points,"['Array', 'Greedy', 'Sorting']",False,False
35.17715793441387,Medium,3112,False,False,Minimum Time to Visit Disappearing Nodes,minimum-time-to-visit-disappearing-nodes,"['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path']",False,False
29.580414156821178,Hard,3113,False,False,Find the Number of Subarrays Where Boundary Elements Are Maximum,find-the-number-of-subarrays-where-boundary-elements-are-maximum,"['Array', 'Binary Search', 'Stack', 'Monotonic Stack']",False,False
35.418777520003786,Easy,3114,False,False,Latest Time You Can Obtain After Replacing Characters,latest-time-you-can-obtain-after-replacing-characters,"['String', 'Enumeration']",False,False
57.17779993353274,Medium,3115,False,False,Maximum Prime Difference,maximum-prime-difference,"['Array', 'Math', 'Number Theory']",False,False
18.176392932708826,Hard,3116,False,False,Kth Smallest Amount With Single Denomination Combination,kth-smallest-amount-with-single-denomination-combination,"['Array', 'Math', 'Binary Search', 'Bit Manipulation', 'Combinatorics', 'Number Theory']",False,False
26.910946196660486,Hard,3117,False,False,Minimum Sum of Values by Dividing Array,minimum-sum-of-values-by-dividing-array,"['Array', 'Binary Search', 'Dynamic Programming', 'Bit Manipulation', 'Segment Tree', 'Queue']",False,False
57.22201699298116,Medium,3118,False,True,Friday Purchase III ,friday-purchase-iii,['Database'],False,False
54.01382243487507,Medium,3119,False,True,Maximum Number of Potholes That Can Be Fixed,maximum-number-of-potholes-that-can-be-fixed,"['String', 'Greedy', 'Sorting']",False,False
65.06495370702649,Easy,3120,False,False,Count the Number of Special Characters I,count-the-number-of-special-characters-i,"['Hash Table', 'String']",False,False
41.75434028805075,Medium,3121,False,False,Count the Number of Special Characters II,count-the-number-of-special-characters-ii,"['Hash Table', 'String']",False,False
40.08956913309875,Medium,3122,False,False,Minimum Number of Operations to Satisfy Conditions,minimum-number-of-operations-to-satisfy-conditions,"['Array', 'Dynamic Programming', 'Matrix']",False,False
45.2859730451601,Hard,3123,False,False,Find Edges in Shortest Paths,find-edges-in-shortest-paths,"['Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Shortest Path']",False,False
62.27524204702628,Medium,3124,False,True,Find Longest Calls,find-longest-calls,['Database'],False,False
68.0,Medium,3125,False,True,Maximum Number That Makes Result of Bitwise AND Zero,maximum-number-that-makes-result-of-bitwise-and-zero,"['String', 'Greedy', 'Sorting']",False,False
61.627906976744185,Medium,3126,False,True,Server Utilization Time,server-utilization-time,['Database'],False,False
51.60558734085872,Easy,3127,False,False,Make a Square with the Same Color,make-a-square-with-the-same-color,"['Array', 'Matrix', 'Enumeration']",False,False
46.577771791590905,Medium,3128,False,False,Right Triangles,right-triangles,"['Array', 'Hash Table', 'Math', 'Combinatorics', 'Counting']",False,False
25.96170891685871,Medium,3129,False,False,Find All Possible Stable Binary Arrays I,find-all-possible-stable-binary-arrays-i,"['Dynamic Programming', 'Prefix Sum']",False,False
25.450196961170512,Hard,3130,False,False,Find All Possible Stable Binary Arrays II,find-all-possible-stable-binary-arrays-ii,"['Dynamic Programming', 'Prefix Sum']",False,False
81.88176975965492,Easy,3131,False,False,Find the Integer Added to Array I,find-the-integer-added-to-array-i,['Array'],False,False
31.577103433406993,Medium,3132,False,False,Find the Integer Added to Array II,find-the-integer-added-to-array-ii,"['Array', 'Two Pointers', 'Sorting', 'Enumeration']",False,False
55.54820405873199,Medium,3133,False,False,Minimum Array End,minimum-array-end,['Bit Manipulation'],True,False
27.686610797115573,Hard,3134,False,False,Find the Median of the Uniqueness Array,find-the-median-of-the-uniqueness-array,"['Array', 'Hash Table', 'Binary Search', 'Sliding Window']",False,False
55.02318392581144,Medium,3135,False,True,Equalize Strings by Adding or Removing Characters at Ends,equalize-strings-by-adding-or-removing-characters-at-ends,"['String', 'Binary Search', 'Dynamic Programming', 'Sliding Window', 'Hash Function']",False,False
38.43115551983989,Easy,3136,False,False,Valid Word,valid-word,['String'],False,False
59.50271309842709,Medium,3137,False,False,Minimum Number of Operations to Make Word K-Periodic,minimum-number-of-operations-to-make-word-k-periodic,"['Hash Table', 'String', 'Counting']",False,False
40.53205419416905,Medium,3138,False,False,Minimum Length of Anagram Concatenation,minimum-length-of-anagram-concatenation,"['Hash Table', 'String', 'Counting']",False,False
17.618922814834228,Hard,3139,False,False,Minimum Cost to Equalize Array,minimum-cost-to-equalize-array,"['Array', 'Greedy', 'Enumeration']",False,False
57.57970071567989,Medium,3140,False,True,Consecutive Available Seats II,consecutive-available-seats-ii,['Database'],False,False
46.70874661857529,Hard,3141,False,True,Maximum Hamming Distances,maximum-hamming-distances,"['Array', 'Bit Manipulation', 'Breadth-First Search']",False,False
43.27313614355538,Easy,3142,False,False,Check if Grid Satisfies Conditions,check-if-grid-satisfies-conditions,"['Array', 'Matrix']",False,False
37.87582741845442,Medium,3143,False,False,Maximum Points Inside the Square,maximum-points-inside-the-square,"['Array', 'Hash Table', 'String', 'Binary Search', 'Sorting']",False,False
38.72058934075021,Medium,3144,False,False,Minimum Substring Partition of Equal Character Frequency,minimum-substring-partition-of-equal-character-frequency,"['Hash Table', 'String', 'Dynamic Programming', 'Counting']",False,False
21.462411727898452,Hard,3145,False,False,Find Products of Elements of Big Array,find-products-of-elements-of-big-array,"['Array', 'Binary Search', 'Bit Manipulation']",False,False
87.0488156257044,Easy,3146,False,False,Permutation Difference between Two Strings,permutation-difference-between-two-strings,"['Hash Table', 'String']",False,False
40.86480216522747,Medium,3147,False,False,Taking Maximum Energy From the Mystic Dungeon,taking-maximum-energy-from-the-mystic-dungeon,"['Array', 'Prefix Sum']",False,False
46.48086041401642,Medium,3148,False,False,Maximum Difference Score in a Grid,maximum-difference-score-in-a-grid,"['Array', 'Dynamic Programming', 'Matrix']",False,False
22.834679314617784,Hard,3149,False,False,Find the Minimum Cost Array Permutation,find-the-minimum-cost-array-permutation,"['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']",False,False
86.7598137059215,Easy,3150,False,True,Invalid Tweets II,invalid-tweets-ii,['Database'],False,False
81.83246951006552,Easy,3151,False,False,Special Array I,special-array-i,['Array'],True,False
45.67534666542519,Medium,3152,False,False,Special Array II,special-array-ii,"['Array', 'Binary Search', 'Prefix Sum']",True,False
42.323340819581425,Medium,3153,False,False,Sum of Digit Differences of All Pairs,sum-of-digit-differences-of-all-pairs,"['Array', 'Hash Table', 'Math', 'Counting']",False,False
35.81294181620446,Hard,3154,False,False,Find Number of Ways to Reach the K-th Stair,find-number-of-ways-to-reach-the-k-th-stair,"['Math', 'Dynamic Programming', 'Bit Manipulation', 'Memoization', 'Combinatorics']",False,False
40.17777777777778,Medium,3155,False,True,Maximum Number of Upgradable Servers,maximum-number-of-upgradable-servers,"['Array', 'Math', 'Binary Search']",False,False
45.62890276538805,Hard,3156,False,True,Employee Task Duration and Concurrent Tasks,employee-task-duration-and-concurrent-tasks,['Database'],False,False
68.56971153846155,Medium,3157,False,True,Find the Level of Tree with Minimum Sum,find-the-level-of-tree-with-minimum-sum,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']",False,False
79.51051779935275,Easy,3158,False,False,Find the XOR of Numbers Which Appear Twice,find-the-xor-of-numbers-which-appear-twice,"['Array', 'Hash Table', 'Bit Manipulation']",False,False
72.31376643717167,Medium,3159,False,False,Find Occurrences of an Element in an Array,find-occurrences-of-an-element-in-an-array,"['Array', 'Hash Table']",False,False
54.213314292356486,Medium,3160,False,False,Find the Number of Distinct Colors Among the Balls,find-the-number-of-distinct-colors-among-the-balls,"['Array', 'Hash Table', 'Simulation']",True,False
16.062246278755072,Hard,3161,False,False,Block Placement Queries,block-placement-queries,"['Array', 'Binary Search', 'Binary Indexed Tree', 'Segment Tree']",False,False
85.46820458339657,Easy,3162,False,False,Find the Number of Good Pairs I,find-the-number-of-good-pairs-i,"['Array', 'Hash Table']",False,False
68.01687431286952,Medium,3163,False,False,String Compression III,string-compression-iii,['String'],True,False
25.938913597141443,Medium,3164,False,False,Find the Number of Good Pairs II,find-the-number-of-good-pairs-ii,"['Array', 'Hash Table']",False,False
15.938947169454684,Hard,3165,False,False,Maximum Sum of Subsequence With Non-adjacent Elements,maximum-sum-of-subsequence-with-non-adjacent-elements,"['Array', 'Divide and Conquer', 'Dynamic Programming', 'Segment Tree']",False,False
52.758402029169304,Medium,3166,False,True,Calculate Parking Fees and Duration,calculate-parking-fees-and-duration,['Database'],False,False
75.49472295514512,Medium,3167,False,True,Better Compression of String,better-compression-of-string,"['Hash Table', 'String', 'Sorting', 'Counting']",False,False
78.67651766393075,Easy,3168,False,False,Minimum Number of Chairs in a Waiting Room,minimum-number-of-chairs-in-a-waiting-room,"['String', 'Simulation']",False,False
47.82224294336211,Medium,3169,False,False,Count Days Without Meetings,count-days-without-meetings,"['Array', 'Sorting']",True,False
35.193635764659945,Medium,3170,False,False,Lexicographically Minimum String After Removing Stars,lexicographically-minimum-string-after-removing-stars,"['Hash Table', 'String', 'Stack', 'Greedy', 'Heap (Priority Queue)']",False,False
29.453312923682486,Hard,3171,False,False,Find Subarray With Bitwise OR Closest to K,find-subarray-with-bitwise-or-closest-to-k,"['Array', 'Binary Search', 'Bit Manipulation', 'Segment Tree']",False,False
68.1138990696363,Easy,3172,False,True,Second Day Verification,second-day-verification,['Database'],False,False
95.26714345814051,Easy,3173,False,True,Bitwise OR of Adjacent Elements,bitwise-or-of-adjacent-elements,"['Array', 'Bit Manipulation']",False,False
82.56883272290874,Easy,3174,False,False,Clear Digits,clear-digits,"['String', 'Stack', 'Simulation']",True,False
39.29057210782169,Medium,3175,False,False,Find The First Player to win K Games in a Row,find-the-first-player-to-win-k-games-in-a-row,"['Array', 'Simulation']",False,False
31.210590756045303,Medium,3176,False,False,Find the Maximum Length of a Good Subsequence I,find-the-maximum-length-of-a-good-subsequence-i,"['Array', 'Hash Table', 'Dynamic Programming']",False,False
23.636907432331387,Hard,3177,False,False,Find the Maximum Length of a Good Subsequence II,find-the-maximum-length-of-a-good-subsequence-ii,"['Array', 'Hash Table', 'Dynamic Programming']",False,False
61.47440352096363,Easy,3178,False,False,Find the Child Who Has the Ball After K Seconds,find-the-child-who-has-the-ball-after-k-seconds,"['Math', 'Simulation']",False,False
53.574124690875955,Medium,3179,False,False,Find the N-th Value After K Seconds,find-the-n-th-value-after-k-seconds,"['Array', 'Math', 'Simulation', 'Combinatorics', 'Prefix Sum']",False,False
29.722341799397334,Medium,3180,False,False,Maximum Total Reward Using Operations I,maximum-total-reward-using-operations-i,"['Array', 'Dynamic Programming']",False,False
20.455908818236352,Hard,3181,False,False,Maximum Total Reward Using Operations II,maximum-total-reward-using-operations-ii,"['Array', 'Dynamic Programming', 'Bit Manipulation']",False,False
49.906191369606,Medium,3182,False,True,Find Top Scoring Students,find-top-scoring-students,['Database'],False,False
52.45424292845258,Medium,3183,False,True,The Number of Ways to Make the Sum,the-number-of-ways-to-make-the-sum,"['Array', 'Dynamic Programming']",False,False
77.39040586978732,Easy,3184,False,False,Count Pairs That Form a Complete Day I,count-pairs-that-form-a-complete-day-i,"['Array', 'Hash Table', 'Counting']",False,False
42.857282244923844,Medium,3185,False,False,Count Pairs That Form a Complete Day II,count-pairs-that-form-a-complete-day-ii,"['Array', 'Hash Table', 'Counting']",False,False
27.426314775573108,Medium,3186,False,False,Maximum Total Damage With Spell Casting,maximum-total-damage-with-spell-casting,"['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Dynamic Programming', 'Sorting', 'Counting']",False,False
25.91112943966184,Hard,3187,False,False,Peaks in Array,peaks-in-array,"['Array', 'Binary Indexed Tree', 'Segment Tree']",False,False
38.24120603015076,Hard,3188,False,True,Find Top Scoring Students II,find-top-scoring-students-ii,['Database'],False,False
76.0710018774535,Medium,3189,False,True,Minimum Moves to Get a Peaceful Board,minimum-moves-to-get-a-peaceful-board,"['Array', 'Greedy', 'Sorting', 'Counting Sort']",True,False
88.65297261933969,Easy,3190,False,False,Find Minimum Operations to Make All Elements Divisible by Three,find-minimum-operations-to-make-all-elements-divisible-by-three,"['Array', 'Math']",False,False
80.51665780388781,Medium,3191,False,False,Minimum Operations to Make Binary Array Elements Equal to One I,minimum-operations-to-make-binary-array-elements-equal-to-one-i,"['Array', 'Bit Manipulation', 'Queue', 'Sliding Window', 'Prefix Sum']",True,False
63.7548191889122,Medium,3192,False,False,Minimum Operations to Make Binary Array Elements Equal to One II,minimum-operations-to-make-binary-array-elements-equal-to-one-ii,"['Array', 'Dynamic Programming', 'Greedy']",False,False
32.45766668081314,Hard,3193,False,False,Count the Number of Inversions,count-the-number-of-inversions,"['Array', 'Dynamic Programming']",False,False
84.6535681442881,Easy,3194,False,False,Minimum Average of Smallest and Largest Elements,minimum-average-of-smallest-and-largest-elements,"['Array', 'Two Pointers', 'Sorting']",False,False
71.09088506392679,Medium,3195,False,False,Find the Minimum Area to Cover All Ones I,find-the-minimum-area-to-cover-all-ones-i,"['Array', 'Matrix']",False,False
28.470669189747117,Medium,3196,False,False,Maximize Total Cost of Alternating Subarrays,maximize-total-cost-of-alternating-subarrays,"['Array', 'Dynamic Programming']",False,False
35.68166089965398,Hard,3197,False,False,Find the Minimum Area to Cover All Ones II,find-the-minimum-area-to-cover-all-ones-ii,"['Array', 'Matrix', 'Enumeration']",False,False
82.9616724738676,Easy,3198,False,True,Find Cities in Each State,find-cities-in-each-state,['Database'],False,False
82.99319727891157,Easy,3199,False,True,Count Triplets with Even XOR Set Bits I,count-triplets-with-even-xor-set-bits-i,"['Array', 'Bit Manipulation']",False,False
43.027709904930596,Easy,3200,False,False,Maximum Height of a Triangle,maximum-height-of-a-triangle,"['Array', 'Enumeration']",False,False
37.49502560157058,Medium,3201,False,False,Find the Maximum Length of Valid Subsequence I,find-the-maximum-length-of-valid-subsequence-i,"['Array', 'Dynamic Programming']",False,False
39.322702613841855,Medium,3202,False,False,Find the Maximum Length of Valid Subsequence II,find-the-maximum-length-of-valid-subsequence-ii,"['Array', 'Dynamic Programming']",False,False
57.56774153034632,Hard,3203,False,False,Find Minimum Diameter After Merging Two Trees,find-minimum-diameter-after-merging-two-trees,"['Tree', 'Depth-First Search', 'Breadth-First Search', 'Graph']",True,False
93.52678571428571,Medium,3204,False,True,Bitwise User Permissions Analysis,bitwise-user-permissions-analysis,['Database'],False,False
77.0956816257409,Medium,3205,False,True,Maximum Array Hopping Score I,maximum-array-hopping-score-i,"['Array', 'Dynamic Programming', 'Stack', 'Greedy', 'Monotonic Stack']",False,False
67.35904719081408,Easy,3206,False,False,Alternating Groups I,alternating-groups-i,"['Array', 'Sliding Window']",False,False
32.343944451552126,Medium,3207,False,False,Maximum Points After Enemy Battles,maximum-points-after-enemy-battles,"['Array', 'Greedy']",False,False
59.826259239503166,Medium,3208,False,False,Alternating Groups II,alternating-groups-ii,"['Array', 'Sliding Window']",True,False
33.56371847119727,Hard,3209,False,False,Number of Subarrays With AND Value of K,number-of-subarrays-with-and-value-of-k,"['Array', 'Binary Search', 'Bit Manipulation', 'Segment Tree']",False,False
67.8229517741773,Easy,3210,False,False,Find the Encrypted String,find-the-encrypted-string,['String'],False,False
86.8645945432677,Medium,3211,False,False,Generate Binary Strings Without Adjacent Zeros,generate-binary-strings-without-adjacent-zeros,"['String', 'Backtracking', 'Bit Manipulation']",False,False
50.33301028929624,Medium,3212,False,False,Count Submatrices With Equal Frequency of X and Y,count-submatrices-with-equal-frequency-of-x-and-y,"['Array', 'Matrix', 'Prefix Sum']",False,False
19.243844973988395,Hard,3213,False,False,Construct String with Minimum Cost,construct-string-with-minimum-cost,"['Array', 'String', 'Dynamic Programming', 'Suffix Array']",False,False
52.73889227023737,Hard,3214,False,True,Year on Year Growth Rate,year-on-year-growth-rate,['Database'],False,False
59.03041825095057,Medium,3215,False,True,Count Triplets with Even XOR Set Bits II,count-triplets-with-even-xor-set-bits-ii,"['Array', 'Bit Manipulation']",False,False
53.46525086161543,Easy,3216,False,False,Lexicographically Smallest String After a Swap,lexicographically-smallest-string-after-a-swap,"['String', 'Greedy']",False,False
67.94668177206385,Medium,3217,False,False,Delete Nodes From Linked List Present in Array,delete-nodes-from-linked-list-present-in-array,"['Array', 'Hash Table', 'Linked List']",True,False
57.44324335369966,Medium,3218,False,False,Minimum Cost for Cutting Cake I,minimum-cost-for-cutting-cake-i,"['Array', 'Dynamic Programming', 'Greedy', 'Sorting']",False,False
54.50951321966889,Hard,3219,False,False,Minimum Cost for Cutting Cake II,minimum-cost-for-cutting-cake-ii,"['Array', 'Greedy', 'Sorting']",False,False
69.90703975335171,Medium,3220,False,False,Odd and Even Transactions,odd-and-even-transactions,['Database'],False,False
56.53409090909091,Medium,3221,False,True,Maximum Array Hopping Score II,maximum-array-hopping-score-ii,"['Array', 'Stack', 'Greedy', 'Monotonic Stack']",False,False
52.359501370999325,Easy,3222,False,False,Find the Winning Player in Coin Game,find-the-winning-player-in-coin-game,"['Math', 'Simulation', 'Game Theory']",False,False
74.92485804289814,Medium,3223,False,False,Minimum Length of String After Operations,minimum-length-of-string-after-operations,"['Hash Table', 'String', 'Counting']",True,False
23.053957498196944,Medium,3224,False,False,Minimum Array Changes to Make Differences Equal,minimum-array-changes-to-make-differences-equal,"['Array', 'Hash Table', 'Prefix Sum']",False,False
23.274818401937043,Hard,3225,False,False,Maximum Score From Grid Operations,maximum-score-from-grid-operations,"['Array', 'Dynamic Programming', 'Matrix', 'Prefix Sum']",False,False
63.71951642677697,Easy,3226,False,False,Number of Bit Changes to Make Two Integers Equal,number-of-bit-changes-to-make-two-integers-equal,['Bit Manipulation'],False,False
61.848023591790536,Medium,3227,False,False,Vowels Game in a String,vowels-game-in-a-string,"['Math', 'String', 'Brainteaser', 'Game Theory']",False,False
52.98482353149516,Medium,3228,False,False,Maximum Number of Operations to Move Ones to the End,maximum-number-of-operations-to-move-ones-to-the-end,"['String', 'Greedy', 'Counting']",False,False
38.54194231278116,Hard,3229,False,False,Minimum Operations to Make Array Equal to Target,minimum-operations-to-make-array-equal-to-target,"['Array', 'Dynamic Programming', 'Stack', 'Greedy', 'Monotonic Stack']",False,False
37.49023691746941,Medium,3230,False,True,Customer Purchasing Behavior Analysis,customer-purchasing-behavior-analysis,['Database'],False,False
42.45577523413112,Hard,3231,False,True,Minimum Number of Increasing Subsequence to Be Removed,minimum-number-of-increasing-subsequence-to-be-removed,"['Array', 'Binary Search']",False,False
81.0952546461941,Easy,3232,False,False,Find if Digit Game Can Be Won,find-if-digit-game-can-be-won,"['Array', 'Math']",False,False
26.792397389502337,Medium,3233,False,False,Find the Count of Numbers Which Are Not Special,find-the-count-of-numbers-which-are-not-special,"['Array', 'Math', 'Number Theory']",False,False
16.6121929738722,Medium,3234,False,False,Count the Number of Substrings With Dominant Ones,count-the-number-of-substrings-with-dominant-ones,"['String', 'Sliding Window', 'Enumeration']",False,False
26.580208836535245,Hard,3235,False,False,Check if the Rectangle Corner Is Reachable,check-if-the-rectangle-corner-is-reachable,"['Array', 'Math', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Geometry']",False,False
71.79093005380477,Hard,3236,False,True,CEO Subordinate Hierarchy,ceo-subordinate-hierarchy,['Database'],False,False
47.989556135770236,Medium,3237,False,True,Alt and Tab Simulation,alt-and-tab-simulation,"['Array', 'Hash Table', 'Simulation']",False,False
59.56684238417984,Easy,3238,False,False,Find the Number of Winning Players,find-the-number-of-winning-players,"['Array', 'Hash Table', 'Counting']",False,False
74.15228468974773,Medium,3239,False,False,Minimum Number of Flips to Make Binary Grid Palindromic I,minimum-number-of-flips-to-make-binary-grid-palindromic-i,"['Array', 'Two Pointers', 'Matrix']",False,False
23.85997942161606,Medium,3240,False,False,Minimum Number of Flips to Make Binary Grid Palindromic II,minimum-number-of-flips-to-make-binary-grid-palindromic-ii,"['Array', 'Two Pointers', 'Matrix']",False,False
23.793354353626,Hard,3241,False,False,Time Taken to Mark All Nodes,time-taken-to-mark-all-nodes,"['Dynamic Programming', 'Tree', 'Depth-First Search', 'Graph']",False,False
82.6049257829435,Easy,3242,False,False,Design Neighbor Sum Service,design-neighbor-sum-service,"['Array', 'Hash Table', 'Design', 'Matrix', 'Simulation']",False,False
62.079410653143874,Medium,3243,False,False,Shortest Distance After Road Addition Queries I,shortest-distance-after-road-addition-queries-i,"['Array', 'Breadth-First Search', 'Graph']",True,False
25.028767614268737,Hard,3244,False,False,Shortest Distance After Road Addition Queries II,shortest-distance-after-road-addition-queries-ii,"['Array', 'Greedy', 'Graph', 'Ordered Set']",False,False
14.471370690314197,Hard,3245,False,False,Alternating Groups III,alternating-groups-iii,"['Array', 'Binary Indexed Tree']",False,False
82.02163371876165,Easy,3246,False,True,Premier League Table Ranking,premier-league-table-ranking,['Database'],False,False
47.120098039215684,Medium,3247,False,True,Number of Subsequences with Odd Sum,number-of-subsequences-with-odd-sum,"['Array', 'Math', 'Dynamic Programming', 'Combinatorics']",False,False
81.41498924898318,Easy,3248,False,False,Snake in Matrix,snake-in-matrix,"['Array', 'String', 'Simulation']",False,False
54.45970288016425,Medium,3249,False,False,Count the Number of Good Nodes,count-the-number-of-good-nodes,"['Tree', 'Depth-First Search']",False,False
45.40623837610925,Hard,3250,False,False,Find the Count of Monotonic Pairs I,find-the-count-of-monotonic-pairs-i,"['Array', 'Math', 'Dynamic Programming', 'Combinatorics', 'Prefix Sum']",False,False
22.62632334769395,Hard,3251,False,False,Find the Count of Monotonic Pairs II,find-the-count-of-monotonic-pairs-ii,"['Array', 'Math', 'Dynamic Programming', 'Combinatorics', 'Prefix Sum']",False,False
60.16385048643114,Medium,3252,False,True,Premier League Table Ranking II,premier-league-table-ranking-ii,['Database'],False,False
58.333333333333336,Medium,3253,False,True,Construct String with Minimum Cost (Easy),construct-string-with-minimum-cost-easy,[],False,False
62.54670681449692,Medium,3254,False,False,Find the Power of K-Size Subarrays I,find-the-power-of-k-size-subarrays-i,"['Array', 'Sliding Window']",True,False
29.00245372754536,Medium,3255,False,False,Find the Power of K-Size Subarrays II,find-the-power-of-k-size-subarrays-ii,"['Array', 'Sliding Window']",False,False
14.943765807458428,Hard,3256,False,False,Maximum Value Sum by Placing Three Rooks I,maximum-value-sum-by-placing-three-rooks-i,"['Array', 'Dynamic Programming', 'Matrix', 'Enumeration']",False,False
26.253926985158703,Hard,3257,False,False,Maximum Value Sum by Placing Three Rooks II,maximum-value-sum-by-placing-three-rooks-ii,"['Array', 'Dynamic Programming', 'Matrix', 'Enumeration']",False,False
77.61819269898265,Easy,3258,False,False,Count Substrings That Satisfy K-Constraint I,count-substrings-that-satisfy-k-constraint-i,"['String', 'Sliding Window']",False,False
49.164833497686416,Medium,3259,False,False,Maximum Energy Boost From Two Drinks,maximum-energy-boost-from-two-drinks,"['Array', 'Dynamic Programming']",False,False
15.196881870877474,Hard,3260,False,False,Find the Largest Palindrome Divisible by K,find-the-largest-palindrome-divisible-by-k,"['Math', 'String', 'Dynamic Programming', 'Greedy', 'Number Theory']",False,False
21.209577663898216,Hard,3261,False,False,Count Substrings That Satisfy K-Constraint II,count-substrings-that-satisfy-k-constraint-ii,"['Array', 'String', 'Binary Search', 'Sliding Window', 'Prefix Sum']",False,False
61.99074074074075,Medium,3262,False,True,Find Overlapping Shifts,find-overlapping-shifts,['Database'],False,False
94.7587957925281,Easy,3263,False,True,Convert Doubly Linked List to Array I,convert-doubly-linked-list-to-array-i,"['Array', 'Linked List', 'Doubly-Linked List']",False,False
87.1719835038005,Easy,3264,False,False,Final Array State After K Multiplication Operations I,final-array-state-after-k-multiplication-operations-i,"['Array', 'Math', 'Heap (Priority Queue)', 'Simulation']",True,False
37.36464846728687,Medium,3265,False,False,Count Almost Equal Pairs I,count-almost-equal-pairs-i,"['Array', 'Hash Table', 'Sorting', 'Counting', 'Enumeration']",False,False
11.630571503294021,Hard,3266,False,False,Final Array State After K Multiplication Operations II,final-array-state-after-k-multiplication-operations-ii,"['Array', 'Heap (Priority Queue)', 'Simulation']",False,False
20.95127036291035,Hard,3267,False,False,Count Almost Equal Pairs II,count-almost-equal-pairs-ii,"['Array', 'Hash Table', 'Sorting', 'Counting', 'Enumeration']",False,False
59.79216626698641,Hard,3268,False,True,Find Overlapping Shifts II,find-overlapping-shifts-ii,['Database'],False,False
63.72881355932203,Hard,3269,False,True,Constructing Two Increasing Arrays,constructing-two-increasing-arrays,"['Array', 'Dynamic Programming']",False,False
75.93301355439306,Easy,3270,False,False,Find the Key of the Numbers,find-the-key-of-the-numbers,['Math'],False,False
82.91904307710276,Medium,3271,False,False,Hash Divided String,hash-divided-string,"['String', 'Simulation']",False,False
30.93181294632573,Hard,3272,False,False,Find the Count of Good Integers,find-the-count-of-good-integers,"['Hash Table', 'Math', 'Combinatorics', 'Enumeration']",True,False
37.62745279240982,Hard,3273,False,False,Minimum Amount of Damage Dealt to Bob,minimum-amount-of-damage-dealt-to-bob,"['Array', 'Greedy', 'Sorting']",False,False
70.80954656338807,Easy,3274,False,False,Check if Two Chessboard Squares Have the Same Color,check-if-two-chessboard-squares-have-the-same-color,"['Math', 'String']",False,False
47.88670897129883,Medium,3275,False,False,K-th Nearest Obstacle Queries,k-th-nearest-obstacle-queries,"['Array', 'Heap (Priority Queue)']",False,False
14.269561588886944,Hard,3276,False,False,Select Cells in Grid With Maximum Score,select-cells-in-grid-with-maximum-score,"['Array', 'Dynamic Programming', 'Bit Manipulation', 'Matrix', 'Bitmask']",False,False
41.69787765293383,Hard,3277,False,False,Maximum XOR Score Subarray Queries,maximum-xor-score-subarray-queries,"['Array', 'Dynamic Programming']",False,False
43.79774463441251,Medium,3278,False,True,Find Candidates for Data Scientist Position II,find-candidates-for-data-scientist-position-ii,['Database'],False,False
54.75409836065573,Hard,3279,False,True,Maximum Total Area Occupied by Pistons,maximum-total-area-occupied-by-pistons,"['Array', 'Hash Table', 'String', 'Simulation', 'Counting', 'Prefix Sum']",False,False
88.77828432807729,Easy,3280,False,False,Convert Date to Binary,convert-date-to-binary,"['Math', 'String']",False,False
34.308084605577164,Medium,3281,False,False,Maximize Score of Numbers in Ranges,maximize-score-of-numbers-in-ranges,"['Array', 'Binary Search', 'Greedy', 'Sorting']",False,False
32.4506879871676,Medium,3282,False,False,Reach End of Array With Max Score,reach-end-of-array-with-max-score,"['Array', 'Greedy']",False,False
31.889477511166508,Hard,3283,False,False,Maximum Number of Moves to Kill All Pawns,maximum-number-of-moves-to-kill-all-pawns,"['Array', 'Math', 'Bit Manipulation', 'Breadth-First Search', 'Game Theory', 'Bitmask']",False,False
41.284403669724774,Medium,3284,False,True,Sum of Consecutive Subarrays,sum-of-consecutive-subarrays,"['Array', 'Two Pointers', 'Dynamic Programming']",False,False
85.83588417279141,Easy,3285,False,False,Find Indices of Stable Mountains,find-indices-of-stable-mountains,['Array'],False,False
29.881199440938545,Medium,3286,False,False,Find a Safe Walk Through a Grid,find-a-safe-walk-through-a-grid,"['Array', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']",False,False
18.206195469462898,Hard,3287,False,False,Find the Maximum Sequence Value of Array,find-the-maximum-sequence-value-of-array,"['Array', 'Dynamic Programming', 'Bit Manipulation']",False,False
16.77567742399195,Hard,3288,False,False,Length of the Longest Increasing Path,length-of-the-longest-increasing-path,"['Array', 'Binary Search', 'Sorting']",False,False
88.1796201773057,Easy,3289,False,False,The Two Sneaky Numbers of Digitville,the-two-sneaky-numbers-of-digitville,"['Array', 'Hash Table', 'Math']",False,False
40.89663487887756,Medium,3290,False,False,Maximum Multiplication Score,maximum-multiplication-score,"['Array', 'Dynamic Programming']",False,False
19.723302080951292,Medium,3291,False,False,Minimum Number of Valid Strings to Form Target I,minimum-number-of-valid-strings-to-form-target-i,"['Array', 'String', 'Binary Search', 'Dynamic Programming', 'Trie', 'Segment Tree', 'Rolling Hash', 'String Matching', 'Hash Function']",False,False
17.813319793517813,Hard,3292,False,False,Minimum Number of Valid Strings to Form Target II,minimum-number-of-valid-strings-to-form-target-ii,"['Array', 'String', 'Binary Search', 'Dynamic Programming', 'Segment Tree', 'Rolling Hash', 'String Matching', 'Hash Function']",False,False
80.71200850159404,Medium,3293,False,True,Calculate Product Final Price,calculate-product-final-price,['Database'],False,False
81.47689768976898,Medium,3294,False,True,Convert Doubly Linked List to Array II,convert-doubly-linked-list-to-array-ii,"['Array', 'Linked List', 'Doubly-Linked List']",False,False
47.35326564574335,Medium,3295,False,False,Report Spam Message,report-spam-message,"['Array', 'Hash Table', 'String']",False,False
35.68194281237759,Medium,3296,False,False,Minimum Number of Seconds to Make Mountain Height Zero,minimum-number-of-seconds-to-make-mountain-height-zero,"['Array', 'Math', 'Binary Search', 'Greedy', 'Heap (Priority Queue)']",False,False
41.14167979638832,Medium,3297,False,False,Count Substrings That Can Be Rearranged to Contain a String I,count-substrings-that-can-be-rearranged-to-contain-a-string-i,"['Hash Table', 'String', 'Sliding Window']",False,False
55.297263173530396,Hard,3298,False,False,Count Substrings That Can Be Rearranged to Contain a String II,count-substrings-that-can-be-rearranged-to-contain-a-string-ii,"['Hash Table', 'String', 'Sliding Window']",False,False
39.9098083427283,Hard,3299,False,True,Sum of Consecutive Subsequences,sum-of-consecutive-subsequences,"['Array', 'Hash Table', 'Dynamic Programming']",False,False
83.29056742928262,Easy,3300,False,False,Minimum Element After Replacement With Digit Sum,minimum-element-after-replacement-with-digit-sum,"['Array', 'Math']",False,False
36.09344028027474,Medium,3301,False,False,Maximize the Total Height of Unique Towers,maximize-the-total-height-of-unique-towers,"['Array', 'Greedy', 'Sorting']",False,False
19.99031945788964,Medium,3302,False,False,Find the Lexicographically Smallest Valid Sequence,find-the-lexicographically-smallest-valid-sequence,"['Two Pointers', 'String', 'Dynamic Programming', 'Greedy']",False,False
13.469652710159039,Hard,3303,False,False,Find the Occurrence of First Almost Equal Substring,find-the-occurrence-of-first-almost-equal-substring,"['String', 'String Matching']",False,False
72.72691056370759,Easy,3304,False,False,Find the K-th Character in String Game I,find-the-k-th-character-in-string-game-i,"['Math', 'Bit Manipulation', 'Recursion', 'Simulation']",False,False
40.963703402543146,Medium,3305,False,False,Count of Substrings Containing Every Vowel and K Consonants I,count-of-substrings-containing-every-vowel-and-k-consonants-i,"['Hash Table', 'String', 'Sliding Window']",False,False
40.7296457146298,Medium,3306,False,False,Count of Substrings Containing Every Vowel and K Consonants II,count-of-substrings-containing-every-vowel-and-k-consonants-ii,"['Hash Table', 'String', 'Sliding Window']",True,False
28.910287273310864,Hard,3307,False,False,Find the K-th Character in String Game II,find-the-k-th-character-in-string-game-ii,"['Math', 'Bit Manipulation', 'Recursion']",False,False
50.20242914979757,Medium,3308,False,True,Find Top Performing Driver,find-top-performing-driver,['Database'],False,False
64.92125531670308,Medium,3309,False,False,Maximum Possible Number by Binary Concatenation,maximum-possible-number-by-binary-concatenation,"['Array', 'Bit Manipulation', 'Enumeration']",False,False
49.018658130817506,Medium,3310,False,False,Remove Methods From Project,remove-methods-from-project,"['Depth-First Search', 'Breadth-First Search', 'Graph']",False,False
28.920919361121932,Hard,3311,False,False,Construct 2D Grid Matching Graph Layout,construct-2d-grid-matching-graph-layout,"['Array', 'Hash Table', 'Graph', 'Matrix']",False,False
19.932976454715583,Hard,3312,False,False,Sorted GCD Pair Queries,sorted-gcd-pair-queries,"['Array', 'Hash Table', 'Math', 'Binary Search', 'Combinatorics', 'Counting', 'Number Theory', 'Prefix Sum']",False,False
51.03211009174312,Hard,3313,False,True,Find the Last Marked Nodes in Tree,find-the-last-marked-nodes-in-tree,"['Tree', 'Depth-First Search']",False,False
73.72390715461836,Easy,3314,False,False,Construct the Minimum Bitwise Array I,construct-the-minimum-bitwise-array-i,"['Array', 'Bit Manipulation']",False,False
34.5142547082363,Medium,3315,False,False,Construct the Minimum Bitwise Array II,construct-the-minimum-bitwise-array-ii,"['Array', 'Bit Manipulation']",False,False
38.683646932843814,Medium,3316,False,False,Find Maximum Removals From Source String,find-maximum-removals-from-source-string,"['Array', 'Hash Table', 'Two Pointers', 'String', 'Dynamic Programming']",False,False
32.652316672747176,Hard,3317,False,False,Find the Number of Possible Ways for an Event,find-the-number-of-possible-ways-for-an-event,"['Math', 'Dynamic Programming', 'Combinatorics']",False,False
63.22032539873367,Easy,3318,False,False,Find X-Sum of All K-Long Subarrays I,find-x-sum-of-all-k-long-subarrays-i,"['Array', 'Hash Table', 'Sliding Window', 'Heap (Priority Queue)']",False,False
60.74439112955518,Medium,3319,False,False,K-th Largest Perfect Subtree Size in Binary Tree,k-th-largest-perfect-subtree-size-in-binary-tree,"['Tree', 'Depth-First Search', 'Sorting', 'Binary Tree']",False,False
31.548319822395644,Hard,3320,False,False,Count The Number of Winning Sequences,count-the-number-of-winning-sequences,"['String', 'Dynamic Programming']",False,False
15.532063197026021,Hard,3321,False,False,Find X-Sum of All K-Long Subarrays II,find-x-sum-of-all-k-long-subarrays-ii,"['Array', 'Hash Table', 'Sliding Window', 'Heap (Priority Queue)']",False,False
72.4881995954147,Medium,3322,False,True,Premier League Table Ranking III,premier-league-table-ranking-iii,['Database'],False,False
50.94773118897186,Medium,3323,False,True,Minimize Connected Groups by Inserting Interval,minimize-connected-groups-by-inserting-interval,"['Array', 'Binary Search', 'Sliding Window', 'Sorting']",False,False
79.0101842560369,Medium,3324,False,False,Find the Sequence of Strings Appeared on the Screen,find-the-sequence-of-strings-appeared-on-the-screen,"['String', 'Simulation']",False,False
54.25649481642605,Medium,3325,False,False,Count Substrings With K-Frequency Characters I,count-substrings-with-k-frequency-characters-i,"['Hash Table', 'String', 'Sliding Window']",False,False
28.374762012541773,Medium,3326,False,False,Minimum Division Operations to Make Array Non Decreasing,minimum-division-operations-to-make-array-non-decreasing,"['Array', 'Math', 'Greedy', 'Number Theory']",False,False
20.643494598403006,Hard,3327,False,False,Check if DFS Strings Are Palindromes,check-if-dfs-strings-are-palindromes,"['Array', 'Hash Table', 'String', 'Tree', 'Depth-First Search', 'Hash Function']",False,False
71.52061855670104,Medium,3328,False,True,Find Cities in Each State II,find-cities-in-each-state-ii,['Database'],False,False
70.40690505548706,Hard,3329,False,True,Count Substrings With K-Frequency Characters II,count-substrings-with-k-frequency-characters-ii,"['Hash Table', 'String', 'Sliding Window']",False,False
56.360510361053294,Easy,3330,False,False,Find the Original Typed String I,find-the-original-typed-string-i,['String'],False,False
54.48553643354083,Medium,3331,False,False,Find Subtree Sizes After Changes,find-subtree-sizes-after-changes,"['Array', 'Hash Table', 'String', 'Tree', 'Depth-First Search']",False,False
49.57526198793268,Medium,3332,False,False,Maximum Points Tourist Can Earn,maximum-points-tourist-can-earn,"['Array', 'Dynamic Programming', 'Matrix']",False,False
16.2333661902415,Hard,3333,False,False,Find the Original Typed String II,find-the-original-typed-string-ii,"['String', 'Dynamic Programming', 'Prefix Sum']",False,False
40.17272240777989,Medium,3334,False,False,Find the Maximum Factor Score of Array,find-the-maximum-factor-score-of-array,"['Array', 'Math', 'Number Theory']",False,False
26.347227421428688,Medium,3335,False,False,Total Characters in String After Transformations I,total-characters-in-string-after-transformations-i,"['Hash Table', 'Math', 'String', 'Dynamic Programming', 'Counting']",False,False
37.782290320595656,Hard,3336,False,False,Find the Number of Subsequences With Equal GCD,find-the-number-of-subsequences-with-equal-gcd,"['Array', 'Math', 'Dynamic Programming', 'Number Theory']",False,False
32.64266597599931,Hard,3337,False,False,Total Characters in String After Transformations II,total-characters-in-string-after-transformations-ii,"['Hash Table', 'Math', 'String', 'Dynamic Programming', 'Counting']",False,False
89.58333333333334,Medium,3338,False,True,Second Highest Salary II,second-highest-salary-ii,['Database'],False,False
56.72043010752689,Medium,3339,False,True,Find the Number of K-Even Arrays,find-the-number-of-k-even-arrays,['Dynamic Programming'],False,False
84.03493968373024,Easy,3340,False,False,Check Balanced String,check-balanced-string,['String'],False,False
35.64286164910731,Medium,3341,False,False,Find Minimum Time to Reach Last Room I,find-minimum-time-to-reach-last-room-i,"['Array', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']",False,False
49.868173258003765,Medium,3342,False,False,Find Minimum Time to Reach Last Room II,find-minimum-time-to-reach-last-room-ii,"['Array', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']",False,False
15.737730912550543,Hard,3343,False,False,Count Number of Balanced Permutations,count-number-of-balanced-permutations,"['Math', 'String', 'Dynamic Programming', 'Combinatorics']",False,False
52.28113440197287,Medium,3344,False,True,Maximum Sized Array,maximum-sized-array,"['Binary Search', 'Bit Manipulation']",False,False
63.826532639357936,Easy,3345,False,False,Smallest Divisible Digit Product I,smallest-divisible-digit-product-i,"['Math', 'Enumeration']",False,False
20.60572389561248,Medium,3346,False,False,Maximum Frequency of an Element After Performing Operations I,maximum-frequency-of-an-element-after-performing-operations-i,"['Array', 'Binary Search', 'Sliding Window', 'Sorting', 'Prefix Sum']",False,False
37.229341581970836,Hard,3347,False,False,Maximum Frequency of an Element After Performing Operations II,maximum-frequency-of-an-element-after-performing-operations-ii,"['Array', 'Binary Search', 'Sliding Window', 'Sorting', 'Prefix Sum']",False,False
9.992069785884219,Hard,3348,False,False,Smallest Divisible Digit Product II,smallest-divisible-digit-product-ii,"['Math', 'String', 'Backtracking', 'Greedy', 'Number Theory']",False,False
39.726774094641094,Easy,3349,False,False,Adjacent Increasing Subarrays Detection I,adjacent-increasing-subarrays-detection-i,['Array'],False,False
40.69994323825741,Medium,3350,False,False,Adjacent Increasing Subarrays Detection II,adjacent-increasing-subarrays-detection-ii,"['Array', 'Binary Search']",False,False
29.39110070257611,Hard,3351,False,False,Sum of Good Subsequences,sum-of-good-subsequences,"['Array', 'Hash Table', 'Dynamic Programming']",False,False
28.16416040100251,Hard,3352,False,False,Count K-Reducible Numbers Less Than N,count-k-reducible-numbers-less-than-n,"['Math', 'String', 'Dynamic Programming', 'Combinatorics']",False,False
63.45733041575492,Easy,3353,False,True,Minimum Total Operations,minimum-total-operations,['Array'],False,False
55.30333089694059,Easy,3354,False,False,Make Array Elements Equal to Zero,make-array-elements-equal-to-zero,"['Array', 'Simulation', 'Prefix Sum']",False,False
45.71284003035937,Medium,3355,False,False,Zero Array Transformation I,zero-array-transformation-i,"['Array', 'Prefix Sum']",False,False
43.81640035843748,Medium,3356,False,False,Zero Array Transformation II,zero-array-transformation-ii,"['Array', 'Binary Search', 'Prefix Sum']",True,False
15.121214301129415,Hard,3357,False,False,Minimize the Maximum Adjacent Element Difference,minimize-the-maximum-adjacent-element-difference,"['Array', 'Binary Search', 'Greedy']",False,False
92.83225485316078,Easy,3358,False,True,Books with NULL Ratings,books-with-null-ratings,['Database'],False,False
50.30549898167006,Hard,3359,False,True,Find Sorted Submatrices With Maximum Element at Most K,find-sorted-submatrices-with-maximum-element-at-most-k,"['Array', 'Stack', 'Matrix', 'Monotonic Stack']",False,False
41.382035705430205,Easy,3360,False,False,Stone Removal Game,stone-removal-game,"['Math', 'Simulation']",False,False
52.43501956400224,Medium,3361,False,False,Shift Distance Between Two Strings,shift-distance-between-two-strings,"['Array', 'String', 'Prefix Sum']",False,False
25.868948212743202,Medium,3362,False,False,Zero Array Transformation III,zero-array-transformation-iii,"['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Prefix Sum']",False,False
39.21907394609537,Hard,3363,False,False,Find the Maximum Number of Fruits Collected,find-the-maximum-number-of-fruits-collected,"['Array', 'Dynamic Programming', 'Matrix']",False,False
45.1217799252746,Easy,3364,False,False,Minimum Positive Sum Subarray ,minimum-positive-sum-subarray,"['Array', 'Sliding Window', 'Prefix Sum']",False,False
52.10243051288983,Medium,3365,False,False,Rearrange K Substrings to Form Target String,rearrange-k-substrings-to-form-target-string,"['Hash Table', 'String', 'Sorting']",False,False
29.209443263533984,Medium,3366,False,False,Minimum Array Sum,minimum-array-sum,"['Array', 'Dynamic Programming']",False,False
28.52782138496424,Hard,3367,False,False,Maximize Sum of Weights after Edge Removals,maximize-sum-of-weights-after-edge-removals,"['Dynamic Programming', 'Tree', 'Depth-First Search']",False,False
87.53541076487252,Hard,3368,False,True,First Letter Capitalization,first-letter-capitalization,['Database'],False,False
33.98464759246336,Hard,3369,False,True,Design an Array Statistics Tracker ,design-an-array-statistics-tracker,"['Hash Table', 'Binary Search', 'Design', 'Queue', 'Heap (Priority Queue)', 'Data Stream', 'Ordered Set']",False,False
75.46226455756218,Easy,3370,False,False,Smallest Number With All Set Bits,smallest-number-with-all-set-bits,"['Math', 'Bit Manipulation']",False,False
34.69407638347623,Medium,3371,False,False,Identify the Largest Outlier in an Array,identify-the-largest-outlier-in-an-array,"['Array', 'Hash Table', 'Counting', 'Enumeration']",False,False
47.90461694571284,Medium,3372,False,False,Maximize the Number of Target Nodes After Connecting Trees I,maximize-the-number-of-target-nodes-after-connecting-trees-i,"['Tree', 'Depth-First Search', 'Breadth-First Search']",False,False
53.75210419066182,Hard,3373,False,False,Maximize the Number of Target Nodes After Connecting Trees II,maximize-the-number-of-target-nodes-after-connecting-trees-ii,"['Tree', 'Depth-First Search', 'Breadth-First Search']",False,False
77.19110731081659,Hard,3374,False,False,First Letter Capitalization II,first-letter-capitalization-ii,['Database'],False,False
73.13878637985228,Easy,3375,False,False,Minimum Operations to Make Array Values Equal to K,minimum-operations-to-make-array-values-equal-to-k,"['Array', 'Hash Table']",True,False
30.356130356130357,Medium,3376,False,False,Minimum Time to Break Locks I,minimum-time-to-break-locks-i,"['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Depth-First Search', 'Bitmask']",False,False
31.10045703019984,Medium,3377,False,False,Digit Operations to Make Two Integers Equal,digit-operations-to-make-two-integers-equal,"['Math', 'Graph', 'Heap (Priority Queue)', 'Number Theory', 'Shortest Path']",False,False
27.66777101471608,Hard,3378,False,False,Count Connected Components in LCM Graph,count-connected-components-in-lcm-graph,"['Array', 'Hash Table', 'Math', 'Union Find', 'Number Theory']",False,False
56.2254186901047,Easy,3379,False,False,Transformed Array,transformed-array,"['Array', 'Simulation']",False,False
50.96318749252183,Medium,3380,False,False,Maximum Area Rectangle With Point Constraints I,maximum-area-rectangle-with-point-constraints-i,"['Array', 'Math', 'Binary Indexed Tree', 'Segment Tree', 'Geometry', 'Sorting', 'Enumeration']",False,False
27.845113706207748,Medium,3381,False,False,Maximum Subarray Sum With Length Divisible by K,maximum-subarray-sum-with-length-divisible-by-k,"['Array', 'Hash Table', 'Prefix Sum']",False,False
20.103243401188273,Hard,3382,False,False,Maximum Area Rectangle With Point Constraints II,maximum-area-rectangle-with-point-constraints-ii,"['Array', 'Math', 'Binary Indexed Tree', 'Segment Tree', 'Geometry', 'Sorting']",False,False
45.903361344537814,Hard,3383,False,True,Minimum Runes to Add to Cast Spell,minimum-runes-to-add-to-cast-spell,"['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph', 'Topological Sort']",False,False
77.50826901874312,Hard,3384,False,True,Team Dominance by Pass Success,team-dominance-by-pass-success,['Database'],False,False
46.420824295010846,Hard,3385,False,True,Minimum Time to Break Locks II,minimum-time-to-break-locks-ii,"['Array', 'Depth-First Search', 'Graph']",False,False
40.41273245625507,Easy,3386,False,False,Button with Longest Push Time,button-with-longest-push-time,['Array'],False,False
59.841683987087066,Medium,3387,False,False,Maximize Amount After Two Days of Conversions,maximize-amount-after-two-days-of-conversions,"['Array', 'String', 'Depth-First Search', 'Breadth-First Search', 'Graph']",False,False
15.632492293640826,Medium,3388,False,False,Count Beautiful Splits in an Array,count-beautiful-splits-in-an-array,"['Array', 'Dynamic Programming']",False,False
24.153577661431065,Hard,3389,False,False,Minimum Operations to Make Character Frequencies Equal,minimum-operations-to-make-character-frequencies-equal,"['Hash Table', 'String', 'Dynamic Programming', 'Counting', 'Enumeration']",False,False
42.96455424274973,Hard,3390,False,True,Longest Team Pass Streak,longest-team-pass-streak,['Database'],False,False
68.0,Medium,3391,False,True,Design a 3D Binary Matrix with Efficient Layer Tracking,design-a-3d-binary-matrix-with-efficient-layer-tracking,"['Array', 'Hash Table', 'Design', 'Heap (Priority Queue)', 'Matrix', 'Ordered Set']",False,False
51.643216596487626,Easy,3392,False,False,Count Subarrays of Length Three With a Condition,count-subarrays-of-length-three-with-a-condition,['Array'],False,False
39.73299011801662,Medium,3393,False,False,Count Paths With the Given XOR Value,count-paths-with-the-given-xor-value,"['Array', 'Dynamic Programming', 'Bit Manipulation', 'Matrix']",False,False
69.14072582726757,Medium,3394,False,False,Check if Grid can be Cut into Sections,check-if-grid-can-be-cut-into-sections,"['Array', 'Sorting']",True,False
16.565674567813225,Hard,3395,False,False,Subsequences with a Unique Middle Mode I,subsequences-with-a-unique-middle-mode-i,"['Array', 'Hash Table', 'Math', 'Combinatorics']",False,False
71.56169864027706,Easy,3396,False,False,Minimum Number of Operations to Make Elements in Array Distinct,minimum-number-of-operations-to-make-elements-in-array-distinct,"['Array', 'Hash Table']",True,False
31.17350959296248,Medium,3397,False,False,Maximum Number of Distinct Elements After Operations,maximum-number-of-distinct-elements-after-operations,"['Array', 'Greedy', 'Sorting']",False,False
18.886909784069246,Hard,3398,False,False,Smallest Substring With Identical Characters I,smallest-substring-with-identical-characters-i,"['Array', 'Binary Search', 'Enumeration']",False,False
40.565762613006704,Hard,3399,False,False,Smallest Substring With Identical Characters II,smallest-substring-with-identical-characters-ii,"['String', 'Binary Search']",False,False
85.46712802768167,Medium,3400,False,True,Maximum Number of Matching Indices After Right Shifts,maximum-number-of-matching-indices-after-right-shifts,"['Array', 'Two Pointers', 'Simulation']",False,False
55.3314121037464,Hard,3401,False,True,Find Circular Gift Exchange Chains,find-circular-gift-exchange-chains,['Database'],False,False
73.06947329117173,Easy,3402,False,False,Minimum Operations to Make Columns Strictly Increasing,minimum-operations-to-make-columns-strictly-increasing,"['Array', 'Greedy', 'Matrix']",False,False
23.659382538073963,Medium,3403,False,False,Find the Lexicographically Largest String From the Box I,find-the-lexicographically-largest-string-from-the-box-i,"['Two Pointers', 'String', 'Enumeration']",False,False
28.42538861661505,Medium,3404,False,False,Count Special Subsequences,count-special-subsequences,"['Array', 'Hash Table', 'Math', 'Enumeration']",False,False
37.67531964354901,Hard,3405,False,False,Count the Number of Arrays with K Matching Adjacent Elements,count-the-number-of-arrays-with-k-matching-adjacent-elements,"['Math', 'Combinatorics']",False,False
51.29682997118156,Hard,3406,False,True,Find the Lexicographically Largest String From the Box II,find-the-lexicographically-largest-string-from-the-box-ii,"['Two Pointers', 'String']",False,False
26.38591842528627,Easy,3407,False,False,Substring Matching Pattern,substring-matching-pattern,"['String', 'String Matching']",False,False
34.13862598535677,Medium,3408,False,False,Design Task Manager,design-task-manager,"['Hash Table', 'Design', 'Heap (Priority Queue)', 'Ordered Set']",False,False
14.123585015754465,Medium,3409,False,False,Longest Subsequence With Decreasing Adjacent Difference,longest-subsequence-with-decreasing-adjacent-difference,"['Array', 'Dynamic Programming']",False,False
20.26943326107154,Hard,3410,False,False,Maximize Subarray Sum After Removing All Occurrences of One Element,maximize-subarray-sum-after-removing-all-occurrences-of-one-element,"['Array', 'Dynamic Programming', 'Segment Tree']",False,False
45.9357613542201,Easy,3411,False,False,Maximum Subarray With Equal Products,maximum-subarray-with-equal-products,"['Array', 'Math', 'Sliding Window', 'Enumeration', 'Number Theory']",False,False
36.115887655671926,Medium,3412,False,False,Find Mirror Score of a String,find-mirror-score-of-a-string,"['Hash Table', 'String', 'Stack', 'Simulation']",False,False
23.546981516620985,Medium,3413,False,False,Maximum Coins From K Consecutive Bags,maximum-coins-from-k-consecutive-bags,"['Array', 'Binary Search', 'Greedy', 'Sliding Window', 'Sorting', 'Prefix Sum']",False,False
32.26768092105263,Hard,3414,False,False,Maximum Score of Non-overlapping Intervals,maximum-score-of-non-overlapping-intervals,"['Array', 'Binary Search', 'Dynamic Programming', 'Sorting']",False,False
82.50244379276637,Easy,3415,False,True,Find Products with Three Consecutive Digits ,find-products-with-three-consecutive-digits,['Database'],False,False
43.66197183098591,Hard,3416,False,True,Subsequences with a Unique Middle Mode II,subsequences-with-a-unique-middle-mode-ii,"['Array', 'Hash Table', 'Math', 'Combinatorics']",False,False
64.11893469536666,Easy,3417,False,False,Zigzag Grid Traversal With Skip,zigzag-grid-traversal-with-skip,"['Array', 'Matrix', 'Simulation']",False,False
29.797272392185768,Medium,3418,False,False,Maximum Amount of Money Robot Can Earn,maximum-amount-of-money-robot-can-earn,"['Array', 'Dynamic Programming', 'Matrix']",False,False
43.23749949877701,Medium,3419,False,False,Minimize the Maximum Edge Weight of Graph,minimize-the-maximum-edge-weight-of-graph,"['Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Shortest Path']",False,False
21.819031303535276,Hard,3420,False,False,Count Non-Decreasing Subarrays After K Operations,count-non-decreasing-subarrays-after-k-operations,"['Array', 'Stack', 'Segment Tree', 'Queue', 'Sliding Window', 'Monotonic Stack', 'Monotonic Queue']",False,False
48.444185141968106,Medium,3421,False,False,Find Students Who Improved,find-students-who-improved,['Database'],False,False
49.94011976047904,Medium,3422,False,True,Minimum Operations to Make Subarray Elements Equal,minimum-operations-to-make-subarray-elements-equal,"['Array', 'Hash Table', 'Math', 'Sliding Window', 'Heap (Priority Queue)']",False,False
73.75962958527921,Easy,3423,False,False,Maximum Difference Between Adjacent Elements in a Circular Array,maximum-difference-between-adjacent-elements-in-a-circular-array,['Array'],False,False
36.686332510745395,Medium,3424,False,False,Minimum Cost to Make Arrays Identical,minimum-cost-to-make-arrays-identical,"['Array', 'Greedy', 'Sorting']",False,False
20.07801743919229,Hard,3425,False,False,Longest Special Path,longest-special-path,"['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Prefix Sum']",False,False
35.79374275782155,Hard,3426,False,False,Manhattan Distances of All Arrangements of Pieces,manhattan-distances-of-all-arrangements-of-pieces,"['Math', 'Combinatorics']",False,False
85.98608088599686,Easy,3427,False,False,Sum of Variable Length Subarrays,sum-of-variable-length-subarrays,"['Array', 'Prefix Sum']",False,False
21.035999999999998,Medium,3428,False,False,Maximum and Minimum Sums of at Most Size K Subsequences,maximum-and-minimum-sums-of-at-most-size-k-subsequences,"['Array', 'Math', 'Dynamic Programming', 'Sorting', 'Combinatorics']",False,False
45.371577574967404,Medium,3429,False,False,Paint House IV,paint-house-iv,"['Array', 'Dynamic Programming']",False,False
23.477430140912347,Hard,3430,False,False,Maximum and Minimum Sums of at Most Size K Subarrays,maximum-and-minimum-sums-of-at-most-size-k-subarrays,"['Array', 'Math', 'Stack', 'Monotonic Stack']",False,False
59.523809523809526,Medium,3431,False,True,Minimum Unlocked Indices to Sort Nums,minimum-unlocked-indices-to-sort-nums,"['Array', 'Hash Table']",False,False
80.65975988330779,Easy,3432,False,False,Count Partitions with Even Sum Difference,count-partitions-with-even-sum-difference,"['Array', 'Math', 'Prefix Sum']",False,False
30.139103554868623,Medium,3433,False,False,Count Mentions Per User,count-mentions-per-user,"['Array', 'Math', 'Sorting', 'Simulation']",False,False
23.49835621736608,Medium,3434,False,False,Maximum Frequency After Subarray Operation,maximum-frequency-after-subarray-operation,"['Array', 'Hash Table', 'Dynamic Programming', 'Greedy', 'Enumeration', 'Prefix Sum']",False,False
24.601686972820993,Hard,3435,False,False,Frequencies of Shortest Supersequences,frequencies-of-shortest-supersequences,"['Array', 'String', 'Bit Manipulation', 'Graph', 'Topological Sort', 'Enumeration']",False,False
58.49778493757552,Easy,3436,False,False,Find Valid Emails,find-valid-emails,['Database'],False,False
87.05463182897863,Medium,3437,False,True,Permutations III,permutations-iii,"['Array', 'Backtracking']",False,False
61.608362134367354,Easy,3438,False,False,Find Valid Pair of Adjacent Digits in String,find-valid-pair-of-adjacent-digits-in-string,"['Hash Table', 'String', 'Counting']",False,False
31.431496147836864,Medium,3439,False,False,Reschedule Meetings for Maximum Free Time I,reschedule-meetings-for-maximum-free-time-i,"['Array', 'Greedy', 'Sliding Window']",False,False
40.18582104625328,Medium,3440,False,False,Reschedule Meetings for Maximum Free Time II,reschedule-meetings-for-maximum-free-time-ii,"['Array', 'Greedy', 'Enumeration']",False,False
19.180449271784745,Hard,3441,False,False,Minimum Cost Good Caption,minimum-cost-good-caption,"['String', 'Dynamic Programming']",False,False
49.12352373170913,Easy,3442,False,False,Maximum Difference Between Even and Odd Frequency I,maximum-difference-between-even-and-odd-frequency-i,"['Hash Table', 'String', 'Counting']",False,False
30.998767444634407,Medium,3443,False,False,Maximum Manhattan Distance After K Changes,maximum-manhattan-distance-after-k-changes,"['Hash Table', 'Math', 'String', 'Counting']",False,False
25.634270101483214,Hard,3444,False,False,Minimum Increments for Target Multiples in an Array,minimum-increments-for-target-multiples-in-an-array,"['Array', 'Math', 'Dynamic Programming', 'Bit Manipulation', 'Number Theory', 'Bitmask']",False,False
19.318287359524472,Hard,3445,False,False,Maximum Difference Between Even and Odd Frequency II,maximum-difference-between-even-and-odd-frequency-ii,"['String', 'Sliding Window', 'Enumeration', 'Prefix Sum']",False,False
72.54871395167577,Medium,3446,False,False,Sort Matrix by Diagonals,sort-matrix-by-diagonals,"['Array', 'Sorting', 'Matrix']",False,False
27.040023894862603,Medium,3447,False,False,Assign Elements to Groups with Constraints,assign-elements-to-groups-with-constraints,"['Array', 'Hash Table']",False,False
20.895784030151635,Hard,3448,False,False,Count Substrings Divisible By Last Digit,count-substrings-divisible-by-last-digit,"['String', 'Dynamic Programming']",False,False
24.473616912454183,Hard,3449,False,False,Maximize the Minimum Game Score,maximize-the-minimum-game-score,"['Array', 'Binary Search', 'Greedy']",False,False
86.32686084142395,Easy,3450,False,True,Maximum Students on a Single Bench,maximum-students-on-a-single-bench,"['Array', 'Hash Table']",False,False
58.38182321972846,Hard,3451,False,False,Find Invalid IP Addresses,find-invalid-ip-addresses,['Database'],False,False
69.8934794445957,Easy,3452,False,False,Sum of Good Numbers,sum-of-good-numbers,['Array'],False,False
36.5942881979029,Medium,3453,False,False,Separate Squares I,separate-squares-i,"['Array', 'Binary Search']",False,False
19.3719806763285,Hard,3454,False,False,Separate Squares II,separate-squares-ii,"['Array', 'Binary Search', 'Segment Tree', 'Line Sweep']",False,False
24.51694956708898,Hard,3455,False,False,Shortest Matching Substring,shortest-matching-substring,"['Two Pointers', 'String', 'Binary Search', 'String Matching']",False,False
35.308896412974136,Easy,3456,False,False,Find Special Substring of Length K,find-special-substring-of-length-k,['String'],False,False
32.62120095926269,Medium,3457,False,False,Eat Pizzas!,eat-pizzas,"['Array', 'Greedy', 'Sorting']",False,False
17.81527314174062,Medium,3458,False,False,Select K Disjoint Special Substrings,select-k-disjoint-special-substrings,"['Hash Table', 'String', 'Dynamic Programming', 'Greedy', 'Sorting']",False,False
39.88095238095239,Hard,3459,False,False,Length of Longest V-Shaped Diagonal Segment,length-of-longest-v-shaped-diagonal-segment,"['Array', 'Dynamic Programming', 'Memoization', 'Matrix']",False,False
68.73563218390805,Medium,3460,False,True,Longest Common Prefix After at Most One Removal,longest-common-prefix-after-at-most-one-removal,"['Two Pointers', 'String']",False,False
80.117066032559,Easy,3461,False,False,Check If Digits Are Equal in String After Operations I,check-if-digits-are-equal-in-string-after-operations-i,"['Math', 'String', 'Simulation', 'Combinatorics', 'Number Theory']",False,False
60.33403300521135,Medium,3462,False,False,Maximum Sum With at Most K Elements,maximum-sum-with-at-most-k-elements,"['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Matrix']",False,False
9.919019008251762,Hard,3463,False,False,Check If Digits Are Equal in String After Operations II,check-if-digits-are-equal-in-string-after-operations-ii,"['Math', 'String', 'Combinatorics', 'Number Theory']",False,False
18.70557426112982,Hard,3464,False,False,Maximize the Distance Between Points on a Square,maximize-the-distance-between-points-on-a-square,"['Array', 'Binary Search', 'Greedy']",False,False
84.80797793337577,Easy,3465,False,False,Find Products with Valid Serial Numbers,find-products-with-valid-serial-numbers,['Database'],False,False
54.008603832616345,Medium,3466,False,True,Maximum Coin Collection ,maximum-coin-collection,"['Array', 'Dynamic Programming']",False,False
89.01945232927034,Easy,3467,False,False,Transform Array by Parity,transform-array-by-parity,"['Array', 'Sorting', 'Counting']",False,False
45.503654273911664,Medium,3468,False,False,Find the Number of Copy Arrays,find-the-number-of-copy-arrays,"['Array', 'Math']",False,False
17.477187559545232,Medium,3469,False,False,Find Minimum Cost to Remove Array Elements,find-minimum-cost-to-remove-array-elements,"['Array', 'Dynamic Programming']",False,False
26.49592282071896,Hard,3470,False,False,Permutations IV,permutations-iv,"['Array', 'Math', 'Combinatorics', 'Enumeration']",False,False
36.47557972251347,Easy,3471,False,False,Find the Largest Almost Missing Integer,find-the-largest-almost-missing-integer,"['Array', 'Hash Table']",False,False
35.780078951885116,Medium,3472,False,False,Longest Palindromic Subsequence After at Most K Operations,longest-palindromic-subsequence-after-at-most-k-operations,"['String', 'Dynamic Programming']",False,False
24.30666880410388,Medium,3473,False,False,Sum of K Subarrays With Length at Least M,sum-of-k-subarrays-with-length-at-least-m,"['Array', 'Dynamic Programming', 'Prefix Sum']",False,False
28.74198322644302,Hard,3474,False,False,Lexicographically Smallest Generated String,lexicographically-smallest-generated-string,"['String', 'Greedy', 'String Matching']",False,False
87.44447734675748,Medium,3475,False,False,DNA Pattern Recognition ,dna-pattern-recognition,['Database'],False,False
63.1578947368421,Medium,3476,False,True,Maximize Profit from Task Assignment,maximize-profit-from-task-assignment,"['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']",False,False
51.22854616955767,Easy,3477,False,False,Fruits Into Baskets II,fruits-into-baskets-ii,"['Array', 'Binary Search', 'Segment Tree', 'Simulation']",False,False
30.630987253582454,Medium,3478,False,False,Choose K Elements With Maximum Sum,choose-k-elements-with-maximum-sum,"['Array', 'Sorting', 'Heap (Priority Queue)']",False,False
21.131025201859554,Medium,3479,False,False,Fruits Into Baskets III,fruits-into-baskets-iii,"['Array', 'Binary Search', 'Segment Tree', 'Ordered Set']",False,False
31.538903244329603,Hard,3480,False,False,Maximize Subarrays After Removing One Conflicting Pair,maximize-subarrays-after-removing-one-conflicting-pair,"['Array', 'Segment Tree', 'Enumeration', 'Prefix Sum']",False,False
77.129750982962,Medium,3481,False,True,Apply Substitutions,apply-substitutions,"['Array', 'Hash Table', 'String', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']",False,False
64.4633972992182,Hard,3482,False,False,Analyze Organization Hierarchy,analyze-organization-hierarchy,['Database'],False,False
65.7497303128371,Easy,3483,False,False,Unique 3-Digit Even Numbers,unique-3-digit-even-numbers,"['Array', 'Hash Table', 'Recursion', 'Enumeration']",False,False
68.00221361372441,Medium,3484,False,False,Design Spreadsheet,design-spreadsheet,"['Array', 'Hash Table', 'String', 'Design', 'Matrix']",False,False
19.530541961210805,Hard,3485,False,False,Longest Common Prefix of K Strings After Removal,longest-common-prefix-of-k-strings-after-removal,"['Array', 'String', 'Trie']",False,False
15.50513913261469,Hard,3486,False,False,Longest Special Path II,longest-special-path-ii,"['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Prefix Sum']",False,False
26.80350135828554,Easy,3487,False,False,Maximum Unique Subarray Sum After Deletion,maximum-unique-subarray-sum-after-deletion,"['Array', 'Hash Table', 'Greedy']",False,False
30.449217675220574,Medium,3488,False,False,Closest Equal Element Queries,closest-equal-element-queries,"['Array', 'Hash Table', 'Binary Search']",False,False
28.862509500199053,Medium,3489,False,False,Zero Array Transformation IV,zero-array-transformation-iv,"['Array', 'Dynamic Programming']",False,False
20.052067924974853,Hard,3490,False,False,Count Beautiful Numbers,count-beautiful-numbers,['Dynamic Programming'],False,False
75.40628385698808,Easy,3491,False,True,Phone Number Prefix,phone-number-prefix,"['Array', 'String', 'Trie', 'Sorting']",False,False
74.3041385948027,Easy,3492,False,False,Maximum Containers on a Ship,maximum-containers-on-a-ship,['Math'],False,False
46.280772751360985,Medium,3493,False,False,Properties Graph,properties-graph,"['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']",False,False
32.82163742690059,Medium,3494,False,False,Find the Minimum Amount of Time to Brew Potions,find-the-minimum-amount-of-time-to-brew-potions,"['Array', 'Simulation', 'Prefix Sum']",False,False
30.406494359219245,Hard,3495,False,False,Minimum Operations to Make Array Elements Zero,minimum-operations-to-make-array-elements-zero,"['Array', 'Math', 'Bit Manipulation']",False,False
62.450592885375485,Medium,3496,False,True,Maximize Score After Pair Deletions,maximize-score-after-pair-deletions,"['Array', 'Greedy']",False,False
84.6707818930041,Medium,3497,False,False,Analyze Subscription Conversion ,analyze-subscription-conversion,['Database'],False,False
88.75377436178974,Easy,3498,False,False,Reverse Degree of a String,reverse-degree-of-a-string,"['String', 'Simulation']",False,False
29.86325191684452,Medium,3499,False,False,Maximize Active Section with Trade I,maximize-active-section-with-trade-i,"['String', 'Enumeration']",False,False
21.9034166151673,Hard,3500,False,False,Minimum Cost to Divide Array Into Subarrays,minimum-cost-to-divide-array-into-subarrays,"['Array', 'Dynamic Programming', 'Prefix Sum']",False,False
18.650793650793652,Hard,3501,False,False,Maximize Active Section with Trade II,maximize-active-section-with-trade-ii,"['Array', 'String', 'Binary Search', 'Segment Tree']",False,False
83.3695025135291,Easy,3502,False,False,Minimum Cost to Reach Every Position,minimum-cost-to-reach-every-position,['Array'],False,False
43.14316213972245,Medium,3503,False,False,Longest Palindrome After Substring Concatenation I,longest-palindrome-after-substring-concatenation-i,"['Two Pointers', 'String', 'Dynamic Programming', 'Enumeration']",False,False
14.9061400759238,Hard,3504,False,False,Longest Palindrome After Substring Concatenation II,longest-palindrome-after-substring-concatenation-ii,"['Two Pointers', 'String', 'Dynamic Programming']",False,False
27.38729508196721,Hard,3505,False,False,Minimum Operations to Make Elements Within K Subarrays Equal,minimum-operations-to-make-elements-within-k-subarrays-equal,"['Array', 'Hash Table', 'Math', 'Dynamic Programming', 'Sliding Window', 'Heap (Priority Queue)']",False,False
57.801418439716315,Hard,3506,False,True,Find Time Required to Eliminate Bacterial Strains,find-time-required-to-eliminate-bacterial-strains,"['Array', 'Math', 'Greedy', 'Heap (Priority Queue)']",False,False
57.28819916545548,Easy,3507,False,False,Minimum Pair Removal to Sort Array I,minimum-pair-removal-to-sort-array-i,"['Array', 'Hash Table', 'Linked List', 'Heap (Priority Queue)', 'Simulation', 'Doubly-Linked List', 'Ordered Set']",False,False
20.01485477502834,Medium,3508,False,False,Implement Router,implement-router,"['Array', 'Hash Table', 'Binary Search', 'Design', 'Queue', 'Ordered Set']",False,False
9.275551211035083,Hard,3509,False,False,Maximum Product of Subsequences With an Alternating Sum Equal to K,maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k,"['Array', 'Hash Table', 'Dynamic Programming']",False,False
11.304457474308052,Hard,3510,False,False,Minimum Pair Removal to Sort Array II,minimum-pair-removal-to-sort-array-ii,"['Array', 'Hash Table', 'Linked List', 'Heap (Priority Queue)', 'Simulation', 'Doubly-Linked List', 'Ordered Set']",False,False
42.22222222222222,Medium,3511,False,True,Make a Positive Array,make-a-positive-array,"['Array', 'Greedy', 'Prefix Sum']",False,False