Search In 2D Matrix ii ( LeetCode
Let's solve problem number 240 from Leetcode.
The questions read as-
Write an efficient algorithm to search a target value in a given mxn matrix. The matrix has the following properties:
Integers in each row are sorted in ascending order from left to right.
Integers in each column are sorted in ascending order from top to bottom.
So basically it is a searching problem in a 2D array or matrix.
One way to approach this program is a simple linear search algorithm in the 2D array where we'll check each and every element row by row and will search for the element.
This is a very complete and time-consuming algorithm.
Do you know since the matrix is sorted we can use the binary search algorithm as well?
Let's see how we can solve the search in a 2D array problem in java using an efficient algorithm.
For more information, fill out this form: https://forms.gle/8eiUmM92Fx563Aen9
or call us at 8884881203
Facebook: / thetapacademy
Instagram: / tapacademy_online
Linkedin: / 73820805
Website: https://www.thetapacademy.com
#java #array #2darray #matrixprogramming #programming #javaprogramming #dsa #placement #job #interview #dsacourse
