Given a 2-D matrix of single-character strings, traverse it in a "diagonal zig-zag to the right" pattern and return the collected characters as a string.
Traversal rules (starting at the top-left corner):
row + 1, col + 1
).row − 1, col + 1
).The characters visited in order form the decoded message.
If no characters are collected (e.g. empty matrix), return an empty string.
Input matrix
I B C A L K A D R F C A E A G H O E L A D
Traversal path: I → R → O → C → L → E → D
Output string: IROCLED
I B C A L K A
D R F C A E A
G H O E L A D