Print Words Vertically — LeetCode 1324 Python Solution

The problem

Given a string s. Return all the words vertically in the same order in which they appear in s.

Example

Input

s = "HOW ARE YOU"

Output

["HAY","ORO","WEU"]

Explanation

Each word is printed vertically.

Python solution

class Solution:
    def printVertically(self, s: str) -> List[str]:
        words = s.split()
        n = max(len(w) for w in words)
        ans = []
        for j in range(n):
            t = [w[j] if j < len(w) else ' ' for w in words]
            while t[-1] == ' ':
                t.pop()
            ans.append(''.join(t))
        return ans

Complexity

Pattern: Hash Map

Trade memory for time: remember what you have seen so the second pass never happens. LeetCode 1324. Print Words Vertically is filed here because the reference solution below belongs to the algorithm family this hub collects, even though its LeetCode tags point elsewhere.

The hash map guide has the Python template for the pattern and the 709 LeetCode problems that use it.

Related problems