Code Challenges

Coding Challenges

Select a problem, write code, run test cases, and submit your solution.

Intermediate

Implement the `sumRootToLeafNumbers` method that returns the sum of all root-to-leaf numbers in a binary tree.

Intermediate

Implement the `countGoodNodesBinaryTree` method that counts good nodes in a binary tree.

Intermediate

Implement the `symmetricBinaryTreeCheck` method that checks whether a binary tree is a mirror of itself.

Intermediate

Implement the `balancedBinaryTreeCheck` method that checks whether a binary tree is height-balanced.

Learner

Implement the `serializeTreeNodeCount` method that returns the number of nodes represented during tree serialization.

Intermediate

Implement the `kthSmallestInBst` method that returns the kth smallest value from a binary search tree.

Intermediate

Implement the `pathSumExistsTree` method that checks whether any root-to-leaf path has the target sum.

Intermediate

Implement the `diameterOfBinaryTree` method that returns the diameter length of a binary tree.

Intermediate

Implement the `lowestCommonAncestorBst` method that returns the lowest common ancestor value in a binary search tree.

Intermediate

Implement the `validateBinarySearchTree` method that checks whether the given tree satisfies binary search tree rules.

Learner

Implement the `binaryTreeLevelOrderCount` method that counts values visited during level order traversal.

Learner

Implement the `invertBinaryTreeValues` method that returns binary tree values after inverting left and right children.

Learner

Code Challenges

Get better at coding with practice problems.

Coding Challenges

Implement the `sumRootToLeafNumbers` method that returns the sum of all root-to-leaf numbers in a binary tree.

Implement the `countGoodNodesBinaryTree` method that counts good nodes in a binary tree.

Implement the `symmetricBinaryTreeCheck` method that checks whether a binary tree is a mirror of itself.

Implement the `balancedBinaryTreeCheck` method that checks whether a binary tree is height-balanced.

Implement the `serializeTreeNodeCount` method that returns the number of nodes represented during tree serialization.

Implement the `kthSmallestInBst` method that returns the kth smallest value from a binary search tree.

Implement the `pathSumExistsTree` method that checks whether any root-to-leaf path has the target sum.

Implement the `diameterOfBinaryTree` method that returns the diameter length of a binary tree.

Implement the `lowestCommonAncestorBst` method that returns the lowest common ancestor value in a binary search tree.

Implement the `validateBinarySearchTree` method that checks whether the given tree satisfies binary search tree rules.

Implement the `binaryTreeLevelOrderCount` method that counts values visited during level order traversal.

Implement the `invertBinaryTreeValues` method that returns binary tree values after inverting left and right children.

Implement the `maximumDepthBinaryTree` method that returns the maximum depth of a binary tree.

Code Challenges

Get better at coding with practice problems.

Coding Challenges

Implement the sumRootToLeafNumbers method that returns the sum of all root-to-leaf numbers in a binary tree. Solved

Implement the countGoodNodesBinaryTree method that counts good nodes in a binary tree. Solved

Implement the symmetricBinaryTreeCheck method that checks whether a binary tree is a mirror of itself. Solved

Implement the balancedBinaryTreeCheck method that checks whether a binary tree is height-balanced. Solved

Implement the serializeTreeNodeCount method that returns the number of nodes represented during tree serialization. Solved

Implement the kthSmallestInBst method that returns the kth smallest value from a binary search tree. Solved

Implement the pathSumExistsTree method that checks whether any root-to-leaf path has the target sum. Solved

Implement the diameterOfBinaryTree method that returns the diameter length of a binary tree. Solved

Implement the lowestCommonAncestorBst method that returns the lowest common ancestor value in a binary search tree. Solved

Implement the validateBinarySearchTree method that checks whether the given tree satisfies binary search tree rules. Solved

Implement the binaryTreeLevelOrderCount method that counts values visited during level order traversal. Solved

Implement the invertBinaryTreeValues method that returns binary tree values after inverting left and right children. Solved

Implement the maximumDepthBinaryTree method that returns the maximum depth of a binary tree. Solved

Implement the `sumRootToLeafNumbers` method that returns the sum of all root-to-leaf numbers in a binary tree.

Implement the `countGoodNodesBinaryTree` method that counts good nodes in a binary tree.

Implement the `symmetricBinaryTreeCheck` method that checks whether a binary tree is a mirror of itself.

Implement the `balancedBinaryTreeCheck` method that checks whether a binary tree is height-balanced.

Implement the `serializeTreeNodeCount` method that returns the number of nodes represented during tree serialization.

Implement the `kthSmallestInBst` method that returns the kth smallest value from a binary search tree.

Implement the `pathSumExistsTree` method that checks whether any root-to-leaf path has the target sum.

Implement the `diameterOfBinaryTree` method that returns the diameter length of a binary tree.

Implement the `lowestCommonAncestorBst` method that returns the lowest common ancestor value in a binary search tree.

Implement the `validateBinarySearchTree` method that checks whether the given tree satisfies binary search tree rules.

Implement the `binaryTreeLevelOrderCount` method that counts values visited during level order traversal.

Implement the `invertBinaryTreeValues` method that returns binary tree values after inverting left and right children.

Implement the `maximumDepthBinaryTree` method that returns the maximum depth of a binary tree.