Available question text
Determine whether every row and every column of an n×n matrix contains all integers from 1 to n (i.e., each row/column is a permutation of 1..n). Values are in [1,n] and n ≤ 100, so this can be checked with simple per-row and per-column membership/count checks.
Related questions
Continue with questions that share topics or the same question type.
- The first was leetcode Set Matrix Zeroes.
The LeetCode problem Set Matrix Zeroes is a classic 2D array manipulation problem. The description is as follows:
You are given an
𝑚
×
𝑛
m×n matrix of integers. If any element is 0, you must set its entire row and column to 0. In other words, for each cell that contains 0, all cells in the same row and column should be changed to 0.
Coding
- Check If a String Contains All Binary Codes of Size K
Coding
- Remove All Ones With Row and Column Flips
Coding
- Remove All Ones With Row and Column Flips II
Coding
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 2133. Check if Every Row and Column Contains All Numbers
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source