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

Problems

91 problems

Has videoPremium onlyReset
Array578Dynamic Programming332String191Math187Binary Search136Hash Table134Sorting106Greedy104Bit Manipulation103Graph96Depth-First Search91Heap (Priority Queue)78Prefix Sum77Matrix75Breadth-First Search71All topics

Hard · 91 results

Sign in to see which of these you have solved.Sign in
TitleSolutionAcceptDifficultyTopics
2360. Longest Cycle in a GraphVideo
Solution51.1%Hard
Depth-First Search, Graph +1· 7 companies
2440. Create Components With Same ValueVideo
Solution54.0%Hard
Array, Depth-First Search +3· 1 company
2458. Height of Binary Tree After Subtree Removal QueriesVideo
Solution55.0%Hard
Array, Binary Tree +3· 3 companies
2479. Maximum XOR of Two Non-Overlapping SubtreesPremium
Solution51.3%Hard
Depth-First Search, Graph +2· 2 companies
2538. Difference Between Maximum and Minimum Price SumVideo
Solution34.5%Hard
Array, Depth-First Search +2· 2 companies
2581. Count Number of Possible Root NodesVideo
Solution49.3%Hard
Array, Depth-First Search +3
2646. Minimize the Total Price of the TripsVideo
Solution48.5%Hard
Array, Depth-First Search +3
2791. Count Paths That Can Form a Palindrome in a TreeVideo
Solution52.6%Hard
Bit Manipulation, Bitmask +3· 4 companies
2792. Count Nodes That Are Great EnoughVideoPremium
Solution57.1%Hard
Binary Tree, Depth-First Search +2
2858. Minimum Edge Reversals So Every Node Is ReachableVideo
Solution60.2%Hard
Breadth-First Search, Depth-First Search +2· 11 companies
2867. Count Valid Paths in a TreeVideo
Solution36.2%Hard
Depth-First Search, Dynamic Programming +3· 1 company
2872. Maximum Number of K-Divisible ComponentsVideo
Solution74.1%Hard
Depth-First Search, Tree· 4 companies
2920. Maximum Points After Collecting Coins From All NodesVideo
Solution36.6%Hard
Array, Bit Manipulation +3· 1 company
2973. Find Number of Coins to Place in Tree NodesVideo
Solution37.4%Hard
Depth-First Search, Dynamic Programming +3· 1 company
3123. Find Edges in Shortest PathsVideo
Solution47.0%Hard
Breadth-First Search, Depth-First Search +3· 2 companies
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
3241. Time Taken to Mark All NodesVideo
Solution29.5%Hard
Depth-First Search, Dynamic Programming +2
3313. Find the Last Marked Nodes in TreeVideoPremium
Solution57.1%Hard
Depth-First Search, Tree· 1 company
3327. Check if DFS Strings Are PalindromesVideo
Solution20.9%Hard
Array, Depth-First Search +4· 1 company
3367. Maximize Sum of Weights after Edge RemovalsVideo
Solution33.1%Hard
Depth-First Search, Dynamic Programming +2· 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
3385. Minimum Time to Break Locks IIPremium
Solution45.7%Hard
Array, Depth-First Search +1· 1 company
3425. Longest Special PathVideo
–23.2%Hard
Array, Depth-First Search +3
3486. Longest Special Path IIVideo
–19.8%Hard
Array, Depth-First Search +3· 1 company
3515. Shortest Path in a Weighted TreeVideo
–41.5%Hard
Array, Binary Indexed Tree +3· 1 company
3544. Subtree Inversion SumVideo
–41.6%Hard
Array, Depth-First Search +2
3553. Minimum Weighted Subgraph With the Required Paths IIVideo
–48.2%Hard
Array, Bit Manipulation +3
3559. Number of Ways to Assign Edge Weights IIVideo
Solution71.8%Hard
Array, Bit Manipulation +4· 3 companies
3562. Maximum Profit from Trading Stocks with DiscountsVideo
Solution56.1%Hard
Array, Depth-First Search +2· 2 companies
3575. Maximum Good Subtree ScoreVideo
–44.0%Hard
Array, Bit Manipulation +4· 1 company
3585. Find Weighted Median Node in TreeVideo
Solution26.7%Hard
Array, Binary Search +4· 1 company
3590. Kth Smallest Path XOR SumVideo
Solution30.1%Hard
Array, Depth-First Search +2
3710. Maximum Partition FactorVideo
–31.8%Hard
Array, Binary Search +4· 2 companies
3715. Sum of Perfect Square AncestorsVideo
–41.3%Hard
Array, Counting +5· 3 companies
3772. Maximum Subgraph Score in a TreeVideo
–65.4%Hard
Array, Depth-First Search +2· 1 company
3786. Total Sum of Interaction Cost in Tree GroupsVideo
–50.8%Hard
Array, Depth-First Search +1· 1 company
3812. Minimum Edge Toggles on a TreeVideo
Solution65.6%Hard
Depth-First Search, Graph +3
3910. Count Connected Subgraphs with Even Node SumVideo
Solution59.0%Hard
Array, Bit Manipulation +5
3939. Count Non Adjacent Subsets in a Rooted TreeVideo
–51.7%Hard
Array, Depth-First Search +2· 1 company
Showing 51–91 of 91