Back to Questions

Search a 2D Matrix

46.4K views•Asked at IBM•
Medium

Question Explain

Write an efficient algorithm that searches for a value in an $m \times n$ matrix. The matrix has sorted rows and the first integer of each row is greater than the last of the previous row. Use two Binary Searches.

Start Trying This Question Simulation

Practice answering orally or with text to get instant AI feedback.

Practice with This Question

Other interview questions like this

Two Sum

104.4K views

Longest Substring Without Repeating Characters

62.2K views

Median of Two Sorted Arrays

107.8K views
Search a 2D Matrix - Interview Question