Talentd
For employersSign in
JobsInternshipsPracticeResume toolsCompaniesArticles
For employers
FleetCode
Make and follow sheets.Sign in

Problems

190 problems

Has videoPremium onlyReset
GraphArray2,237String877Hash Table797Math691Dynamic Programming673Sorting508Greedy485Binary Search357Depth-First Search338Database308Bit Manipulation286Matrix279Tree264Breadth-First Search257Prefix Sum252All topics

190 results

Sign in to see which of these you have solved.Sign in
TitleSolutionAcceptDifficultyTopics
3341. Find Minimum Time to Reach Last Room IVideo
Solution55.5%Medium
Array, Graph +3· 4 companies
3342. Find Minimum Time to Reach Last Room IIVideo
Solution67.3%Medium
Array, Graph +3· 3 companies
3377. Digit Operations to Make Two Integers EqualVideo
Solution31.3%Medium
Graph, Heap (Priority Queue) +3· 2 companies
3383. Minimum Runes to Add to Cast SpellPremium
Solution45.2%Hard
Array, Breadth-First Search +4· 1 company
3385. Minimum Time to Break Locks IIPremium
Solution45.7%Hard
Array, Depth-First Search +1· 1 company
3387. Maximize Amount After Two Days of ConversionsVideo
Solution60.6%Medium
Array, Breadth-First Search +3· 3 companies
3419. Minimize the Maximum Edge Weight of GraphVideo
–45.2%Medium
Binary Search, Breadth-First Search +3· 2 companies
3435. Frequencies of Shortest SupersequencesVideo
–22.2%Hard
Array, Bit Manipulation +4· 1 company
3481. Apply SubstitutionsVideoPremium
Solution78.0%Medium
Array, Breadth-First Search +5· 1 company
3493. Properties GraphVideo
Solution48.6%Medium
Array, Breadth-First Search +4· 1 company
3528. Unit Conversion IVideo
Solution53.3%Medium
Breadth-First Search, Depth-First Search +1· 1 company
3530. Maximum Profit from Valid Topological Order in DAGVideo
–29.7%Hard
Array, Bit Manipulation +4
3532. Path Existence Queries in a Graph IVideo
Solution70.6%Medium
Array, Binary Search +3· 5 companies
3534. Path Existence Queries in a Graph IIVideo
Solution64.2%Hard
Array, Binary Search +6· 4 companies
3535. Unit Conversion IIVideoPremium
Solution61.5%Medium
Array, Breadth-First Search +3· 1 company
3543. Maximum Weighted K-Edge PathVideo
–20.5%Medium
Dynamic Programming, Graph +1
3547. Maximum Sum of Edge Values in a GraphVideo
–35.4%Hard
Graph, Greedy +1· 1 company
3594. Minimum Time to Transport All IndividualsVideo
–28.3%Hard
Array, Bit Manipulation +4
3600. Maximize Spanning Tree Stability with UpgradesVideo
Solution65.9%Hard
Binary Search, Graph +3· 3 companies
3604. Minimum Time to Reach Destination in Directed GraphVideo
–45.5%Medium
Graph, Heap (Priority Queue) +1
3607. Power Grid MaintenanceVideo
Solution56.3%Medium
Array, Breadth-First Search +6· 7 companies
3608. Minimum Time for K Connected ComponentsVideo
Solution45.2%Medium
Binary Search, Graph +2· 2 companies
3613. Minimize Maximum Component CostVideo
Solution43.5%Medium
Binary Search, Graph +2· 4 companies
3615. Longest Palindromic Path in GraphVideo
–22.6%Hard
Bit Manipulation, Bitmask +3· 1 company
3620. Network Recovery PathwaysVideo
Solution50.8%Hard
Array, Binary Search +5· 2 companies
3650. Minimum Cost Path with Edge ReversalsVideo
Solution61.8%Medium
Graph, Heap (Priority Queue) +1· 8 companies
3656. Determine if a Simple Graph ExistsPremium
–47.5%Medium
Array, Binary Search +3
3710. Maximum Partition FactorVideo
–31.8%Hard
Array, Binary Search +4· 2 companies
3787. Find Diameter Endpoints of a TreePremium
Solution65.9%Medium
Breadth-First Search, Graph +1· 1 company
3807. Minimum Cost to Repair Edges to Traverse a GraphVideoPremium
Solution55.6%Medium
Binary Search, Breadth-First Search +1
3812. Minimum Edge Toggles on a TreeVideo
Solution65.6%Hard
Depth-First Search, Graph +3
3887. Incremental Even-Weighted Cycle QueriesVideo
–49.1%Hard
Graph, Union Find
3898. Find the Degree of Each VertexVideo
Solution91.8%Easy
Array, Graph +1
3910. Count Connected Subgraphs with Even Node SumVideo
Solution59.0%Hard
Array, Bit Manipulation +5
3924. Minimum Threshold Path With Limited Heavy EdgesVideo
–39.0%Hard
Binary Search, Breadth-First Search +1
3928. Minimum Cost to Buy Apples IIVideo
–31.8%Hard
Array, Graph +2· 1 company
3970. Shortest Path With At Most K Consecutive Identical CharactersVideo
–44.7%Medium
Graph, Heap (Priority Queue) +2
3977. Minimum Time to Reach Target With Limited PowerVideo
Solution40.4%Hard
Array, Dynamic Programming +3
4003. Minimum Cost Path with Alternating Directions IIIVideo
Solution61.4%Hard
Array, Graph +3
4046. Minimum Cost Path With At Most K TurnsVideo
–53.9%Hard
Array, Graph +3
Showing 151–190 of 190