21 Search in Row wise And Column wise Sorted Array
SEARCH IN A ROW WISE AND COLUMN WISE SORTED MATRIX:
Given an n x n matrix and a number x, find the position of x in the matrix if it is present in it. Otherwise, print “Not Found”. In the given matrix, every row and column is sorted in increasing order. The designed algorithm should have linear time complexity.
Example :
Input : mat[4][4] = { {10, 20, 30, 40},
{15, 25, 35, 45},
{27, 29, 37, 48},
{32, 33, 39, 50}};
x = 29
Output : Found at (2, 1)
PROBLEM STATEMENT LINK:https://www.geeksforgeeks.org/search-in-row-wise-and-column-wise-sorted-matrix/
PLAYLIST LINK:https://www.youtube.com/playlist?list=PL_z_8CaSLPWeYfhtuKHj-9MpYb6XQJ_f2 .
------------------------------------------------------------------------------------------
Here are some of the gears that I use almost everyday:
🖊️ : My Pen (Used in videos too): https://amzn.to/38fKSM1
👨🏻💻 : My Apple Macbook pro: https://amzn.to/3w8iZh6
💻 : My gaming laptop: https://amzn.to/3yjcn23
📱 : My Ipad: https://amzn.to/39yEMGS
✏️ : My Apple Pencil: https://amzn.to/3kMnKYf
🎧 : My Headphones: https://amzn.to/3kMOzM7
💺 : My Chair: https://amzn.to/385weqR
🛋 : My Table: https://amzn.to/3kMohtd
⏰ : My Clock: https://amzn.to/3slFUV3
🙋🏻♀️ : My girlfriend: https://amzn.to/3M6zLDK ¯\_(ツ)_/¯
PS: While having good gears help you perform efficiently, don’t get under the impression that they will make you successful without any hard work.
Видео 21 Search in Row wise And Column wise Sorted Array канала Aditya Verma
Given an n x n matrix and a number x, find the position of x in the matrix if it is present in it. Otherwise, print “Not Found”. In the given matrix, every row and column is sorted in increasing order. The designed algorithm should have linear time complexity.
Example :
Input : mat[4][4] = { {10, 20, 30, 40},
{15, 25, 35, 45},
{27, 29, 37, 48},
{32, 33, 39, 50}};
x = 29
Output : Found at (2, 1)
PROBLEM STATEMENT LINK:https://www.geeksforgeeks.org/search-in-row-wise-and-column-wise-sorted-matrix/
PLAYLIST LINK:https://www.youtube.com/playlist?list=PL_z_8CaSLPWeYfhtuKHj-9MpYb6XQJ_f2 .
------------------------------------------------------------------------------------------
Here are some of the gears that I use almost everyday:
🖊️ : My Pen (Used in videos too): https://amzn.to/38fKSM1
👨🏻💻 : My Apple Macbook pro: https://amzn.to/3w8iZh6
💻 : My gaming laptop: https://amzn.to/3yjcn23
📱 : My Ipad: https://amzn.to/39yEMGS
✏️ : My Apple Pencil: https://amzn.to/3kMnKYf
🎧 : My Headphones: https://amzn.to/3kMOzM7
💺 : My Chair: https://amzn.to/385weqR
🛋 : My Table: https://amzn.to/3kMohtd
⏰ : My Clock: https://amzn.to/3slFUV3
🙋🏻♀️ : My girlfriend: https://amzn.to/3M6zLDK ¯\_(ツ)_/¯
PS: While having good gears help you perform efficiently, don’t get under the impression that they will make you successful without any hard work.
Видео 21 Search in Row wise And Column wise Sorted Array канала Aditya Verma
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
10 Largest number in K swaps Code and Time ComplexityFind all duplicate and missing numbers from 1 to n | Swap Sort Code5 Backtracking ProblemsRecursion is Everywhere !!14 Index of First 1 in a Binary Sorted Infinite Array6 Identification of Knapsack Problems and IntroductionPermutation with Case Change | Recursion17 Coin change problem Contd.9 Connect Ropes to Minimise the Cost25 Minimum Number of Insertion and Deletion to convert String a to String b2 Binary Search10 Sum of Elements between k1 smallest and k2 smallest numbers10 Minimum Element in Stack with Extra space29 Print shortest common Supersequence11 Ceil of an element in a Sorted Array1 Backtracking Course OverviewFace To Face Interview Interesting Algorithms19 Search An Element in Bitonic Array15 Minimum Difference Element in a Sorted Array6 Count of an Element in a Sorted Array11 Count the number of subset with a given difference