All challenges
Medium 0 solved 0% acceptance

Zigzag Wave Pattern

Draw a zigzag line of stars that bounces between the top and bottom rows of a grid.

What you'll learn

  • Turn a repeating motion into a formula with mod
  • Fill a grid column by column
  • Trim trailing spaces and keep empty rows

Problem

Picture a grid with height rows and width columns, both numbered from 0. A line of stars starts in the top-left cell and moves one column right at every step, going one row down each time until it reaches the bottom row and then one row up each time until it reaches the top row, again and again. Exactly: let P = 2(height − 1) and p = c mod P. Column c has its only star in row p when p < height, and in row P − p otherwise. All other cells are spaces.

Implement zigzag_wave_pattern(width, height).

Input

width: The number of columns.

height: The number of rows.

Output

Return height strings from top to bottom with trailing spaces removed. A row that ends up with no star is an empty string.

Constraints

1 ≤ width ≤ 80, 2 ≤ height ≤ 20

Examples

Example 1
Input:
width = 9
height = 3

Expected output:
expected = ["*   *   *", " * * * *", "  *   *"]
Input:
long long width = 9;
long long height = 3;

Expected output:
std::vector<std::string> expected = {"*   *   *", " * * * *", "  *   *"};
Input:
long width = 9;
long height = 3;

Expected output:
string[] expected = new string[] {"*   *   *", " * * * *", "  *   *"};

Explanation

P = 4, so columns 0 to 8 use rows 0, 1, 2, 1, 0, 1, 2, 1, 0: ["* * *", " * * * *", " * *"].

Example 2
Input:
width = 5
height = 2

Expected output:
expected = ["* * *", " * *"]
Input:
long long width = 5;
long long height = 2;

Expected output:
std::vector<std::string> expected = {"* * *", " * *"};
Input:
long width = 5;
long height = 2;

Expected output:
string[] expected = new string[] {"* * *", " * *"};

Explanation

With two rows the star alternates top and bottom: ["* * *", " * *"].

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

The movement repeats every 2(height − 1) columns.

Hint 2

Inside one period the row goes down from 0 to height − 1 and back up.

Hint 3

It can be easier to fill a 2D grid of spaces first and then turn each row into a string.

Expected complexity

O(width * height) time, O(width * height) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.