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

Problems

66 problems

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

Hard · 66 results

Sign in to see which of these you have solved.Sign in
TitleSolutionAcceptDifficultyTopics
124. Binary Tree Maximum Path SumVideo
Solution42.7%Hard
Binary Tree, Depth-First Search +2· 25 companies
272. Closest Binary Search Tree Value IIVideoPremium
Solution61.1%Hard
Binary Search Tree, Binary Tree +5· 3 companies
297. Serialize and Deserialize Binary TreeVideo
Solution61.1%Hard
Binary Tree, Breadth-First Search +4· 23 companies
428. Serialize and Deserialize N-ary TreeVideoPremium
Solution68.7%Hard
Breadth-First Search, Depth-First Search +2· 7 companies
431. Encode N-ary Tree to Binary TreeVideoPremium
Solution80.6%Hard
Binary Tree, Breadth-First Search +3
834. Sum of Distances in TreeVideo
Solution65.8%Hard
Depth-First Search, Dynamic Programming +2· 5 companies
968. Binary Tree CamerasVideo
Solution48.3%Hard
Binary Tree, Depth-First Search +2· 14 companies
987. Vertical Order Traversal of a Binary TreeVideo
Solution54.6%Hard
Binary Tree, Breadth-First Search +4· 15 companies
1028. Recover a Tree From Preorder TraversalVideo
Solution83.2%Hard
Binary Tree, Depth-First Search +2· 6 companies
1373. Maximum Sum BST in Binary TreeVideo
Solution48.9%Hard
Binary Search Tree, Binary Tree +3· 5 companies
1377. Frog Position After T SecondsVideo
Solution38.8%Hard
Breadth-First Search, Depth-First Search +2· 2 companies
1483. Kth Ancestor of a Tree NodeVideo
Solution39.7%Hard
Binary Search, Breadth-First Search +4· 3 companies
1516. Move Sub-Tree of N-Ary TreeVideoPremium
–59.7%Hard
Depth-First Search, Tree· 1 company
1569. Number of Ways to Reorder Array to Get Same BSTVideo
Solution65.8%Hard
Array, Binary Search Tree +8· 2 companies
1597. Build Binary Expression Tree From Infix ExpressionVideoPremium
–62.5%Hard
Binary Tree, Stack +2· 1 company
1617. Count Subtrees With Max Distance Between CitiesVideo
Solution67.4%Hard
Bit Manipulation, Bitmask +3
1719. Number Of Ways To Reconstruct A TreeVideo
Solution46.3%Hard
Graph, Tree· 1 company
1766. Tree of CoprimesVideo
Solution45.1%Hard
Array, Depth-First Search +3· 1 company
1916. Count Ways to Build Rooms in an Ant ColonyVideo
Solution52.4%Hard
Combinatorics, Dynamic Programming +4· 1 company
1932. Merge BSTs to Create Single BSTVideo
Solution40.3%Hard
Binary Search, Binary Tree +3· 3 companies
2003. Smallest Missing Genetic Value in Each SubtreeVideo
Solution48.4%Hard
Depth-First Search, Dynamic Programming +2
2005. Subtree Removal Game with Fibonacci TreeVideoPremium
–54.9%Hard
Binary Tree, Dynamic Programming +3· 1 company
2246. Longest Path With Different Adjacent CharactersVideo
Solution54.2%Hard
Array, Depth-First Search +4· 5 companies
2277. Closest Node to Path in TreeVideoPremium
–62.1%Hard
Array, Breadth-First Search +2· 1 company
2313. Minimum Flips in Binary Tree to Get ResultVideoPremium
Solution56.9%Hard
Binary Tree, Depth-First Search +2· 1 company
2322. Minimum Score After Removals on a TreeVideo
Solution76.2%Hard
Array, Bit Manipulation +2· 4 companies
2421. Number of Good PathsVideo
Solution56.7%Hard
Array, Graph +4· 3 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
2509. Cycle Length Queries in a TreeVideo
Solution60.9%Hard
Array, Binary Tree +1· 1 company
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
2603. Collect Coins in a TreeVideo
Solution40.2%Hard
Array, Graph +2· 13 companies
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
2846. Minimum Edge Weight Equilibrium Queries in a TreeVideo
Solution46.7%Hard
Array, Graph +2· 1 company
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
3068. Find the Maximum Sum of Node ValuesVideo
Solution69.5%Hard
Array, Bit Manipulation +4· 4 companies
3203. Find Minimum Diameter After Merging Two TreesVideo
Solution57.1%Hard
Breadth-First Search, Depth-First Search +2· 4 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
3425. Longest Special PathVideo
–23.2%Hard
Array, Depth-First Search +3
Showing 1–50 of 66