Your question is Print Diamond Pattern. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
Given a positive integer n, print a centered diamond pattern of height 2n - 1 using the * character. The widest row must contain 2n - 1 stars, and each row should be padded with spaces so the diamond is symmetric. Return the pattern as an array of strings, where each string represents one row.
def print_diamond(n):