Freaks City

U-Shaped String Output Given a string of length N, display it in a U-shape formation. Let n1 represent the left vertical column, n3 represent the right vertical column, and n2 represent the bottom horizontal row. The constraint requires n1 = n3 = max { k | k <= n2 for all 3 <= n2 <= N } and n1 + n2 + n3 - 2 = N. For example, with input ...