1324. Print Words Vertically

Given a string s. Return all the words vertically in the same order in which they appear in s.
Words are returned as a list of strings, complete with spaces when is necessary. (Trailing spaces are not allowed).
Each word would be put on only one column and that in one column there will be only one word.


Example 1:

Input: s = "HOW ARE YOU"
Output: ["HAY","ORO","WEU"]
Explanation: Each word is printed vertically. 

Example 2:

Input: s = "TO BE OR NOT TO BE"
Output: ["TBONTB","OEROOE","   T"]
Explanation: Trailing spaces is not allowed. 
"   T"

Example 3:

Output: ["CIC","OSO","N M","T I","E N","S G","T"]



  • 1 <= s.length <= 200
  • s contains only upper case English letters.
  • It's guaranteed that there is only one space between 2 words.

1324. Print Words Vertically
struct Solution;

impl Solution {
    fn print_vertically(s: String) -> Vec<String> {
        let v: Vec<&str> = s.split_whitespace().collect();
        let mut res = vec![];
        for (j, s) in v.iter().enumerate() {
            for (i, c) in s.char_indices() {
                if i == res.len() {
                while res[i].len() < j {
                    res[i].push(' ');
fn test() {
    let s = "HOW ARE YOU".to_string();
    let res = vec_string!["HAY", "ORO", "WEU"];
    assert_eq!(Solution::print_vertically(s), res);
    let s = "TO BE OR NOT TO BE".to_string();
    let res = vec_string!["TBONTB", "OEROOE", "   T"];
    assert_eq!(Solution::print_vertically(s), res);
    let s = "CONTEST IS COMING".to_string();
    let res = vec_string!["CIC", "OSO", "N M", "T I", "E N", "S G", "T"];
    assert_eq!(Solution::print_vertically(s), res);