Algorithm

The extremely naive approach is to get the answer by checking all the elements of the given matrix. So, we will traverse the matrix and check every element if it is equal to the given ‘target’.

We will use a loop(say i) to select a particular row at a time.
Next, for every row, we will use another loop(say j) to traverse each column.
Inside the loops, we will check if the element i.e. matrix[i][j] is equal to the ‘target’. If we find any matching element, we will return true.
Otherwise, after completing the traversal, we will return false.

Code

#include <bits/stdc++.h>
using namespace std;

class Solution {
public:
    // Function to search for a target value in the matrix
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        // Get number of rows in the matrix
        int n = matrix.size();

        // Get number of columns in the matrix
        int m = matrix[0].size();

        // Traverse each row
        for (int i = 0; i < n; i++) {
            // Traverse each column in the current row
            for (int j = 0; j < m; j++) {
                // Check if the current element matches the target
                if (matrix[i][j] == target)
                    return true;
            }
        }

        // Return false if the target is not found
        return false;
    }
};

// Driver code
int m