Easy 0 solved 0% acceptance

Mirror an Image

Flip a pixel grid left to right, like the mirror button in a photo app.

What you'll learn

  • Loop over the rows of a grid
  • Reverse a row in place or into a copy
  • Handle an empty grid

Problem

The mirror button in a photo app swaps the left and right sides of a picture. The first pixel of every row trades places with the last one, the second with the second to last, and so on. The order of the rows does not change.

Implement mirror_image(image).

Input

image: The picture as a list of rows of pixel values; every row has the same length.

Output

Return a new grid where each row is the original row in reverse order. An empty picture gives an empty list.

Constraints

0 ≤ rows, cols ≤ 100

0 ≤ pixel ≤ 255

Examples

Example 1
Input:
image = [
    [1, 2, 3],
    [4, 5, 6]
]

Expected output:
expected = [
    [3, 2, 1],
    [6, 5, 4]
]
Input:
std::vector<std::vector<long long>> image = {
    {1, 2, 3},
    {4, 5, 6}
};

Expected output:
std::vector<std::vector<long long>> expected = {
    {3, 2, 1},
    {6, 5, 4}
};
Input:
long[][] image = new long[][] {
    new long[] {1, 2, 3},
    new long[] {4, 5, 6}
};

Expected output:
long[][] expected = new long[][] {
    new long[] {3, 2, 1},
    new long[] {6, 5, 4}
};

Explanation

Each row is reversed on its own: [3, 2, 1] and [6, 5, 4].

Example 2
Input:
image = [
    [9, 0, 9, 0]
]

Expected output:
expected = [
    [0, 9, 0, 9]
]
Input:
std::vector<std::vector<long long>> image = {
    {9, 0, 9, 0}
};

Expected output:
std::vector<std::vector<long long>> expected = {
    {0, 9, 0, 9}
};
Input:
long[][] image = new long[][] {
    new long[] {9, 0, 9, 0}
};

Expected output:
long[][] expected = new long[][] {
    new long[] {0, 9, 0, 9}
};

Explanation

One row of four pixels reversed: [0, 9, 0, 9].

How to approach it

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

Hint 1

The rows stay in order; only the pixels inside each row move.

Hint 2

Pixel c trades places with pixel cols − 1 − c.

Hint 3

If you swap in place, stop at the middle of the row.

Expected complexity

O(rows × cols) time, O(rows × cols) 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.