Available question text
Given an n×n binary matrix, horizontally reverse each row and then invert every bit (0↔1), returning the transformed matrix. This can be done in-place by combining the row reversal and bit flip in a single pass (e.g., with a two-pointer swap and invert).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 832. Flipping an Image
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source