Java Program to Rotate matrix by 45 degrees

// Java program for 
// the above approach 
import java.util.*;
class GFG{

// Function to rotate 
// matrix by 45 degree
static void matrix(int n, int m, 
                   int [][]li)
{
  // Counter Variable 
  int ctr = 0;

  while (ctr < 2 * n - 1)
  {
    for(int i = 0; i < Math.abs(n - ctr - 1);
            i++)
    {
      System.out.print(" ");
    }

    Vector<Integer> lst = new Vector<Integer>();

    // Iterate [0, m] 
    for(int i = 0; i < m; i++)
    {
      // Iterate [0, n] 
      for(int j = 0; j < n; j++)
      {
        // Diagonal Elements 
        // Condition 
        if (i + j == ctr)
        {
          // Appending the 
          // Diagonal Elements 
          lst.add(li[i][j]);
        }
      }
    }

    // Printing reversed Diagonal 
    // Elements 
    for(int i = lst.size() - 1; i >= 0; i--)
    {
      System.out.print(lst.get(i) + " ");
    }
    
    System.out.println();
    ctr += 1;
  }
}

// Driver code    
public static void main(String[] args)
{    
  // Dimensions of Matrix 
  int n = 8;
  int m = n; 

  // Given matrix 
  int[][] li = {{4, 5, 6, 9, 8, 7, 1, 4}, 
                {1, 5, 9, 7, 5, 3, 1, 6}, 
                {7, 5, 3, 1, 5, 9, 8, 0}, 
                {6, 5, 4, 7, 8, 9, 3, 7}, 
                {3, 5, 6, 4, 8, 9, 2, 1}, 
                {3, 1, 6, 4, 7, 9, 5, 0}, 
                {8, 0, 7, 2, 3, 1, 0, 8}, 
                {7, 5, 3, 1, 5, 9, 8, 5}};

  // Function call 
  matrix(n, m, li);
}
}

// This code is contributed by Princi Singh 

public class Main {
    public static void main(String[] args) {
        int N = 4;
        int[][] mat = {{2, 5, 7, 2}, {9, 1, 4, 3}, {5, 8, 2, 3}, {6, 4, 6, 3}};

        int[][] result = new int[2*N-1][2*N-1];

        // Rotate the matrix by 45 degrees
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                result[i+j][N-1-i+j] = mat[i][j];
            }
        }

        // Print the rotated matrix
        for (int i = 0; i < 2*N-1; i++) {
            for (int j = 0; j < 2*N-1; j++) {
                if (result[i][j] != 0) {
                    System.out.print(result[i][j] + " ");
                } else {
                    System.out.print("  ");
                }
            }
            System.out.println();
        }
    }
}