Validate matrix sorted

Last updated: October 13, 2025

Quick Overview

Given a 2D matrix, write a function to determine if each row and each column is sorted in ascending order. The function should return true if the matrix is sorted as specified, and false otherwise. The input will be a matrix of integers, and the output will be a boolean value.

Compass
Coding & Algorithms
Software Engineer
Compass
October 13, 2025
Software Engineer
Onsite
Coding & Algorithms
Medium

10

3

4,422 solved


Given a 2D matrix, write a function to determine if each row and each column is sorted in ascending order. The function should return true if the matrix is sorted as specified, and false otherwise. The input will be a matrix of integers, and the output will be a boolean value.

Coding interviews at Compass focus on problem-solving approach as much as the final solution. The interviewer wants to see you break down the problem, consider edge cases, and optimize iteratively. Communication throughout the process is key.

What the Interviewer Expects
  • Recognize the underlying problem pattern (sliding window, two pointers, BFS/DFS, etc.)
  • Discuss multiple approaches and trade-offs before coding
  • Implement an optimal solution with clean, production-quality code
  • Handle all edge cases including boundary conditions and invalid input
  • Optimize both time and space complexity with clear justification
  • Test your solution systematically with well-chosen examples
Key Topics to Cover
Dynamic programming and memoization
Common algorithm patterns (sliding window, two pointers, BFS/DFS)
Edge cases and input validation
Graph algorithms and traversal
Binary search and divide and conquer
Tree structures and recursion
How to Approach This
  1. Clarify input constraints and edge cases before writing code.
  2. Walk through your approach verbally and confirm with the interviewer before coding.
  3. Start with a brute force solution, then optimize. Mention time and space complexity.
  4. Test your solution with examples, including edge cases like empty input or duplicates.
  5. Consider common patterns: sliding window, two pointers, hash map, BFS/DFS, dynamic programming.
Possible Follow-up Questions
  • How would your solution change if the input was sorted?
  • Can you optimize the space complexity of your solution?
  • What is the worst-case input for your solution?
Sharpen Your Skills on Codemia

Practice similar problems with our interactive workspace, get AI feedback, and track your progress.

Practice DSA Problems
Sample Answer
Problem Analysis

To determine if each row and each column of the matrix is sorted in ascending order, we can utilize a simple linear scan approach. The problem can be analyzed using a two-pointer strategy, where we ch...

Approach
  1. Iterate through each row: For each row in the matrix, compare each element with its next neighbor. If any element is greater than the next, the row is not sorted, and we can return false.

  2. *...


Submit Your Answer
Markdown supported

Related Questions