Zigzag Conversion

**Problem Statement:** Given the required input arguments, write an efficient algorithm to solve the **Zigzag Conversion** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge. **Hint / Expected Approach:** Simulate rows with direction flag **Edge Cases to Consider:** - (1) numRows = 1 - (2) numRows ≥ length - (3) Single character

Examples

Example 1

Input: "PAYPALISHIRING", 3

Output: "PAHNAPLSIIGYIR"

Explanation: Classic

Example 2

Input: "PAYPALISHIRING", 4

Output: "PINALSIGYAHRPI"

Example 3

Input: "A", 1

Output: "A"

Explanation: Single char

Constraints

▪1 <= s.length <= 10^4
▪s consists of printable ASCII characters
▪Solve with optimal space complexity

Watch Out For Edge Cases

▪numRows = 1
▪numRows ≥ length
▪Single character

Frequently Asked At

AmazonMicrosoftAdobeTCS

Back to Arena

medium

String