Skip to content

For employers Sign in

Make and follow sheets.Sign in

Problems

71 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 · 71 results

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

TitleSolutionAcceptDifficultyTopics

2328. Number of Increasing Paths in a GridVideo

Solution57.4%Hard

Array, Breadth-First Search +6· 2 companies

2458. Height of Binary Tree After Subtree Removal QueriesVideo

Solution55.0%Hard

Array, Binary Tree +3· 3 companies

2493. Divide Nodes Into the Maximum Number of GroupsVideo

Solution67.0%Hard

Breadth-First Search, Graph +1· 6 companies

2503. Maximum Number of Points From Grid QueriesVideo

Solution59.3%Hard

Array, Breadth-First Search +5· 6 companies

2577. Minimum Time to Visit a Cell In a GridVideo

Solution56.3%Hard

Array, Breadth-First Search +4· 4 companies

2608. Shortest Cycle in a GraphVideo

Solution40.5%Hard

Breadth-First Search, Graph· 4 companies

2612. Minimum Reverse OperationsVideo

Solution17.5%Hard

Array, Breadth-First Search +1· 1 company

2617. Minimum Number of Visited Cells in a GridVideo

Solution24.1%Hard

Array, Breadth-First Search +6· 3 companies

2814. Minimum Time Takes to Reach Destination Without DrowningVideoPremium

Solution54.7%Hard

Array, Breadth-First Search +1

2858. Minimum Edge Reversals So Every Node Is ReachableVideo

Solution60.2%Hard

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

3123. Find Edges in Shortest PathsVideo

Solution47.0%Hard

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

3141. Maximum Hamming DistancesVideoPremium

Solution50.0%Hard

Array, Bit Manipulation +1

3203. Find Minimum Diameter After Merging Two TreesVideo

Solution57.1%Hard

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

3235. Check if the Rectangle Corner Is ReachableVideo

Solution24.4%Hard

Array, Breadth-First Search +4· 2 companies

3283. Maximum Number of Moves to Kill All PawnsVideo

Solution33.7%Hard

Array, Bit Manipulation +4· 1 company

3373. Maximize the Number of Target Nodes After Connecting Trees IIVideo

Solution72.5%Hard

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

3383. Minimum Runes to Add to Cast SpellPremium

Solution45.2%Hard

Array, Breadth-First Search +4· 1 company

3666. Minimum Operations to Equalize Binary StringVideo

Solution45.2%Hard

Breadth-First Search, Math +3· 4 companies

3710. Maximum Partition FactorVideo

–31.8%Hard

Array, Binary Search +4· 2 companies

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

Showing 51–71 of 71