Given an absolute file path (Unix style), simplify it by resolving redundant separators, directory names, and navigating back up the directory structure. Return the simplified canonical path.

Design a logger that prevents too many messages from being printed within a certain time window. The logger should only print a message if it hasn't been printed recently.

Find the maximum sum of any path in a binary tree, where a path can start and end at any node. The path must contain at least one node.