leetle

Daily challenge for 2026-05-20

505. Vertical String Concatenation

Given an array of strings words, return a single string formed by reading the characters vertically (column by column) from top to bottom, left to right. If a string does not have a character at a specific column, simply skip it and continue to the next word.

Example:
Input: words = ["a", "bc", "def"]
Output: "abdcef"
(Explanation: Column 0 has 'a', 'b', 'd'. Column 1 has 'c', 'e'. Column 2 has 'f'.)

Run this challenge interactively in Python or JavaScript when the app loads.