Given a matrix that is organised such that the numbers will always be sorted from left to right and the first number of each row will always be greater than the last element of the last row (mat[i][0] > mat[i-1][-1], search for a specific value in the matrix and return whether it exists.
-
Notifications
You must be signed in to change notification settings - Fork 0
T-Kalv/Python-Searching-A-Matrix
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Python Searching A Matrix
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published