We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Constructive Algorithms
  4. Flipping the Matrix
  5. Discussions

Flipping the Matrix

  • parikshitsarkar1
     + 0 comments

    This is a simple Javascript solution with time complexity of O(n^2). This question is quite confusing so please watch this video to clearly understand the question and solution. 

    function flippingMatrix(matrix) {
    const n =Math.floor(matrix.length / 2 );
    let arr = []; 
    for(let i = 0 ; i < n ; i++){
        for(let j = 0 ; j < n ; j++ ){
            let temp = [];
            
            temp.push( matrix[i][j] ); 
            temp.push( matrix[i][2*n-j-1] ) ; 
            temp.push( matrix[2*n-i-1][j] ) ; 
            temp.push( matrix[2*n-i-1][2*n-j-1] ) ; 
            arr.push(Math.max(...temp)) ; 
            
        }
    }
    
    let total = arr.reduce( (x,y) =>{
        return x + y ; 
    } ); 
    return total ; 
}