Find the length of the longest path in a binary tree where each node on the path has the same value. The path may or may not pass through the root.

You are given a collection of intervals. Merge all overlapping intervals into a single interval and return the result.

Find the number of paths in a binary tree that sum up to a given target value. The paths don't need to start from the root or end at a leaf, but must go downwards.