Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
89 changes: 89 additions & 0 deletions ExitPointOfMatrix.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,89 @@
import java.util.Scanner;

public class ExitPointOfMatrix {

public static void Display(int [][] a)
{
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[0].length; j++) {

System.out.print(a[i][j]+" ");

}
System.out.println();
}
}

public static void main(String[] args) {

Scanner scn = new Scanner(System.in);

int row = scn.nextInt();
int coloumn = scn.nextInt();

int [][] matrix = new int[row][coloumn];

for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j < matrix[0].length; j++) {

matrix[i][j] = scn.nextInt();

}
}

// Display(matrix);

int i = 0 , j = 0 , dir = 0;


while(true)
{

dir = (dir + matrix[i][j]) % 4;

if(dir == 0)
{
j++;
}
else if(dir == 1)
{
i++;
}
else if(dir == 2)
{
j--;
}
else if(dir == 3)
{
i--;
}

if(i < 0)
{
i++;
break;
}
else if(j < 0)
{
j++;
break;
}
else if(i == matrix.length)
{
i--;
break;
}
else if(j == matrix[0].length)
{
j--;
break;
}

}

System.out.println(i);
System.out.println(j);

}

}
72 changes: 72 additions & 0 deletions MatrixMultiplication.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,72 @@
import java.util.Scanner;

public class MatrixMultiplication {

public static void Display(int [][] a)
{
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[0].length; j++) {

System.out.print(a[i][j]+" ");

}
System.out.println();
}
}

public static void main(String[] args) {



Scanner scn = new Scanner(System.in);

int r1 = scn.nextInt();
int c1 = scn.nextInt();

int [][] oneArray = new int[r1][c1];

for (int i = 0; i < oneArray.length; i++) {
for (int j = 0; j < oneArray[0].length; j++) {

oneArray[i][j] = scn.nextInt();

}
}

int r2 = scn.nextInt();
int c2 = scn.nextInt();

int [][] twoArray = new int[r2][c2];

for (int i = 0; i < twoArray.length; i++) {
for (int j = 0; j < twoArray[0].length; j++) {

twoArray[i][j] = scn.nextInt();

}
}

if(c1 != r2)
{
System.out.println("Invalid input");
return;
}

int [][] prdArray = new int[r1][c2];

for (int i = 0; i < prdArray.length; i++) {
for (int j = 0; j < prdArray[0].length; j++) {

for(int k = 0; k<c1 ; k++)
{
prdArray[i][j] = prdArray[i][j] + oneArray[i][k] * twoArray[k][j];
}

}
}

Display(prdArray);

}

}
72 changes: 72 additions & 0 deletions RotateBy90Degree.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,72 @@
import java.util.Scanner;

public class RotateBy90Degree {

public static void Display(int [][] a)
{
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[0].length; j++) {

System.out.print(a[i][j]+" ");

}
System.out.println();
}
}

public static void main(String[] args) {

Scanner scn = new Scanner(System.in);

int size = scn.nextInt();


int [][] image = new int[size][size];

for (int i = 0; i < image.length; i++) {
for (int j = 0; j < image[0].length; j++) {

image[i][j] = scn.nextInt();

}
}

// Display(image);


// Transpose Of A Image

for (int i = 0; i < image.length; i++) {
for (int j = i; j < image[0].length; j++) {

int temp = image[i][j];
image[i][j] = image[j][i];
image[j][i] = temp;

}
}

// System.out.println();
// Display(image);

for (int i = 0; i < image.length; i++) {

int li = 0;
int ri = image.length-1;

while(li < ri)
{
int temp = image[i][li];
image[i][li] = image[i][ri];
image[i][ri] = temp;

li++;
ri--;
}
}
// System.out.println();
// Display(image);
}

}

109 changes: 109 additions & 0 deletions SPIRALDISPLAY.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,109 @@
import java.util.Scanner;

public class SPIRALDISPLAY {

public static void Display(int [][] a)
{
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[0].length; j++) {

System.out.print(a[i][j]+" ");

}
System.out.println();
}
}

public static void main(String[] args) {

Scanner scn = new Scanner(System.in);

int row = scn.nextInt();
int coloumn = scn.nextInt();

int [][] spiralArray = new int[row][coloumn];

for (int i = 0; i < spiralArray.length; i++) {
for (int j = 0; j < spiralArray[0].length; j++) {

spiralArray[i][j] = scn.nextInt();

}
}



int minr = 0;
int minc = 0;
int maxr = spiralArray.length-1;
int maxc = spiralArray[0].length-1;
int tne = row * coloumn;
int cnt = 0;

// Display(spiralArray);



while(cnt < tne)
{

// LEFT WALL


for(int i = minr , j=minc ; i <= maxr && cnt < tne; i++ )
{
System.out.println(spiralArray[i][j]);
cnt++;
}

minc++;

// BOTTOM WALL


for(int i = maxr , j=minc ; j <= maxc && cnt < tne; j++ )
{
System.out.println(spiralArray[i][j]);
cnt++;
}
maxr--;


for(int i = maxr , j=maxc ; i >= minr && cnt < tne; i-- )
{
System.out.println(spiralArray[i][j]);
cnt++;
}

maxc--;

for(int i = minr , j=maxc ; j >= minc && cnt < tne; j-- )
{
System.out.println(spiralArray[i][j]);
cnt++;
}

minr++;

}

}

}

//11
//21
//31
//32
//33
//34
//35
//25
//15
//14
//13
//12
//22
//23
//24

Loading