2537.Count the Number of Good Subarrays
MediumArrayHash TableSliding Window65.9% acceptance7 companiesVideo
Medium · 2,078 results
2539.Count the Number of Good Subsequences
MediumCombinatoricsCountingHash Table47.7% acceptance4 companiesPremium elsewhere, free hereVideo
2541.Minimum Operations to Make Array Equal II
MediumArrayGreedyMath33.1% acceptance1 companyVideo
2542.Maximum Subsequence Score
MediumArrayGreedyHeap (Priority Queue)54.6% acceptance5 companiesVideo
2545.Sort the Students by Their Kth Score
MediumArrayMatrixSorting86.1% acceptance3 companiesVideo
2546.Apply Bitwise Operations to Make Strings Equal
MediumBit ManipulationString42.6% acceptance1 companyVideo
2548.Maximum Price to Fill a Bag
MediumArrayGreedySorting65.2% acceptance1 companyPremium elsewhere, free hereVideo
2550.Count Collisions of Monkeys on a Polygon
MediumMathRecursion30.6% acceptance3 companiesVideo
2554.Maximum Number of Integers to Choose From a Range I
MediumArrayBinary SearchGreedy68.0% acceptance1 companyVideo
2555.Maximize Win From Two Segments
MediumArrayBinary SearchSliding Window38.2% acceptance1 companyVideo
2556.Disconnect Path in a Binary Matrix by at Most One Flip
MediumArrayBreadth-First SearchDepth-First Search28.4% acceptance1 companyVideo
2557.Maximum Number of Integers to Choose From a Range II
MediumArrayBinary SearchGreedy34.9% acceptance1 companyPremium elsewhere, free hereVideo
2559.Count Vowel Strings in Ranges
MediumArrayPrefix SumString67.8% acceptance9 companiesVideo
2560.House Robber IV
MediumArrayBinary Search64.8% acceptance7 companiesVideo
2563.Count the Number of Fair Pairs
MediumArrayBinary SearchSorting52.7% acceptance9 companiesVideo
2564.Substring XOR Queries
MediumArrayBit ManipulationHash Table36.1% acceptance1 companyVideo
2567.Minimum Score by Changing Two Elements
MediumArrayGreedySorting50.4% acceptanceVideo
2568.Minimum Impossible OR
MediumArrayBit ManipulationBrainteaser59.5% acceptance1 companyVideo
2571.Minimum Operations to Reduce an Integer to 0
MediumBit ManipulationDynamic ProgrammingGreedy63.5% acceptance8 companiesVideo
2572.Count the Number of Square-Free Subsets
MediumArrayBit ManipulationBitmask27.1% acceptance2 companiesVideo
2575.Find the Divisibility Array of a String
MediumArrayMathString37.1% acceptance2 companiesVideo
2576.Find the Maximum Number of Marked Indices
MediumArrayBinary SearchGreedy41.7% acceptanceVideo
2579.Count Total Number of Colored Cells
MediumMath66.1% acceptance5 companiesVideo
2580.Count Ways to Group Overlapping Ranges
MediumArraySorting39.7% acceptance2 companiesVideo
2583.Kth Largest Sum in a Binary Tree
MediumBinary TreeBreadth-First SearchSorting59.4% acceptance5 companiesVideo
2587.Rearrange Array to Maximize Prefix Score
MediumArrayGreedyPrefix Sum43.2% acceptance3 companiesVideo
2588.Count the Number of Beautiful Subarrays
MediumArrayBit ManipulationHash Table54.7% acceptanceVideo
2590.Design a Todo List
MediumArrayDesignHash Table59.8% acceptance1 companyPremium elsewhere, free hereVideo
2592.Maximize Greatness of an Array
MediumArrayGreedySorting62.0% acceptance7 companiesVideo
2593.Find Score of an Array After Marking All Elements
MediumArrayHash TableHeap (Priority Queue)64.5% acceptance5 companiesVideo
2594.Minimum Time to Repair Cars
MediumArrayBinary Search59.6% acceptance6 companiesVideo
2596.Check Knight Tour Configuration
MediumArrayBreadth-First SearchDepth-First Search62.0% acceptance3 companiesVideo
2597.The Number of Beautiful Subsets
MediumArrayBacktrackingCombinatorics50.9% acceptance4 companiesVideo
2598.Smallest Missing Non-negative Integer After Operations
MediumArrayGreedyHash Table56.0% acceptance6 companiesVideo
2599.Make the Prefix Sum Non-negative
MediumArrayGreedyHeap (Priority Queue)51.9% acceptance1 companyPremium elsewhere, free hereVideo
2601.Prime Subtraction Operation
MediumArrayBinary SearchGreedy55.9% acceptance4 companiesVideo
2602.Minimum Operations to Make All Array Elements Equal
MediumArrayBinary SearchPrefix Sum38.7% acceptance3 companiesVideo
2606.Find the Substring With Maximum Cost
MediumArrayDynamic ProgrammingHash Table57.7% acceptance2 companiesVideo
2607.Make K-Subarray Sums Equal
MediumArrayMathNumber Theory38.9% acceptance2 companiesVideo
2610.Convert an Array Into a 2D Array With Conditions
MediumArrayHash Table86.1% acceptance2 companiesVideo
2611.Mice and Cheese
MediumArrayGreedyHeap (Priority Queue)49.2% acceptance1 companyVideo
2615.Sum of Distances
MediumArrayHash TablePrefix Sum50.2% acceptance5 companiesVideo
2616.Minimize the Maximum Difference of Pairs
MediumArrayBinary SearchGreedy50.9% acceptance6 companiesVideo
2618.Check if Object Instance of Class
Medium27.7% acceptance2 companiesVideo
2622.Cache With Time Limit
Medium75.1% acceptance7 companiesVideo
2623.Memoize
Medium63.0% acceptance4 companiesVideo
2624.Snail Traversal
Medium66.0% acceptanceVideo
2625.Flatten Deeply Nested Array
Medium63.7% acceptance6 companiesVideo
2627.Debounce
Medium91.3% acceptance3 companiesVideo
2628.JSON Deep Equal
Medium38.8% acceptancePremium elsewhere, free hereVideo
Showing 1,351–1,400 of 2,078
How to use these solutions
Each solution breaks the problem into approaches, usually from brute force to the best one, and explains why each works. Code comes in Python, Java, C++ and other languages. Knowing why an approach works matters more in an interview than remembering the code.
- Try the problem first. Give it at least 20 minutes before you open the solution.
- Read every approach. The brute force shows you the problem; the faster ones show the pattern.
- Check the complexity. Note the time and space of each approach and what makes the difference.
- Write it yourself. Close the solution and code it from memory in the editor.
- Come back in a week. Solving it again later is what makes the pattern stick.