Complete the function that takes an array of words.

You must concatenate the `n`th letter from each word to construct a new word which should be returned as a string, where `n` is the position of the word in the list.

For example:

```
["yoda", "best", "has"]  -->  "yes"
  ^        ^        ^
  n=0     n=1     n=2
```

**Note:** Test cases contain valid input only - i.e. a string array or an empty array; and each word will have enough letters.

Source: codewars | Difficulty: EASY
Tags: String algorithms

Fundamentals

Data structures

Starter code: def nth_char(words):
	

Solutions:
def nth_char(words):
	return ''.join((w[i] for (i, w) in enumerate(words)))


def nth_char(words):
	return ''.join((word[i] for (i, word) in enumerate(words)))


def nth_char(words):
	result = ''
	for (index, word) in enumerate(words):
		result += word[index]
	return result


def nth_char(words):
	return ''.join((words[i][i] for i in range(len(words))))


def nth_char(words):
	return ''.join((words[n][n] for n in range(len(words))))


def nth_char(w):
	return ''.join((w[i][i] for i in range(len(w))))


def nth_char(words):
	return ''.join((v[i] for (i, v) in enumerate(words)))


nth_char = lambda l: ''.join((e[i] for (i, e) in enumerate(l)))


def nth_char(words):
	return ''.join((k[i] for (i, k) in enumerate(words)))


nth_char = lambda w: ''.join((x[i] for (i, x) in enumerate(w)))