Given a string with parentheses, determine the minimum number of parentheses you must remove to make the string valid. A valid string has balanced and properly nested parentheses.

Determine if a given abbreviation is valid for a given word. An abbreviation can contain digits representing the number of skipped characters.

Traverse a binary tree and return a list of node values for each vertical line, ordered from left to right. Nodes on the same vertical line should be ordered from top to bottom.