3377.Digit Operations to Make Two Integers Equal
MediumGraphHeap (Priority Queue)Math31.3% acceptance2 companiesVideo
174 results
3383.Minimum Runes to Add to Cast Spell
HardArrayBreadth-First SearchDepth-First Search45.2% acceptance1 companyPremium elsewhere, free here
3385.Minimum Time to Break Locks II
HardArrayDepth-First SearchGraph45.7% acceptance1 companyPremium elsewhere, free here
3387.Maximize Amount After Two Days of Conversions
MediumArrayBreadth-First SearchDepth-First Search60.6% acceptance3 companiesVideo
3481.Apply Substitutions
MediumArrayBreadth-First SearchDepth-First Search78.0% acceptance1 companyPremium elsewhere, free hereVideo
3493.Properties Graph
MediumArrayBreadth-First SearchDepth-First Search48.6% acceptance1 companyVideo
3528.Unit Conversion I
MediumBreadth-First SearchDepth-First SearchGraph53.3% acceptance1 companyVideo
3532.Path Existence Queries in a Graph I
MediumArrayBinary SearchGraph70.6% acceptance5 companiesVideo
3534.Path Existence Queries in a Graph II
HardArrayBinary SearchBit Manipulation64.2% acceptance4 companiesVideo
3535.Unit Conversion II
MediumArrayBreadth-First SearchDepth-First Search61.5% acceptance1 companyPremium elsewhere, free hereVideo
3600.Maximize Spanning Tree Stability with Upgrades
HardBinary SearchGraphGreedy65.9% acceptance3 companiesVideo
3607.Power Grid Maintenance
MediumArrayBreadth-First SearchDepth-First Search56.3% acceptance7 companiesVideo
3608.Minimum Time for K Connected Components
MediumBinary SearchGraphSorting45.2% acceptance2 companiesVideo
3613.Minimize Maximum Component Cost
MediumBinary SearchGraphSorting43.5% acceptance4 companiesVideo
3620.Network Recovery Pathways
HardArrayBinary SearchDynamic Programming50.8% acceptance2 companiesVideo
3650.Minimum Cost Path with Edge Reversals
MediumGraphHeap (Priority Queue)Shortest Path61.8% acceptance8 companiesVideo
3787.Find Diameter Endpoints of a Tree
MediumBreadth-First SearchGraphTree65.9% acceptance1 companyPremium elsewhere, free here
3807.Minimum Cost to Repair Edges to Traverse a Graph
MediumBinary SearchBreadth-First SearchGraph55.6% acceptancePremium elsewhere, free hereVideo
3812.Minimum Edge Toggles on a Tree
HardDepth-First SearchGraphSorting65.6% acceptanceVideo
3898.Find the Degree of Each Vertex
EasyArrayGraphMatrix91.8% acceptanceVideo
3910.Count Connected Subgraphs with Even Node Sum
HardArrayBit ManipulationBreadth-First Search59.0% acceptanceVideo
3970.Shortest Path With At Most K Consecutive Identical Characters
MediumGraphHeap (Priority Queue)Shortest Path44.7% acceptanceVideo
3977.Minimum Time to Reach Target With Limited Power
HardArrayDynamic ProgrammingGraph40.4% acceptanceVideo
4003.Minimum Cost Path with Alternating Directions III
HardArrayGraphHeap (Priority Queue)61.4% acceptanceVideo
Showing 151–174 of 174
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.