Table of Contents:

The Problem Introduction (Variant 1) 0:00 - 1:51

Jumping To The Brute Force 1:51 - 2:52

Optimizing Our Search 2:52 - 4:14

We Need To Notice Something... 4:14 - 5:49

The Data Does Not Dictate How We Interpret It 5:49 - 7:28

Establishing Our Mapping System 7:28 - 11:03

Executing The Binary Search 11:03 - 15:10

Runtime of Our Binary Search 15:10 - 15:45

The Problem Introduction (Variant 2) 15:45 - 16:43

Jumping To The Brute Force 16:43 - 17:15

The #1 Key To Search Problems 17:15 - 19:08

Defining Our Fundamental Decision Operation 19:08 - 20:57

Searching For Places To Start Our Search 20:57 - 22:48

Search Example #1 (Bottom Left Starting Point) 22:48 - 24:37

Search Example #2 (Top Right Starting Point) 24:37 - 25:38

What Just Happened 25:38 - 26:19

Analyzing Our Incremental Approach 26:19 - 28:34

Wrap Up 28:34 - 29:11

Code: https://github.com/bephrem1/backtobackswe/blob/master/Sorting%2C%20Searching%2C%20%26%20Heaps/SearchA2DMatrix/SearchA2DMatrix.java

Elements of Programming Interviews: 12.6

Version 1 On Leetcode: https://leetcode.com/problems/search-a-2d-matrix

Version 2 On Leetcode: https://leetcode.com/problems/search-a-2d-matrix-ii

Version 1 On GeeksForGeeks: https://www.geeksforgeeks.org/search-element-sorted-matrix

Version 2 On GeeksForGeeks: https://www.geeksforgeeks.org/search-in-row-wise-and-column-wise-sorted-matrix