Skip to content

For employers Sign in

Make and follow sheets.Sign in

Problems

78 problems

Has video Premium only Reset

Array578 Dynamic Programming332 String191 Math187 Binary Search136 Hash Table134 Sorting106 Greedy104 Bit Manipulation103 Graph96 Depth-First Search91 Heap (Priority Queue)78 Prefix Sum77 Matrix75 Breadth-First Search71 All topics

Hard · 78 results

Sign in to see which of these you have solved.Sign in

TitleSolutionAcceptDifficultyTopics

2532. Time to Cross a BridgeVideo

Solution44.4%Hard

Array, Heap (Priority Queue) +1· 1 company

2551. Put Marbles in BagsVideo

Solution72.2%Hard

Array, Greedy +2· 8 companies

2577. Minimum Time to Visit a Cell In a GridVideo

Solution56.3%Hard

Array, Breadth-First Search +4· 4 companies

2617. Minimum Number of Visited Cells in a GridVideo

Solution24.1%Hard

Array, Breadth-First Search +6· 3 companies

2642. Design Graph With Shortest Path CalculatorVideo

Solution65.6%Hard

Design, Graph +2· 2 companies

2699. Modify Graph Edge WeightsVideo

Solution55.6%Hard

Graph, Heap (Priority Queue) +1· 1 company

2714. Find Shortest Path with K HopsVideoPremium

Solution68.7%Hard

Graph, Heap (Priority Queue) +1· 1 company

2813. Maximum Elegance of a K-Length SubsequenceVideo

Solution29.1%Hard

Array, Greedy +4

2931. Maximum Spending After Buying ItemsVideo

Solution60.5%Hard

Array, Greedy +3· 2 companies

2940. Find Building Where Alice and Bob Can MeetVideo

Solution52.3%Hard

Array, Binary Indexed Tree +5· 5 companies

2959. Number of Possible Sets of Closing BranchesVideo

Solution51.2%Hard

Bit Manipulation, Enumeration +3· 3 companies

2969. Minimum Number of Coins for Fruits IIVideoPremium

Solution49.2%Hard

Array, Dynamic Programming +3

2973. Find Number of Coins to Place in Tree NodesVideo

Solution37.4%Hard

Depth-First Search, Dynamic Programming +3· 1 company

3013. Divide an Array Into Subarrays With Minimum Cost IIVideo

Solution54.7%Hard

Array, Hash Table +2· 4 companies

3049. Earliest Second to Mark Indices IIVideo

Solution22.6%Hard

Array, Binary Search +2· 2 companies

3123. Find Edges in Shortest PathsVideo

Solution47.0%Hard

Breadth-First Search, Depth-First Search +3· 2 companies

3266. Final Array State After K Multiplication Operations IIVideo

Solution13.7%Hard

Array, Heap (Priority Queue) +1· 3 companies

3321. Find X-Sum of All K-Long Subarrays IIVideo

Solution41.1%Hard

Array, Hash Table +2· 2 companies

3505. Minimum Operations to Make Elements Within K Subarrays EqualVideo

–27.8%Hard

Array, Dynamic Programming +4

3506. Find Time Required to Eliminate Bacterial StrainsPremium

Solution63.2%Hard

Array, Greedy +2

3510. Minimum Pair Removal to Sort Array IIVideo

Solution39.1%Hard

Array, Doubly-Linked List +5· 3 companies

3594. Minimum Time to Transport All IndividualsVideo

–28.3%Hard

Array, Bit Manipulation +4

3620. Network Recovery PathwaysVideo

Solution50.8%Hard

Array, Binary Search +5· 2 companies

3691. Maximum Total Subarray Value IIVideo

Solution41.6%Hard

Array, Greedy +2· 3 companies

3928. Minimum Cost to Buy Apples IIVideo

–31.8%Hard

Array, Graph +2· 1 company

3962. Maximum Subarray Sum After at Most K SwapsVideo

Solution14.2%Hard

Array, Binary Indexed Tree +5· 1 company

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

Showing 51–78 of 78