Tap here to switch tabs
Problem
Ask
Submissions

Problem: Flipping an Image

easy
15 min
Explore techniques to flip and invert an image represented by an n by n matrix of ones and zeros. Learn how to perform a horizontal flip and then invert the binary values using efficient bitwise manipulation. This lesson helps you understand the problem statement, develop a solution strategy, and implement it in a hands-on coding environment.

Statement

Given that an image is represented by an (n×n)(n \times n) matrix containing 00s and 11s, flip and invert the image, and return the resultant image.

Horizontally flipping an image means that the mirror image of the matrix should be returned. Flipping [1,0,0][1, 0, 0] horizontally results in [0,0,1][0, 0, 1].

Inverting an image means that every 00 is replaced by 11, and every 11 is replaced by 00. Inverting [0,1,1][0, 1, 1] results in [1,0,0][1, 0, 0].

Constraints:

  • Image should be a square matrix.
  • 1n201 \leq n \leq 20
  • images[i][j] is either 00 or 11.
Tap here to switch tabs
Problem
Ask
Submissions

Problem: Flipping an Image

easy
15 min
Explore techniques to flip and invert an image represented by an n by n matrix of ones and zeros. Learn how to perform a horizontal flip and then invert the binary values using efficient bitwise manipulation. This lesson helps you understand the problem statement, develop a solution strategy, and implement it in a hands-on coding environment.

Statement

Given that an image is represented by an (n×n)(n \times n) matrix containing 00s and 11s, flip and invert the image, and return the resultant image.

Horizontally flipping an image means that the mirror image of the matrix should be returned. Flipping [1,0,0][1, 0, 0] horizontally results in [0,0,1][0, 0, 1].

Inverting an image means that every 00 is replaced by 11, and every 11 is replaced by 00. Inverting [0,1,1][0, 1, 1] results in [1,0,0][1, 0, 0].

Constraints:

  • Image should be a square matrix.
  • 1n201 \leq n \leq 20
  • images[i][j] is either 00 or 11.