Dataford
Interview QuestionsInterview GuidesExperiencesCoaching
New
Pricing
Get started
Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
Experiences
Practice
Mock InterviewsTimed interview simulations with feedbackCoaching1:1 coaching with people at your target companiesSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Build my plan
Search a 2D Matrix in LogN
00:00
5 left

Search a 2D Matrix in LogN

EasyPython

Problem

FourKites can represent shipment records in a matrix ordered by increasing tracking priority. Each row is sorted in nondecreasing order, and the first value in every row is greater than the last value in the previous row. Implement search_2d_matrix(matrix, target) to determine whether target exists.

Your algorithm must run in O(log(m × n)) time, where m is the number of rows and n is the number of columns. Treat the matrix as one sorted array without creating a flattened copy.

Formal Specification

  • Input: matrix, a rectangular list of lists containing integers, and target, an integer.
  • Output: Return True if target appears in the matrix; otherwise return False.
  • An empty matrix is valid and should return False.

Constraints

  • 0 <= m <= 1000
  • If m > 0, 1 <= n <= 1000
  • -10^9 <= matrix[i][j], target <= 10^9
  • Every row has exactly n elements
  • The first value of each row is greater than the last value of the previous row

Function Signature

def search_2d_matrix(matrix, target):
Interviewer

Your question is Search a 2D Matrix in LogN. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.
CodePython 3
Sign up free to run your codeLog inLn 2
Run your code to see test output here.