Draw pattern of alphabet like K.
Given an integer n, return the pattern as a list of strings. The pattern has 2n - 1 rows, uses letters from A onward, and contains each row's letter at the left edge and its matching diagonal position. Do not include trailing spaces. For n = 3, return ['A A', 'B B', 'C', 'B B', 'A A'].
Input: 1 <= n <= 26. Output: a list of strings.
def alphabet_k_pattern(n):