All Problems

314 problems total

Filter by Difficulty:

Tag:

Company:

Active filters:Tag: tree×
TitleDifficultyVideosCompanies
Best Position for a Service Centrehard-
Find a Value of a Mysterious Function Closest to Targethard-
Implement Hierarchical Locking System for Tree Structuresmedium-
Longest Special Pathhard-
Longest Special Path IIhard-
Maximum Number of Matching Indices After Right Shiftseasy-
Maximum Product of the Length of Two Palindromic Subsequencesmedium-
Minimum Possible Integer After at Most K Adjacent Swaps On Digitshard-
Range XOR Queries with Subarray Reversalshard-
Search Word in Root-to-Leaf Word Treeeasy-
Shortest Path in a Weighted Treehard-
Split Two Strings to Make Palindromemedium-
Subtree Inversion Sumhard-
Symmetric N-ary Tree Detectioneasy-
Binary Tree Inorder Traversaleasy-
Unique BSTs 2 - Generatemedium-
Unique BSTs 1 - Countmedium-
Validate Binary Search Treemedium
Recover Binary Search Treemedium-
Same Treeeasy
Symmetric Binary Treeeasy-
Binary Tree Level Order Traversal - Level by Levelmedium
Binary Tree Traversal - Zigzag Level Order Traversalmedium-
Maximum Depth of Binary Treeeasy
Construct Binary Tree from Inorder and Preorder Traversalmedium
Construct Binary Tree from Inorder and Postorder Traversalmedium-
Binary Tree Traversal - Level Order Bottom upmedium-
Convert Sorted Array to height-balanced Binary Search Treeeasy
Convert Sorted List into a height-balanced Binary search Treemedium-
Balanced Binary Treeeasy-
Minimum Depth of Binary Treeeasy-
Path Sum 1 - Check if root to leaf path existseasy-
Path Sum 2 - find all root to leaf pathsmedium-
Flatten binary tree to linked list in order of preorder traversalmedium-
Populate next pointer to right node in Perfect Binary Treemedium-
Populate next pointer to right node in Binary Treemedium-
Binary Tree Path Sum - Maximum between any two nodeshard
Sum Root to Leaf Numbersmedium-
Binary Tree Preorder Traversaleasy-
Binary Tree Postorder Traversaleasy-
Binary Tree Upside Downmedium-
Binary Search Tree BST Inorder Iteratormedium-
Binary Tree Right Side Viewmedium-
Count Complete Tree Nodeseasy-
Invert Binary Treeeasy
Kth Smallest Element in a BSTmedium
Lowest Common Ancestor of a Binary Search Treemedium
Lowest Common Ancestor of a Binary Treemedium
Count Univalue Subtreesmedium-
Verify Preorder Sequence in Binary Search Treemedium-
Showing 1 to 50 of 314 results