250. Count Univalue Subtrees
110. Balanced Binary Tree
1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
Description
Given a binary tree where each path going from the root to any leaf form a valid sequence , check if a given string is a valid sequence in such binary tree.
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
Description
Given two binary trees original and cloned and given a reference to a node target in the original tree.
938. Range Sum of BST
897. Increasing Order Search Tree
897. Increasing Order Search Tree
Description
Given the root of a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only one right child.
3197. Find the Minimum Area to Cover All Ones II
3197. Find the Minimum Area to Cover All Ones II
Description
You are given a 2D binary array grid. You need to find 3 non-overlapping rectangles having non-zero areas with horizontal and vertical sides such that all the 1’s in grid lie inside these rectangles.
3196. Maximize Total Cost of Alternating Subarrays
3196. Maximize Total Cost of Alternating Subarrays
Description
You are given an integer array nums with length n.
3195. Find the Minimum Area to Cover All Ones I
3195. Find the Minimum Area to Cover All Ones I
Description
You are given a 2D binary array grid. Find a rectangle with horizontal and vertical sides with the smallest area, such that all the 1’s in grid lie inside this rectangle.