3629.Minimum Jumps to Reach End via Prime Teleportation
MediumArrayBreadth-First SearchHash Table44.6% acceptance4 companiesVideo
3631.Sort Threats by Severity and Exploitability
MediumArraySorting63.3% acceptancePremium elsewhere, free hereVideo
3633.Earliest Finish Time for Land and Water Rides I
EasyArrayBinary SearchGreedy73.0% acceptance4 companiesVideo
3634.Minimum Removals to Balance Array
MediumArrayBinary SearchSliding Window47.9% acceptance4 companiesVideo
3635.Earliest Finish Time for Land and Water Rides II
MediumArrayBinary SearchGreedy64.2% acceptance2 companiesVideo
3637.Trionic Array I
EasyArray49.5% acceptance4 companiesVideo
3638.Maximum Balanced Shipments
MediumArrayDynamic ProgrammingGreedy61.4% acceptance1 companyVideo
3640.Trionic Array II
HardArrayDynamic Programming47.3% acceptance6 companiesVideo
3641.Longest Semi-Repeating Subarray
MediumArrayHash TableSliding Window63.9% acceptancePremium elsewhere, free hereVideo
3642.Find Books with Polarized Opinions
Medium47.1% acceptanceVideo
3643.Flip Square Submatrix Vertically
EasyArrayMatrixTwo Pointers79.3% acceptance2 companiesVideo
3644.Maximum K to Sort a Permutation
MediumArrayBit Manipulation57.5% acceptance1 companyVideo
3645.Maximum Total from Optimal Activation Order
MediumArrayGreedyHeap (Priority Queue)33.1% acceptance2 companiesVideo
3647.Maximum Weight in Two Bags
MediumArrayDynamic Programming58.3% acceptancePremium elsewhere, free here
3650.Minimum Cost Path with Edge Reversals
MediumGraphHeap (Priority Queue)Shortest Path61.8% acceptance8 companiesVideo
3651.Minimum Cost Path with Teleportations
HardArrayDynamic ProgrammingMatrix45.1% acceptance4 companiesVideo
3652.Best Time to Buy and Sell Stock using Strategy
MediumArrayPrefix SumSliding Window59.8% acceptance5 companiesVideo
3653.XOR After Range Multiplication Queries I
MediumArrayDivide and ConquerSimulation73.3% acceptance2 companiesVideo
3655.XOR After Range Multiplication Queries II
HardArrayDivide and Conquer47.8% acceptance2 companiesVideo
3657.Find Loyal Customers
Medium64.8% acceptanceVideo
3658.GCD of Odd and Even Sums
EasyMathNumber Theory89.8% acceptance3 companiesVideo
3659.Partition Array Into K-Distinct Groups
MediumArrayCountingHash Table47.1% acceptance1 companyVideo
3660.Jump Game IX
MediumArrayDynamic Programming46.1% acceptance4 companiesVideo
3661.Maximum Walls Destroyed by Robots
HardArrayBinary SearchDynamic Programming48.0% acceptance3 companiesVideo
3662.Filter Characters by Frequency
EasyCountingHash TableString86.2% acceptance1 companyPremium elsewhere, free here
3663.Find The Least Frequent Digit
EasyArrayCountingHash Table68.8% acceptance1 companyVideo
3665.Twisted Mirror Path Count
MediumArrayDynamic ProgrammingMatrix47.5% acceptance2 companiesVideo
3666.Minimum Operations to Equalize Binary String
HardBreadth-First SearchMathOrdered Set45.2% acceptance4 companiesVideo
3667.Sort Array By Absolute Value
EasyArrayMathSorting86.7% acceptance1 companyPremium elsewhere, free hereVideo
3668.Restore Finishing Order
EasyArrayHash Table91.1% acceptance2 companiesVideo
3669.Balanced K-Factor Decomposition
MediumBacktrackingMathNumber Theory40.2% acceptance2 companiesVideo
3672.Sum of Weighted Modes in Subarrays
MediumArrayCountingHash Table54.3% acceptancePremium elsewhere, free here
3673.Find Zombie Sessions
Hard53.9% acceptanceVideo
3674.Minimum Operations to Equalize Array
EasyArrayBit ManipulationBrainteaser60.8% acceptanceVideo
3675.Minimum Operations to Transform String
MediumGreedyString61.9% acceptanceVideo
3678.Smallest Absent Positive Greater Than Average
EasyArrayHash Table34.2% acceptanceVideo
3679. Minimum Discards to Balance Inventory
MediumArrayCountingHash Table35.5% acceptanceVideo
3682.Minimum Index Sum of Common Elements
MediumArrayHash Table77.5% acceptancePremium elsewhere, free here
3683.Earliest Time to Finish One Task
EasyArray84.5% acceptanceVideo
3684.Maximize Sum of At Most K Distinct Elements
EasyArrayGreedyHash Table76.8% acceptanceVideo
3687.Library Late Fee Calculator
EasyArraySimulation94.4% acceptancePremium elsewhere, free hereVideo
3688.Bitwise OR of Even Numbers in an Array
EasyArrayBit ManipulationSimulation84.9% acceptance2 companiesVideo
3689.Maximum Total Subarray Value I
MediumArrayGreedy71.9% acceptance4 companiesVideo
3690.Split and Merge Array Transformation
MediumArrayBreadth-First SearchHash Table58.7% acceptance1 companyVideo
3691.Maximum Total Subarray Value II
HardArrayGreedyHeap (Priority Queue)41.6% acceptance3 companiesVideo
3692.Majority Frequency Characters
EasyCountingHash TableString66.3% acceptanceVideo
3693.Climbing Stairs II
MediumArrayDynamic Programming63.9% acceptanceVideo
3694.Distinct Points Reachable After Substring Removal
MediumHash TablePrefix SumSliding Window53.9% acceptanceVideo
3696.Maximum Distance Between Unequal Words in Array I
EasyArrayString81.7% acceptance1 companyPremium elsewhere, free hereVideo
3697.Compute Decimal Representation
EasyArrayMath64.7% acceptance1 companyVideo
Showing 3,551–3,600 of 3,918
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.