FALSE Problem # Title Tags Acceptance Difficulty Summer Bootcamps Presenter Date Time Slot

114 Linked ListStackTreeDepth-First 61.90% Muhammad Faizan Anis

FALSE Flatten Binary Tree to Linked List SearchBinary Tree Medium 1
287 ArrayTwo PointersBinary SearchBit 59.10% Muhammad Faizan Anis
FALSE Find the Duplicate Number Manipulation Medium 2
FALSE 1249 Minimum Remove to Make Valid Parentheses StringStack 65.90% Medium Qaisar Abbas 3
FALSE 316 Remove Duplicate Letters StringStackGreedyMonotonic Stack 45.10% Medium Qaisar Abbas 4
FALSE 137 Single Number II ArrayBit Manipulation 58.60% Medium Taqi Javed 5
FALSE 951 Flip Equivalent Binary Trees TreeDepth-First SearchBinary Tree 66.80% Medium Taqi Javed 6
FALSE 208 Implement Trie (Prefix Tree) Hash TableStringDesignTrie 62.90% Medium Masfa Nasrullah Ansari 7
863 TreeDepth-First SearchBreadth-First 62.30% Zubair Zafar
FALSE All Nodes Distance K in Binary Tree SearchBinary Tree Medium 8
FALSE 636 Exclusive Time of Functions ArrayStack 61.20% Medium Ali Tariq 28/5/25 03:00 9
FALSE 516 Longest Palindromic Subsequence StringDynamic Programming 61.70% Medium Zubair Zafar 10
FALSE 1105 Filling Bookcase Shelves ArrayDynamic Programming 59.40% Medium Masfa Nasrullah Ansari 11
FALSE 518 Coin Change II ArrayDynamic Programming 60.70% Medium Zubair Zafar 12
FALSE 967 Numbers With Same Consecutive Differences BacktrackingBreadth-First Search 57.40% Medium Maria Nadeem 13
1202 Hash TableStringDepth-First 57.70% Zubair Zafar
FALSE Smallest String With Swaps SearchBreadth-First SearchUnion Find Medium 14
934 ArrayDepth-First SearchBreadth-First 54.40% Zubair Zafar
FALSE Shortest Bridge SearchMatrix Medium 15
FALSE 1155 Number of Dice Rolls With Target Sum Dynamic Programming 53.90% Medium 16
785 Depth-First SearchBreadth-First 53.20%
FALSE Is Graph Bipartite? SearchUnion FindGraph Medium 17
FALSE 994 Rotting Oranges ArrayBreadth-First SearchMatrix 53.00% Medium Muhammad Qasim 18
FALSE 939 Minimum Area Rectangle ArrayHash TableMathGeometrySorting 52.90% Medium Abdullah Khetran 19
95 Dynamic 52.50%
ProgrammingBacktrackingTreeBinary
FALSE Unique Binary Search Trees II Search TreeBinary Tree Medium 20
FALSE 300 Longest Increasing Subsequence ArrayBinary SearchDynamic Programming 52.30% Medium 21
FALSE 377 Combination Sum IV ArrayDynamic Programming 52.20% Medium 22
FALSE 1901 Find a Peak Element II ArrayBinary SearchMatrix 52.10% Medium 23
FALSE 1138 Alphabet Board Path Hash TableString 52.00% Medium 24
743 Depth-First SearchBreadth-First 51.90%
SearchGraphHeap (Priority Queue)Shortest
FALSE Network Delay Time Path Medium 25
FALSE 1218 Longest Arithmetic Subsequence of Given Difference ArrayHash TableDynamic Programming 51.90% Medium 26
FALSE 792 Number of Matching Subsequences Hash TableStringTrieSorting 51.60% Medium 27
FALSE 622 Design Circular Queue ArrayLinked ListDesignQueue 51.50% Medium Maria Nadeem 28
486 ArrayMathDynamic 51.30%
FALSE Predict the Winner ProgrammingRecursionGame Theory Medium 29
FALSE 524 Longest Word in Dictionary through Deleting ArrayTwo PointersStringSorting 51.00% Medium 30
253 ArrayTwo PointersGreedySortingHeap
FALSE Meeting Rooms II (Priority Queue)Prefix Sum
Paid 31
Medium
FALSE 935 Knight Dialer Dynamic Programming 50.60% Medium 32
FALSE 990 Satisfiability of Equality Equations ArrayStringUnion FindGraph 50.50% Medium 33
FALSE 2013 Detect Squares ArrayHash TableDesignCounting 50.30% Medium 34
117 Linked ListTreeDepth-First SearchBreadth- 50.30%
FALSE Populating Next Right Pointers in Each Node II First SearchBinary Tree Medium 35
FALSE 562 Longest Line of Consecutive One in Matrix ArrayDynamic ProgrammingMatrix 50.20% Medium 36
2184 ArrayDynamic ProgrammingBit 50.20%
FALSE Number of Ways to Build Sturdy Brick Wall ManipulationBitmask Medium 37
FALSE 1352 Product of the Last K Numbers ArrayMathDesignQueueData Stream 50.10% Medium 38
FALSE 487 Max Consecutive Ones II ArrayDynamic ProgrammingSliding Window 49.70% Medium 39
FALSE 1820 Maximum Number of Accepted Invitations ArrayBacktrackingMatrix 49.50% Medium 40
FALSE 2018 Check if Word Can Be Placed In Crossword ArrayMatrixEnumeration 49.40% Medium 41
FALSE 1926 Nearest Exit from Entrance in Maze ArrayBreadth-First SearchMatrix 48.90% Medium 42
2034 Hash TableDesignHeap (Priority Queue) 48.80%
FALSE Stock Price Fluctuation Data StreamOrdered Set Medium 43
FALSE 616 Add Bold Tag in String ArrayHash TableStringTrieString Matching 48.80% Medium 44
210 Depth-First SearchBreadth-First 48.60%
FALSE Course Schedule II SearchGraphTopological Sort Medium 45
FALSE 2096 Step-By-Step Directions From a Binary Tree Node to Another StringTreeDepth-First SearchBinary Tree 48.50% Medium 46
2115 ArrayHash TableStringGraphTopological 48.40%
FALSE Find All Possible Recipes from Given Supplies Sort Medium 47
1438 ArrayQueueSliding WindowHeap (Priority 48.40%
FALSE Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit Queue)Ordered SetMonotonic Queue Medium 48
FALSE 1642 Furthest Building You Can Reach ArrayGreedyHeap (Priority Queue) 48.30% Medium 49
FALSE 93 Restore IP Addresses StringBacktracking 47.60% Medium 51
FALSE 474 Ones and Zeroes ArrayStringDynamic Programming 46.80% Medium 53
658 ArrayTwo PointersBinary SearchSliding 46.80% Anzar AHmad
FALSE Find K Closest Elements WindowSortingHeap (Priority Queue) Medium 54
FALSE 388 Longest Absolute File Path StringStackDepth-First Search 46.70% Medium 55
528 ArrayMathBinary SearchPrefix 46.10%
FALSE Random Pick with Weight SumRandomized Medium 56
207 Depth-First SearchBreadth-First 45.40%
FALSE Course Schedule SearchGraphTopological Sort Medium 57
FALSE 393 UTF-8 Validation ArrayBit Manipulation 45.10% Medium 58
FALSE 221 Maximal Square ArrayDynamic ProgrammingMatrix 45.00% Medium 59
542 ArrayDynamic ProgrammingBreadth-First 44.90%
FALSE 01 Matrix SearchMatrix Medium 60
FALSE 1091 Shortest Path in Binary Matrix ArrayBreadth-First SearchMatrix 44.80% Medium 61
395 Hash TableStringDivide and 44.80%
FALSE Longest Substring with At Least K Repeating Characters ConquerSliding Window Medium 62
FALSE 211 Design Add and Search Words Data Structure StringDepth-First SearchDesignTrie 44.00% Medium 63
TRUE 1996 The Number of Weak Characters in the Game ArrayStackGreedySortingMonotonic Stack 43.90% Medium Asad Ullah Khan 64
FALSE 593 Valid Square MathGeometry 43.90% Medium Mariam Noor Khetran 65
673 ArrayDynamic ProgrammingBinary Indexed 43.00%
FALSE Number of Longest Increasing Subsequence TreeSegment Tree Medium 66
2135 ArrayHash TableStringBit 42.70%
FALSE Count Words Obtained After Adding a Letter ManipulationSorting Medium 67
662 TreeDepth-First SearchBreadth-First 42.70%
FALSE Maximum Width of Binary Tree SearchBinary Tree Medium 69
1554 Hash TableStringRolling HashHash 42.50% Paid
FALSE Strings Differ by One Character Function Medium 70
FALSE 2345 Finding the Number of Visible Mountains ArrayStackSortingMonotonic Stack 42.20% Medium 71
2101 ArrayMathDepth-First SearchBreadth-First 42.10%
FALSE Detonate the Maximum Bombs SearchGraphGeometry Medium 72
FALSE 2171 Removing Minimum Number of Magic Beans ArraySortingPrefix Sum 42.10% Medium Muhammad Abu Bakar 73
146 Hash TableLinked ListDesignDoubly-Linked 40.70% Zubair Zafar
FALSE LRU Cache List Medium 74
FALSE 2007 Find Original Array From Doubled Array ArrayHash TableGreedySorting 40.60% Medium 75
FALSE 79 Word Search ArrayBacktrackingMatrix 40.30% Medium Zubair Zafar 76
473 ArrayDynamic 40.20% Zubair Zafar
ProgrammingBacktrackingBit
FALSE Matchsticks to Square ManipulationBitmask Medium 77
FALSE 2162 Minimum Cost to Set Cooking Time MathEnumeration 40.10% Medium 78
FALSE 1882 Process Tasks Using Servers ArrayHeap (Priority Queue) 39.50% Medium Zubair Zafar 79
1838 ArrayBinary SearchGreedySliding 39.50%
FALSE Frequency of the Most Frequent Element WindowSortingPrefix Sum Medium 80
FALSE 63 Unique Paths II ArrayDynamic ProgrammingMatrix 39.50% Medium 81
FALSE 353 Design Snake Game ArrayDesignQueueMatrix 39.20% Medium 82
FALSE 43 Multiply Strings MathStringSimulation 39.20% Medium Zubair Zafar 84
310 Depth-First SearchBreadth-First 38.60%
FALSE Minimum Height Trees SearchGraphTopological Sort Medium 85
365 MathDepth-First SearchBreadth-First 37.80% Zubair Zafar
FALSE Water and Jug Problem Search Medium https://claude.ai/public/artifacts/c3ce8180-5d6f-4cc3-badd-93a30134b9b6
86
FALSE 97 Interleaving String StringDynamic Programming 37.40% Medium 87
787 Dynamic ProgrammingDepth-First 37.10%
SearchBreadth-First SearchGraphHeap
FALSE Cheapest Flights Within K Stops (Priority Queue)Shortest Path Medium 88
2311 StringDynamic 37.00%
FALSE Longest Binary Subsequence Less Than or Equal to K ProgrammingGreedyMemoization Medium 89
FALSE 1937 Maximum Number of Points with Cost ArrayDynamic Programming 36.00% Medium 90
FALSE 418 Sentence Screen Fitting StringDynamic ProgrammingSimulation 35.60% Medium 91
FALSE 794 Valid Tic-Tac-Toe State ArrayString 35.00% Medium Masfa Nasrullah Ansari 92
FALSE 152 Maximum Product Subarray ArrayDynamic Programming 34.90% Medium Mariam Noor Khetran 93
2250 ArrayBinary SearchBinary Indexed 34.10%
FALSE Count Number of Rectangles Containing Each Point TreeSorting Medium 94
FALSE 678 Valid Parenthesis String StringDynamic ProgrammingStackGreedy 34.10% Medium Masfa Nasrullah Ansari 95
2271 ArrayBinary SearchGreedySortingPrefix 33.00%
FALSE Maximum White Tiles Covered by a Carpet Sum Medium 96
1986 ArrayDynamic 32.90%
ProgrammingBacktrackingBit
FALSE Minimum Number of Work Sessions to Finish the Tasks ManipulationBitmask Medium 97
FALSE 91 Decode Ways StringDynamic Programming 32.80% Medium 98
FALSE 5 Longest Palindromic Substring StringDynamic Programming 32.40% Medium Zubair Zafar 99
FALSE 306 Additive Number StringBacktracking 31.10% Medium Zubair Zafar 100
FALSE 29 Divide Two Integers MathBit Manipulation 17.10% Medium 101
FALSE 190 Reverse Bits Divide and ConquerBit Manipulation 54.20% Easy Ahmed Faraz
FALSE 224 Basic Calculator MathStringStackRecursion 42.50% Hard Qaisar Abbas 1
1255 ArrayStringDynamic 72.30%
ProgrammingBacktrackingBit
FALSE Maximum Score Words Formed by Letters ManipulationBitmask Hard 2
1284 ArrayBit ManipulationBreadth-First 71.90%
FALSE Minimum Number of Flips to Convert Binary Matrix to Zero Matrix SearchMatrix Hard 3
FALSE 759 Employee Free Time ArraySortingHeap (Priority Queue) 71.80% Hard 4
FALSE 1074 Number of Submatrices That Sum to Target ArrayHash TableMatrixPrefix Sum 69.50% Hard 5
428 StringTreeDepth-First SearchBreadth-First 66.00%
FALSE Serialize and Deserialize N-ary Tree Search Hard 6
FALSE 51 N-Queens ArrayBacktracking 64.40% Hard 7
2277 ArrayTreeDepth-First SearchBreadth-First 64.00%
FALSE Closest Node to Path in Tree Search Hard 8
FALSE 1697 Checking Existence of Edge Length Limited Paths ArrayUnion FindGraphSorting 63.30% Hard 9
FALSE 1473 Paint House III ArrayDynamic Programming 61.50% Hard 10
847 Dynamic ProgrammingBit 60.80%
ManipulationBreadth-First
FALSE Shortest Path Visiting All Nodes SearchGraphBitmask Hard 11
FALSE 1579 Remove Max Number of Edges to Keep Graph Fully Traversable Union FindGraph 60.20% Hard 12
FALSE 1220 Count Vowels Permutation Dynamic Programming 60.20% Hard 13
FALSE 296 Best Meeting Point ArrayMathSortingMatrix 60.10% Hard 14
778 ArrayBinary SearchDepth-First 59.80%
SearchBreadth-First SearchUnion
FALSE Swim in Rising Water FindHeap (Priority Queue)Matrix Hard 15
302 ArrayBinary SearchDepth-First 58.50%
FALSE Smallest Rectangle Enclosing Black Pixels SearchBreadth-First SearchMatrix Hard 16
FALSE 37 Sudoku Solver ArrayHash TableBacktrackingMatrix 57.90% Hard 17
FALSE 2421 Number of Good Paths ArrayTreeUnion FindGraph 57.30% Hard 18
297 StringTreeDepth-First SearchBreadth-First 55.50%
FALSE Serialize and Deserialize Binary Tree SearchDesignBinary Tree Hard 19
FALSE 25 Reverse Nodes in k-Group Linked ListRecursion 54.80% Hard 20
FALSE 2158 Amount of New Area Painted Each Day ArraySegment TreeOrdered Set 54.60% Hard 21
FALSE 992 Subarrays with K Different Integers ArrayHash TableSliding WindowCounting 54.60% Hard 22
FALSE 72 Edit Distance StringDynamic Programming 54.50% Hard 23
839 ArrayStringDepth-First SearchBreadth-First 54.30%
FALSE Similar String Groups SearchUnion Find Hard 24
FALSE 1240 Tiling a Rectangle with the Fewest Squares Dynamic ProgrammingBacktracking 54.00% Hard 25
FALSE 1639 Number of Ways to Form a Target String Given a Dictionary ArrayStringDynamic Programming 53.90% Hard 26
410 ArrayBinary SearchDynamic 53.50%
FALSE Split Array Largest Sum ProgrammingGreedyPrefix Sum Hard 27
1235 ArrayBinary SearchDynamic 53.40%
FALSE Maximum Profit in Job Scheduling ProgrammingSorting Hard 28
329 ArrayDynamic ProgrammingDepth-First 52.50%
SearchBreadth-First
SearchGraphTopological
FALSE Longest Increasing Path in a Matrix SortMemoizationMatrix Hard 29
1857 Hash TableDynamic 52.20%
ProgrammingGraphTopological
FALSE Largest Color Value in a Directed Graph SortMemoizationCounting Hard 30
295 Two PointersDesignSortingHeap (Priority 51.40%
FALSE Find Median from Data Stream Queue)Data Stream Hard 31
23 Linked ListDivide and ConquerHeap 49.90% Taqi Javed
FALSE Merge k Sorted Lists (Priority Queue)Merge Sort Hard 32
465 ArrayDynamic 49.20%
ProgrammingBacktrackingBit
FALSE Optimal Account Balancing ManipulationBitmask Hard 33
FALSE 679 24 Game ArrayMathBacktracking 49.20% Hard 34
1263 ArrayBreadth-First SearchHeap (Priority 49.00%
FALSE Minimum Moves to Move a Box to Their Target Location Queue)Matrix Hard 35
FALSE 642 Design Search Autocomplete System StringDesignTrieData Stream 48.60% Hard 36
FALSE 1383 Maximum Performance of a Team ArrayGreedySortingHeap (Priority Queue) 48.40% Hard 37
2172 ArrayDynamic ProgrammingBit 48.30%
FALSE Maximum AND Sum of Array ManipulationBitmask Hard 38
1851 ArrayBinary SearchLine 48.20%
FALSE Minimum Interval to Include Each Query SweepSortingHeap (Priority Queue) Hard 39
FALSE 301 Remove Invalid Parentheses StringBacktrackingBreadth-First Search 47.20% Hard 40
FALSE 1345 Jump Game IV ArrayHash TableBreadth-First Search 46.90% Hard 41
968 Dynamic ProgrammingTreeDepth-First 46.60%
FALSE Binary Tree Cameras SearchBinary Tree Hard 42
239 ArrayQueueSliding WindowHeap (Priority 46.30%
FALSE Sliding Window Maximum Queue)Monotonic Queue Hard 43
FALSE 123 Best Time to Buy and Sell Stock III ArrayDynamic Programming 45.60% Hard 44
1499 ArrayQueueSliding WindowHeap (Priority 45.50%
FALSE Max Value of Equation Queue)Monotonic Queue Hard 45
FALSE 1293 Shortest Path in a Grid with Obstacles Elimination ArrayBreadth-First SearchMatrix 45.30% Hard 46
987 Hash TableTreeDepth-First SearchBreadth- 45.20%
FALSE Vertical Order Traversal of a Binary Tree First SearchBinary Tree Hard 47
827 ArrayDepth-First SearchBreadth-First 44.90%
FALSE Making A Large Island SearchUnion FindMatrix Hard 48
FALSE 715 Range Module DesignSegment TreeOrdered Set 44.60% Hard 49
FALSE 115 Distinct Subsequences StringDynamic Programming 44.60% Hard 50
FALSE 60 Permutation Sequence MathRecursion 44.50% Hard 51
FALSE 2416 Sum of Prefix Scores of Strings ArrayStringTrieCounting 43.80% Hard 52
FALSE 154 Find Minimum in Rotated Sorted Array II ArrayBinary Search 43.50% Hard 53
FALSE 818 Race Car Dynamic Programming 43.30% Hard 54
2426 ArrayBinary SearchDivide and 43.30%
ConquerBinary Indexed TreeSegment
FALSE Number of Pairs Satisfying Inequality TreeMerge SortOrdered Set Hard 55
1606 ArrayGreedyHeap (Priority Queue)Ordered 43.10%
FALSE Find Servers That Handled Most Number of Requests Set Hard 56
FALSE 403 Frog Jump ArrayDynamic Programming 43.10% Hard 57
FALSE 317 Shortest Distance from All Buildings ArrayBreadth-First SearchMatrix 42.60% Hard 58
FALSE 629 K Inverse Pairs Array Dynamic Programming 42.60% Hard 59
315 ArrayBinary SearchDivide and 42.50%
ConquerBinary Indexed TreeSegment
FALSE Count of Smaller Numbers After Self TreeMerge SortOrdered Set Hard 60
FALSE 1000 Minimum Cost to Merge Stones ArrayDynamic Programming 42.30% Hard 61
FALSE 2435 Paths in Matrix Whose Sum Is Divisible by K ArrayDynamic ProgrammingMatrix 41.70% Hard 62
FALSE 2188 Minimum Time to Finish the Race ArrayDynamic Programming 41.60% Hard 63
FALSE 552 Student Attendance Record II Dynamic Programming 41.40% Hard 64
FALSE 843 Guess the Word ArrayMathStringInteractiveGame Theory 41.30% Hard 65
FALSE 332 Reconstruct Itinerary Depth-First SearchGraphEulerian Circuit 41.30% Hard 66
FALSE 745 Prefix and Suffix Search Hash TableStringDesignTrie 41.20% Hard 67
FALSE 2366 Minimum Replacements to Sort the Array ArrayMathGreedy 40.90% Hard 68
1632 ArrayGreedyUnion FindGraphTopological 40.90%
FALSE Rank Transform of a Matrix SortMatrix Hard 69
FALSE 630 Course Schedule III ArrayGreedyHeap (Priority Queue) 40.10% Hard 70
871 ArrayDynamic ProgrammingGreedyHeap 39.80%
FALSE Minimum Number of Refueling Stops (Priority Queue) Hard 71
FALSE 282 Expression Add Operators MathStringBacktracking 39.20% Hard 72
 124 Dynamic ProgrammingTreeDepth-First 39.20%
FALSE Binary Tree Maximum Path Sum SearchBinary Tree Hard 73
FALSE 188 Best Time to Buy and Sell Stock IV ArrayDynamic Programming 39.10% Hard 74
975 ArrayDynamic 38.90%
ProgrammingStackMonotonic
FALSE Odd Even Jump StackOrdered Set Hard 75
FALSE 2242 Maximum Score of a Node Sequence ArrayGraphSortingEnumeration 38.00% Hard 76
354 ArrayBinary SearchDynamic 37.90%
FALSE Russian Doll Envelopes ProgrammingSorting Hard 77
FALSE 1770 Maximum Score from Performing Multiplication Operations ArrayDynamic Programming 37.60% Hard 78
FALSE 68 Text Justification ArrayStringSimulation 37.50% Hard 79
FALSE 1610 Maximum Number of Visible Points ArrayMathGeometrySliding WindowSorting 37.30% Hard 80
2458 ArrayTreeDepth-First SearchBreadth-First 37.30%
FALSE Height of Binary Tree After Subtree Removal Queries SearchBinary Tree Hard 81
FALSE 127 Word Ladder Hash TableStringBreadth-First Search 37.20% Hard 82
FALSE 41 First Missing Positive ArrayHash Table 36.80% Hard 83
FALSE 212 Word Search II ArrayStringBacktrackingTrieMatrix 36.40% Hard 84
FALSE 4 Median of Two Sorted Arrays ArrayBinary SearchDivide and Conquer 36.30% Hard 85
1825 DesignQueueHeap (Priority Queue)Data 35.80%
FALSE Finding MK Average StreamOrdered Set Hard 86
FALSE 336 Palindrome Pairs ArrayHash TableStringTrie 35.00% Hard 87
FALSE 2127 Maximum Employees to Be Invited to a Meeting Depth-First SearchGraphTopological Sort 34.90% Hard 88
2258 ArrayBinary SearchBreadth-First 34.90%
FALSE Escape the Spreading Fire SearchMatrix Hard 89
FALSE 2276 Count Integers in Intervals DesignSegment TreeOrdered Set 34.50% Hard 90
2092 Depth-First SearchBreadth-First 34.20%
FALSE Find All People With Secret SearchUnion FindGraphSorting Hard 91
FALSE 2402 Meeting Rooms III ArraySortingHeap (Priority Queue) 33.50% Hard Asad Ullah Khan 92
FALSE 1363 Largest Multiple of Three ArrayDynamic ProgrammingGreedy 33.20% Hard 93
FALSE 32 Longest Valid Parentheses StringDynamic ProgrammingStack 32.90% Hard 94
FALSE 1889 Minimum Space Wasted From Packaging ArrayBinary SearchSortingPrefix Sum 31.30% Hard 95
493 ArrayBinary SearchDivide and 30.80%
ConquerBinary Indexed TreeSegment
FALSE Reverse Pairs TreeMerge SortOrdered Set Hard 96
1044 StringBinary SearchSliding WindowRolling 30.60%
FALSE Longest Duplicate Substring HashSuffix ArrayHash Function Hard 97
1494 Dynamic ProgrammingBit 30.30%
FALSE Parallel Courses II ManipulationGraphBitmask Hard 98
FALSE 273 Integer to English Words MathStringRecursion 30.00% Hard 99
FALSE 10 Regular Expression Matching StringDynamic ProgrammingRecursion 28.00% Hard 100
862 ArrayBinary SearchQueueSliding 26.00%
WindowHeap (Priority Queue)Prefix
FALSE Shortest Subarray with Sum at Least K SumMonotonic Queue Hard 101
FALSE 149 Max Points on a Line ArrayHash TableMathGeometry 25.20% Hard 102
2407 ArrayDivide and ConquerDynamic 22.10%
ProgrammingBinary Indexed TreeSegment
FALSE Longest Increasing Subsequence II TreeQueueMonotonic Queue Hard 103
2035 ArrayTwo PointersBinary SearchDynamic 18.90%
ProgrammingBit ManipulationOrdered
FALSE Partition Array Into Two Arrays to Minimize Sum Difference SetBitmask Hard 104
FALSE 420 Strong Password Checker StringGreedyHeap (Priority Queue) 13.80% Hard 105
FALSE 76 Minimum Window Substring Hash TableStringSliding Window 40.90% Hard 106
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE
FALSE