terminal
Elevo
/
ESC
Login
Initiate Registration
code
Topics
corporate_fare
Companies
history
History
arrow_back
Back to Challenges
#240
Search a 2D Matrix II
Medium
Acceptance 0%
Editorial
description
Problem Description
Write an efficient algorithm that searches for a value `target` in an `m x n` integer matrix. Integers in each row are sorted in ascending from left to right. Integers in each column are sorted in ascending from top to bottom.
checklist
Constraints
See problem description for detailed constraints.
science
Examples
Case #1
In:
# See problem description for input format
Out:
# Expected output
Mastery Tags
Arrays
Binary Search
Matrix
Hiring Companies
Goldman Sachs
Netflix
code
Integrated IDE
Python 3
expand_more
C
C++ 17
Java
JavaScript
Python 3
C
C++ 17
Java
JavaScript
Python 3
refresh
class Solution: def searchA2dMatrixIi(self, *args): # Write your solution here pass
Login to Compile
Processing
terminal
Debug Output
home
Home
extension
Practice
robot_2
login
Sign In
account_circle
Menu
code_blocks
Coding
psychology
Aptitude
Navigation
close
Login
Registration