Validate grid sorted

Last updated: July 26, 2025

Quick Overview

Given a 2D grid of integers, write a function to determine if each row and each column of the grid is sorted in non-decreasing order. The function should return a boolean value: true if the grid is sorted, and false otherwise. The input will be a 2D array, and the output will be a single boolean value.

Databricks
Coding & Algorithms
Software Engineer
Databricks
July 26, 2025
Software Engineer
Onsite
Coding & Algorithms
Hard

30

14

2,392 solved


Given a 2D grid of integers, write a function to determine if each row and each column of the grid is sorted in non-decreasing order. The function should return a boolean value: true if the grid is sorted, and false otherwise. The input will be a 2D array, and the output will be a single boolean value.

Coding interviews at Databricks 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
  • Quickly identify the optimal approach and its theoretical basis
  • Handle complex algorithm design with multiple interacting components
  • Write concise, elegant code under time pressure
  • Prove correctness of your approach and discuss alternative solutions
  • Optimize beyond the obvious: discuss constant factor improvements
  • Address follow-up variations and explain how the solution generalizes
Key Topics to Cover
Common algorithm patterns (sliding window, two pointers, BFS/DFS)
Hash maps and frequency counting
Time and space complexity analysis
Binary search and divide and conquer
Graph algorithms and traversal
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 you parallelize this solution?
  • How would you modify your solution to handle streaming input?
  • Can you optimize the space complexity of 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 grid is sorted in non-decreasing order, we can utilize a straightforward approach that involves checking pairs of adjacent elements in both rows and col...

Approach
  1. Iterate through each row of the grid. For each row, check if it is sorted:
    • For a row i, verify that grid[i][j] <= grid[i][j+1] for all valid j.
  2. Iterate through each column of the gri...

Submit Your Answer
Markdown supported

Related Questions