ProgramGuru

DSA Visualizations /

Overview of TechniquesOverview of Techniques14
❯

  1. 1Overview of DSA Problem Solving Techniques
  2. 2Brute Force Technique in DSA
  3. 3Greedy Algorithm Technique in DSA
  4. 4Divide and Conquer Technique in DSA
  5. 5Dynamic Programming Technique in DSA
  6. 6Backtracking Technique in DSA
  7. 7Recursion Technique in DSA
  8. 8Sliding Window Technique in DSA
  9. 9Two Pointers Technique
  10. 10Binary Search Technique
  11. 11Tree / Graph Traversal Technique in DSA
  12. 12Bit Manipulation Technique in DSA
  13. 13Hashing Technique
  14. 14Heaps Technique in DSA

SortingSorting10
❯

  1. 1Bubble Sort
  2. 2Selection Sort
  3. 3Insertion Sort
  4. 4Merge Sort
  5. 5Quick Sort
  6. 6Heap Sort
  7. 7Radix Sort
  8. 8Counting Sort
  9. 9Bucket Sort
  10. 10Shell Sort

ArraysArrays32
❯

  1. 1Find Maximum and Minimum in Array using Loop
  2. 2Find Second Largest in Array
  3. 3Find Second Smallest in Array
  4. 4Reverse Array using Two Pointers
  5. 5Check if Array is Sorted
  6. 6Remove Duplicates from Sorted Array
  7. 7Left Rotate an Array by One Place
  8. 8Left Rotate an Array by K Places
  9. 9Move Zeroes in Array to End
  10. 10Linear Search in Array
  11. 11Union of Two Arrays
  12. 12Find Missing Number in Array
  13. 13Max Consecutive Ones in Array
  14. 14Find Kth Smallest Element
  15. 15Longest Subarray with Given Sum (Positives)
  16. 16Longest Subarray with Given Sum (Positives and Negatives)
  17. 17Find Majority Element in Array (more than n/2 times)
  18. 18Find Majority Element in Array (more than n/3 times)
  19. 19Maximum Subarray Sum using Kadane's Algorithm
  20. 20Print Subarray with Maximum Sum
  21. 21Stock Buy and Sell
  22. 22Rearrange Array Alternating Positive and Negative Elements
  23. 23Next Permutation of Array
  24. 24Leaders in an Array
  25. 25Longest Consecutive Sequence in Array
  26. 26Count Subarrays with Given Sum
  27. 27Sort an Array of 0s, 1s, and 2s
  28. 28Two Sum Problem
  29. 29Three Sum Problem
  30. 304 Sum Problem
  31. 31Find Length of Largest Subarray with 0 Sum
  32. 32Find Maximum Product Subarray

Arrays - Binary SearchArrays - Binary Search28
❯

  1. 1Binary Search in Array<br><span class="highlight">Using Iteration</span>
  2. 2Find Lower Bound in Sorted Array
  3. 3Find Upper Bound in Sorted Array
  4. 4Search Insert Position in Sorted Array (Lower Bound Approach)
  5. 5Floor and Ceil in Sorted Array
  6. 6First Occurrence in a Sorted Array
  7. 7Last Occurrence in a Sorted Array
  8. 8Count Occurrences in Sorted Array
  9. 9Search Element in a Rotated Sorted Array
  10. 10Search in Rotated Sorted Array with Duplicates
  11. 11Minimum in Rotated Sorted Array
  12. 12Find Rotation Count in Sorted Array
  13. 13Search Single Element in Sorted Array
  14. 14Find Peak Element in Array
  15. 15Square Root using Binary Search
  16. 16Nth Root of a Number using Binary Search
  17. 17Koko Eating Bananas
  18. 18Minimum Days to Make M Bouquets
  19. 19Find the Smallest Divisor Given a Threshold
  20. 20Capacity to Ship Packages within D Days
  21. 21Kth Missing Positive Number
  22. 22Aggressive Cows Problem
  23. 23Allocate Minimum Number of Pages
  24. 24Split Array - Minimize Largest Sum
  25. 25Painter's Partition Problem
  26. 26Minimize Maximum Distance Between Gas Stations
  27. 27Median of Two Sorted Arrays of Different Sizes
  28. 28K-th Element of Two Sorted Arrays

StringsStrings2
❯

  1. 1Remove Outermost Parentheses in String
  2. 2Edit Distance Problem

MatrixMatrix3
❯

  1. 1Set Matrix Zeroes
  2. 2Rotate Matrix by 90 Degrees Clockwise
  3. 3Print Matrix in Spiral Manner

Matrix - Binary SearchMatrix - Binary Search5
❯

  1. 1Row with Maximum Number of 1's
  2. 2Search in a Sorted 2D Matrix
  3. 3Search in Row and Column-wise Sorted Matrix
  4. 4Find Target in 2D Matrix
  5. 5Matrix Median

Binary TreesBinary Trees36
❯

  1. 1Preorder Traversal of a Binary Tree using Recursion
  2. 2Preorder Traversal of a Binary Tree using Iteration
  3. 3Postorder Traversal of a Binary Tree Using Recursion
  4. 4Postorder Traversal of a Binary Tree using Iteration
  5. 5Level Order Traversal of a Binary Tree using Recursion
  6. 6Level Order Traversal of a Binary Tree using Iteration
  7. 7Reverse Level Order Traversal of a Binary Tree using Iteration
  8. 8Reverse Level Order Traversal of a Binary Tree using Recursion
  9. 9Find Height of a Binary Tree
  10. 10Find Diameter of a Binary Tree
  11. 11Find Mirror of a Binary Tree - Todo
  12. 12Inorder Traversal of a Binary Tree using Recursion
  13. 13Inorder Traversal of a Binary Tree using Iteration
  14. 14Left View of a Binary Tree
  15. 15Right View of a Binary Tree
  16. 16Top View of a Binary Tree
  17. 17Bottom View of a Binary Tree
  18. 18Zigzag Traversal of a Binary Tree
  19. 19Check if a Binary Tree is Balanced
  20. 20Diagonal Traversal of a Binary Tree
  21. 21Boundary Traversal of a Binary Tree
  22. 22Construct a Binary Tree from a String with Bracket Representation
  23. 23Convert a Binary Tree into a Doubly Linked List
  24. 24Convert a Binary Tree into a Sum Tree
  25. 25Find Minimum Swaps Required to Convert a Binary Tree into a BST
  26. 26Check if a Binary Tree is a Sum Tree
  27. 27Check if All Leaf Nodes are at the Same Level in a Binary Tree
  28. 28Lowest Common Ancestor (LCA) in a Binary Tree
  29. 29Solve the Tree Isomorphism Problem
  30. 30Check if a Binary Tree Contains Duplicate Subtrees of Size 2 or More
  31. 31Check if Two Binary Trees are Mirror Images
  32. 32Calculate the Sum of Nodes on the Longest Path from Root to Leaf in a Binary Tree
  33. 33Print All Paths in a Binary Tree with a Given Sum
  34. 34Find the Distance Between Two Nodes in a Binary Tree
  35. 35Find the kth Ancestor of a Node in a Binary Tree
  36. 36Find All Duplicate Subtrees in a Binary Tree

Binary Search TreesBinary Search Trees14
❯

  1. 1Find a Value in a Binary Search Tree
  2. 2Delete a Node in a Binary Search Tree
  3. 3Find the Minimum Value in a Binary Search Tree
  4. 4Find the Maximum Value in a Binary Search Tree
  5. 5Find the Inorder Successor in a Binary Search Tree
  6. 6Find the Inorder Predecessor in a Binary Search Tree
  7. 7Check if a Binary Tree is a Binary Search Tree
  8. 8Find the Lowest Common Ancestor of Two Nodes in a Binary Search Tree
  9. 9Convert a Binary Tree into a Binary Search Tree
  10. 10Balance a Binary Search Tree
  11. 11Merge Two Binary Search Trees
  12. 12Find the kth Largest Element in a Binary Search Tree
  13. 13Find the kth Smallest Element in a Binary Search Tree
  14. 14Flatten a Binary Search Tree into a Sorted List

Search in Row and Column-wise Sorted Matrix
Optimal Approach using Binary Search

Topic Contents

ProblemExamplesSolutionCodeTime ComplexitySpace Complexity

Problem Statement

You are given a 2D matrix where each row and each column is sorted in non-decreasing order. Your task is to search for a given target value in this matrix.

You need to determine whether the target value exists in the matrix or not. Return true if it exists, else return false.

The matrix is not fully sorted overall, but it has a special property:

This property allows us to use an efficient search technique rather than scanning every element.

Examples❯

MatrixTargetFoundDescription
[[1, 4, 7],
[2, 5, 8],
[3, 6, 9]]		5true5 is present in the middle of the matrix
[[10, 20, 30],
[15, 25, 35],
[27, 29, 37]]		29true29 is present in the last row
[[1, 2, 3],
[4, 5, 6],
[7, 8, 9]]		10false10 is greater than all elements in the matrix
[[1, 2, 3],
[4, 5, 6],
[7, 8, 9]]		0false0 is smaller than all elements in the matrix
[[5]]5trueSingle element match
[[5]]3falseSingle element does not match
[]1falseEmpty matrix has no elements

Solution❯

To solve this problem efficiently, we take advantage of the matrix's structure—each row and each column is sorted in non-decreasing order.

Understanding the Matrix Structure

Since rows are sorted left-to-right and columns are sorted top-to-bottom, this gives us a clever way to eliminate entire rows or columns at each step. We don’t need to check every cell.

Where to Start?

We begin our search at the top-right corner of the matrix. Why? Because:

  • The element at the top-right is the largest in its row and the smallest in its column.
  • This allows us to move left if the current element is too large or down if the current element is too small.

Step-by-Step Explanation

We set our starting position to row = 0 and col = number_of_columns - 1. Then we enter a loop that continues until either:

  • We find the target (return true), or
  • We move out of bounds (return false)

At each step:

  • If the current element equals the target, we’re done!
  • If the current element is greater than the target, we move left (since all elements to the left are smaller).
  • If the current element is less than the target, we move down (since all elements below are larger).

Handling Edge Cases

  • Empty Matrix: If the matrix has no rows or columns, we return false immediately.
  • Single Element Matrix: If it matches the target, return true. Otherwise, false.
  • Target smaller than all elements: We’ll keep moving left until we exit the matrix.
  • Target greater than all elements: We’ll keep moving down until we exit the matrix.

Why This Works

This approach ensures we only visit at most rows + columns elements in the worst case. So even if the matrix is large, this method stays efficient. The time complexity is O(N + M), where N = number of rows and M = number of columns.

Algorithm Steps

  1. Start at the top-right corner of the matrix, i.e., row = 0, col = M - 1.
  2. While row < N and col ≥ 0:
  3. → If mat[row][col] == target, return true.
  4. → If mat[row][col] > target, move left by doing col--.
  5. → If mat[row][col] < target, move down by doing row++.
  6. If the loop ends without finding the target, return false.

Code

Java
Python
JavaScript
C
C++
C#
Kotlin
Swift
Go
Php
public class MatrixSearch {
  public static boolean searchMatrix(int[][] mat, int target) {
    int n = mat.length;
    int m = mat[0].length;
    int row = 0, col = m - 1;

    while (row < n && col >= 0) {
      if (mat[row][col] == target) {
        return true;
      } else if (mat[row][col] > target) {
        col--; // Move left
      } else {
        row++; // Move down
      }
    }
    return false;
  }

  public static void main(String[] args) {
    int[][] mat = {
      {1, 4, 7},
      {2, 5, 8},
      {3, 6, 9}
    };
    int target = 5;
    System.out.println("Element found: " + searchMatrix(mat, target));
  }
}

Time Complexity

CaseTime ComplexityExplanation
Best CaseO(1)When the target is found at the starting cell (top-right corner).
Average CaseO(N + M)In each step, we either eliminate a row or a column, leading to at most N + M steps.
Average CaseO(N + M)In the worst case, the search visits one full row and one full column without finding the target.

Space Complexity

O(1)

Explanation: Only a few extra variables are used for row and column tracking, with no additional memory.

Welcome to ProgramGuru

Sign up to start your journey with us

Support ProgramGuru.org

Mention your name, and programguru.org in the message. Your name shall be displayed in the sponsers list.

PayPal

UPI

PhonePe QR

MALLIKARJUNA M