Requirements:

• Take a single word input on stdin with only lowercase alphabetical characters (a-z)
• Output a string where every other character is repeated, with the first repeated character being the second character in the string

Example:

Input: abcde

Output: abbcdde

Winning Criteria:
Standard code golf. Shortest number of bytes in program wins.

Clarification:
For languages with 1-based indexing the output must still match the above, aabccdee is not an acceptable solution.

Requirements:

• Take a single word as input with only lowercase alphabetical characters (a-z)
• Output a string where every other character is repeated, with the first repeated character being the second character in the string

Example:

Input: abcde

Output: abbcdde

Winning Criteria:
Standard code golf. Shortest number of bytes in program wins.

Clarification:
For languages with 1-based indexing the output must still match the above, aabccdee is not an acceptable solution.

Requirements:

• Take a single word input on stdin with only lowercase alphabetical characters (a-z)
• Output a string where every other character is repeated, with the first repeated character being the second character in the string

Example:

Input: abcde

Output: abbcdde

Winning Criteria: Standard code golf. Shortest number of bytes in program wins.

Requirements:

• Take a single word input on stdin with only lowercase alphabetical characters (a-z)
• Output a string where every other character is repeated, with the first repeated character being the second character in the string

Example:

Input: abcde

Output: abbcdde

Winning Criteria:
Standard code golf. Shortest number of bytes in program wins.

Clarification:
For languages with 1-based indexing the output must still match the above, aabccdee is not an acceptable solution.

Requirements:

• Take a single word input on stdin with only lowercase alphabetical characters (a-z)
• Output a string where every odd index character (starting from 0 as first character) is repeated once

Example:

Input: abcde

Output: abbcdde

Winning Criteria: Standard code golf. Shortest number of bytes in program wins.

Requirements:

• Take a single word input on stdin with only lowercase alphabetical characters (a-z)
• Output a string where every other character is repeated, with the first repeated character being the second character in the string

Example:

Input: abcde

Output: abbcdde

Winning Criteria: Standard code golf. Shortest number of bytes in program wins.