Search a 2D Matrix in Java

Search a 2D Matrix is a good example of turning a small-looking problem into a precise invariant. The Java implementation below captures the core idea, so this post focuses on why the approach works, what it is really solving, and how to debug it when the first attempt goes wrong.

---

Problem 1: Search a 2D Matrix

Problem description: We are given a problem around Search a 2D Matrix and need a Java solution that is correct on both normal and edge-case inputs. The challenge is usually not writing a loop or recursion call; it is preserving the one invariant that makes the approach valid from start to finish.

What we are solving actually: We are solving for correctness under the constraints that matter for this problem family. In practice, that means understanding which state must be remembered, what can be derived on the fly, and where a brute-force approach would waste work or break boundary conditions.

What we are doing actually:

1. treat row and column boundaries as first-class correctness checks
2. visit or update only the cells allowed by the current invariant
3. use pointer or search-space narrowing and table-based state transitions to avoid uncontrolled repeated scanning
4. double-check index movement because most matrix bugs come from boundary drift

Why This Problem Matters

• matrix and grid problems punish sloppy boundary handling immediately
• these problems often combine traversal logic with in-place mutation or visited-state management
• search a 2d matrix is valuable because row and column movement must stay explicit

Implementation Context

This post is built around a Java implementation of the problem and keeps the solution shape close to the version I wanted to teach from. The goal is to preserve the underlying idea while making the reasoning easier to follow.

That keeps the article practical. Instead of presenting an overly polished answer detached from how these problems are usually solved, the explanation stays close to interview-style Java code and makes the invariants explicit.

Java Solution

/**
 * 74. Search a 2D Matrix
 * Write an efficient algorithm that searches for a value target in an m x n integer matrix. This matrix has the
 * following properties:
 * <p>
 * Integers in each row are sorted from left to right.
 * The first integer of each row is greater than the last integer of the previous row.
 * <p>
 * Example 1:
 * Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3
 * Output: true
 * <p>
 * Example 2:
 * Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13
 * Output: false
 */
public class Search2DMatrix {
	public boolean searchMatrix(int[][] matrix, int target) {
		int low = 0;

		int row = matrix.length;
		int col = matrix[0].length;

		int high = row * col - 1;

		while (low <= high) {
			int mid = low + (high - low) / 2;

			// an array convert to row * col matrix => a[x] =>matrix[x / col][x % col];
			if (matrix[mid / col][mid % col] == target) {
				return true;
			}

			if (matrix[mid / col][mid % col] < target) {
				low = mid + 1;
			} else {
				high = mid - 1;
			}
		}
		return false;
	}
}

Why This Solution Works

The implementation works because it keeps the critical state small and meaningful. Instead of trying to remember every past possibility, it keeps only the information needed for the next step, and that is exactly what makes the solution easier to reason about than a brute-force version.

Another good thing to notice is that the code is direct. The data structure and control flow match the problem shape closely, which is what you want in DSA code: fewer moving parts, cleaner invariants, and a faster path to debugging.

Dry Run

Dry-run Search a 2D Matrix on the smallest matrix that still exercises the boundary case you care about. Matrix problems often fail on the first or last row/column before they fail anywhere else.

If you can explain the dry run without hand-waving, the code usually stops feeling memorized and starts feeling mechanical. That is the point where interview pressure drops and implementation speed improves.

Edge Cases To Test

• one-row or one-column matrices
• in-place update side effects
• index movement at all four boundaries

These edge cases are worth testing before you trust the solution. Many DSA bugs do not come from the main idea; they come from assuming the input shape is always convenient.

Performance Notes

The implementation leans on pointer or search-space narrowing and table-based state transitions. When you review or optimize it, focus first on how many full passes it makes over the input and what extra state it keeps alive, because those two choices dominate both speed and memory use more than small syntax tweaks do.

Debug Steps

Debug steps:

• print row and column indices during movement
• test 1xN and Nx1 matrices
• check whether in-place updates corrupt later reads
• verify the stopping condition on boundary transitions

Key Takeaways

• Search a 2D Matrix becomes easier once the central invariant is stated in plain language.
• This solution is useful because the control flow stays close to the data structure or recursion contract it depends on.
• If the implementation fails, debug the state transition first, not the syntax.