✅💯🔥Simple Code🚀📌|| 🔥✔️Easy to understand🎯 || 🎓🧠Beats 100%🔥|| Beginner friendly💀💯
\n\n# Code\n\nclass Solution {\n    public boolean searchMatrix(int[][] matrix, int target) {\n        // int m = matrix.length; int n = matrix[0].length;\n    
\n\n# Code\n```\nclass Solution {\n    public boolean searchMatrix(int[][] matrix, int target) {\n        // int m = matrix.length; int n = matrix[0].length;\n        int i=0; int j=matrix[0].length-1;\n        while(i<matrix.length && j>=0){\n            if(matrix[i][j]==target){\n                return true;\n            }else if(matrix[i][j]>target){\n                j--;\n            }else{\n                i++;\n            }\n        }\n        return false;\n    }\n}\n```\n![7be995b4-0cf4-4fa3-b48b-8086738ea4ba_1699897744.9062278.jpeg](https://assets.leetcode.com/users/images/fe5117c9-43b1-4ec8-8979-20c4c7f78d98_1721303757.4674635.jpeg)
['Array', 'Binary Search', 'Divide and Conquer', 'C', 'Matrix', 'Python', 'C++', 'Java']