Find Peak Element (2D Matrix)
Binary Search on 2D Arrays DSA practice problem on Onlearn.
Difficulty: hard.
Topics: How do you find a peak element in a 2D matrix?, Matrices, Two-dimensional Array Traversal, Brute Force, Divide and Conquer, Binary Search, Recursion, Time Complexity, Space Complexity, Big O Notation, Loops, Conditional Statements, Optimization, matrix, complexity analysis, binary search, matrix traversal, divide and conquer, array algorithms.
Problem Statement: Find Peak Element (2D Matrix) A peak element in a 2D integer matrix is an element that is strictly greater than all its adjacent neighbors (up, down, left, and right). It is guaranteed that a matrix will always contain at least one peak element. Your task is to find and return the coordinates (row, column) of any peak element in the given 2D matrix. Input Specification The input will be a 2D integer matrix, matrix. The matrix will have R rows and C columns. 1 <= R, C (The matrix will have at least one row and one column). Output Specification Return a list or tuple [row, col] representing the 0 indexed row and column of any peak element found. Constraints The matrix will only contain integers. Adjacent elements are those directly above, below, left, or right. Diagonal elements are not considered neighbors.