Calculate the tilt of each node in a binary tree, where the tilt is the absolute difference between the sum of left subtree node values and the sum of right subtree node values. Return the total tilt of the entire tree.

You are given a list of match results. Determine which players have lost zero games and which players have lost only one game.

Given an array of numbers, find the minimum cost to split it into one or more subarrays. The cost of a split is a fixed value plus the sum of lengths of all subarrays that are not "important".