Print Matrix Diagonally (Diagonal order)

Print the matrix Diagonally. You have to print the matrix in diagonal order.

[@manishachanda8089]

Very nice explanation sir but there is a bug in your code(the condition of the while loop will be i>=0 && j

[@Dadwalfamilyadventures]

While conditions should be while (i >= 0 && j

[@irfanshaik4440]

Yes bro now working fine all test cases passed 🙌

[@BABEENGINEER]

You're awesome. I love your video explanations!

[@SmartProgramming]

very well explained, keep it up, thank you sir 👍👍

[@shiyuwang]

Thank you so much! This is very clear, this question is my interview question today. I should have watched it earlier.

[@existingstars3665]

Which campany

[@Ak-um1yg]

bro which company....what are u doing now

[@Dadwalfamilyadventures]

Good job in explaining well. All your videos are great. Cheers!! Keep the good work

[@alute5532]

Finally have landed into the guru of algorithms bless you & namaskaram

[@awalktoinfinity665]

hi sir ! actually in both while ..you missed one more condition i.e., to ensure to i and j both to remain within boundaries of matrix .. in the first while for printing the row side diagonal you should put a condition so that j should be within "n" . for ex take matrix of size 5*2 . check this program will not work and will throw array index out of bound exception . similarly for second while in the second for loop , put a condition for i>=0 . anyways great video

[@MrShortReels]

Could u write it sir, cause I want today really.

[@awalktoinfinity665]

@@MrShortReels you are asking whom ?

[@MrShortReels]

You commentator can u add the missing.. To algorithims

[@MrShortReels]

Cause I want to convert this to matlab algorithim

[@richardtan4844]

It does work. I did test it

[@k12i]

Thank you for walking us the process of how to solve this type of problems, I find it very helpful!

[@jingli2168]

Thanks for ur video. However, there is a bug in your nested while loop. consider a 4 by 2 matrix. Correct answer I think should be def dia_print(arr): output = [] for i in range(arr.shape[0]): j = 0 while i >= 0 and j

[@chrismaheshwari4487]

Can't we use the (i+j) and then compare it to the x variable with the help of IF function in a loop and then increment x.........??

[@t1910j]

I should have watched this video earlier today. I was asked to solve this in my interview today!

[@jaishreeram-o9b47]

in java public class ZigZagPrint { public static void zigZagPrint(int m[][], int r, int c) { for (int k = 0; k = 0 && j < c) { System.out.print(m[i][j] + " "); i--; j++; } System.out.println(); } for (int k = 1; k

[@kumarkk3592]

Super b teaching.it is very clear

[@oddprogrammer7968]

In the second while the condition i>=0 is necessary, otherwise it goes out of bounds.☺

[@rohitdixit1617]

Hi Vivekanand. Thanks for the amazing tutorials. Can you please put out a tutorial for matrix reflection?

[@meghaharlalka]

love your videos and explanation

[@user-youyoki9054]

I really want to push the LIKE👍🏻👍🏻👍🏻👍🏻👍🏻👍🏻 button ONE MILLION TIMES!! Thank you such a million, MASTER!!

[@user-youyoki9054]

void MakeDiagonalArray(int ** ar, int n1, int n2) { int i, j; int k, num = 1; /* The variable 'k' - trace through every starting of the diagonals The variable 'i', 'j' - go on incrementing i by +1 - go on decrementing j by -1 The variable 'num' - 각 배열에 자연수를 대입. */ // Tracking first elements of the columns for (k = 0; k < n2; k++) { i = 0; j = k; while (j > -1 && i < n1) { /* Each diagonal ends at the first column or the last row. */ ar[i][j] = num++; i++; j--; }// while (j > -1 || i < n1) }// for (k = 0; k < n2; k++) // Tracking last elements of the rows for (k = 1; k < n1; k++) { i = k; j = n2 - 1; while (j > -1 && i < n1) { /* Each diagonal ends at the first column or the last row. */ ar[i][j] = num++; i++; j--; }// while (j > -1 && i < n1) }// for (k = 1; k < n1; k++) }// void MakeDiagonalArray(int ** ar, int n1, int n2)

[@amitkumarsingh5414]

Is good if you cover rest of the questions that are generally asked in interview... Good Job

[@SusanAmberBruce]

The same program in python 3, thanks for your help. # python 3x example # diagonal iteration of array m x n. matrix = [ ['a', 'b', 'c', 'd', 'e'], ['f', 'g', 'h', 'i', 'j'], ['k', 'l', 'm', 'n', 'o'], ['p', 'q', 'r', 's', 't'] ] m = 4 # rows n = 5 # columns for k in range(0, m): i=k j=0 while i >= 0: print(matrix[i][j], end = "") i = i-1 j = j+1 print() for k in range(1, n): i = m-1 j = k while j

[@alphanumeric9380]

Is this program for specific element pls help I need diagonal of specific element matrix 3*3 k=6 output=[2,6] and [6,8]

[@foo.1396]

I suppose the conditions of both while loops should be combined otherwise the program fails for 3x2 Matrix as it would eventually try to look for element(0,2) which is not present.

[@sagarkumar0190]

Exactly

[@ShinobiEngineer]

#include int main() { printf("THANK YOU ! ! !"); return 0; }

[@AmbikaKumar21]

*_Please make the videon on Longest common Subsecuence with coding_*

[@rico5146]

By adding condition (i>=0 && j

[@PrimeContent01]

yes yes i also figured it out just now, this code is not complete

[@mdfarooq8312]

Sir, this is valid for only m < n

[@HeroesOfAesthetics]

AMAZING VIDEO!!! JUST what I needed my friend, thank you!

[@armandobueno1681]

I'm trying to make a tic tac toe game and this helped me so much haha thanks

[@juliaevers5129]

How to do inverse -I mean from a vector to get a matrix in reverse order ?

[@bhanukiran5089]

Python code for matrix of size m*n: ---------------------------------------------------------- no_of_dia=m+n-1 for k in range(no_of_dia): for row in range(m): for col in range(n): if row+col==k: print(num_list[row][col],end=' ') print()

[@manishpamnani8428]

how to check if there is a next element or not? Like in the matrix above we don't have a element after 22, how do we determine that?

[@arjunreddy3996]

This algorithm breaks for non square matrices, for example in a 3 x 1 matrix.

[@Dadwalfamilyadventures]

As your logic will fails if we have (4, 3) matrix.

[@kalpshah9745]

change 1st while(i>=0 && j=0 && j

[@LordHoward]

Hey peeps, this is kinda different but I wrote this piece of code (JAVASCRIPT) that finds the sum of each of the two diagonals in a square matrix, and it worked for me. //square is the name of the 2D array int sum = 0; //sum of first diagonal int sum2 = 0; //sum of second diagonal int x = 0; int y = square.length - 1; while (x < square.length) { sum += square[x][x]; x++; } x = 0; while (y >= 0 && x < square.length) { sum2 += square[x][y]; y--; x++; } //sout sum, sout sum2

[@manishkumarsharma86]

Great explanation

[@angadrajsingh4311]

Amazingly helpful sir . Cleared my confused concept thanks a lot sir . Do make more videos like these...

[@rohangarg5473]

beautifully explained , thank you

[@kedirali2455]

The question is will these formulas work for n by n matrix?

[@NileshPatil-si7dy]

it doesn't working in 3rows and 4 columns matrix.

[@dilmurod9820]

Very good thanks man for lesson

[@Huduuniih]

For this should work for any (n,m), one needs to have additional conditions in the two while loops, as shown below: for k=0:m-1

[@MaratGilyazov]

There is a mistake as well, in the second loop it should be "i = m - 1", instead of "i = m" :)

[@momenuddin5693]

Your tutorial very easily to understand Thank You

[@jonesbenet8293]

Thank you for your algorithm

[@indiansoul9845]

thank you sir, this solution is awesome 🙏

[@learn-o-land6759]

Thank you. Great explanation

[@Ishakgauri]

respect for you sir explained so easily

[@danielmugisha6708]

print the counter diagonals like p, p q, f l r, a g m s, b h n t, c i o, d j, e

[@SaumyaSharma007]

Long live Sir..........Thank u so much.

[@xiamojq621]

Please unload the code for these program

[@CursedDarkOracle]

THANK YOU MISTAH, I REALLY LIKE YOUR VIDIO

[@kowshikparitala2715]

while(i>=0 && j

[@Michael-tk1wd]

THATS WHY HES THE MVP THE GOOOOAOT

[@aremju7435]

I tried to implement this algorithm --> first loop works perfect. Seccond loop throws ArrayIndexOutOfBoundsException for i = -1 (which isn't possible)

[@firasrg6348]

What If I want to loop from top to bottom??

[@DheerajSharma-fs6je]

hats off !!!!!!

[@bamanstech3006]

Thank you. you are awesome..

[@henry999z]

tip : watch 1.75 speed

[@hari7110]

Thank you sir

[@jigardoshi2852]

I approached this as bfs of binary tree wherein on current element[0,0], insert bottom[1,0] and right element[0,1] in queue. would that approach work ?

[@pythonenthusiast9292]

Thankyou so much Vivek sir

[@amanwebtricks9112]

Thank you so much sir

[@piyushsharma1638]

clearly understood. thanks.

[@gurjotsingh7192]

can you help in Write a program to find frequency of user given item in the 3X3 matrix python

[@henry999z]

great stuff btw

[@dragonslayer5191]

thank u sir

[@aashishsingh5868]

best explanation

[@Caliche_666]

Clear and concise. Thank you!!!

[@karthikkumaresan1091]

the best

[@deepthik9500]

sir please explain about antidiagonal matrix where 5*3 matrix

[@manishpamnani8428]

Very Well Explained Sir. SImple Explanation and Nice Illustration. I always refer to this video when i am stuck on Algorithms. THank You Sir Once Again.

[@ShinobiEngineer]

धन्यवाद

[@tapanjeetroy8266]

Thanks for uploading it.. You are doing a great great job.. Please please upload more of such programming questions.. We really need it

[@MrShortReels]

Sir could you help me I want to find maximum and minimum local of sin wave by using for loop and if statement

[@krishnaverma7744]

Bhai... thanku so much.... Loving watching ur videos...

[@mousemouse1818]

Hi Sir, what about [e],[d,j]. means if we come from -1 those diagonal elements are missing

[@suodallos]

Thank you very much buddy !!!!!!!! you explained it really well and in a very non confusing manner.

[@lauragaleraalfaro8086]

Cool, but what If you want it to traverse it in the opposite way?

[@Sushil2874]

Thank you so much.. This was very helpful Clear and concise..!!

[@sushmagudimetla126]

Sir can you post a videos related to bigdataanalytics and cloudcomputing

[@manishpamnani8428]

why is k=1 in the second for loop and not k=0 like the first loop?

[@kabboghosh1853]

very well explained ,thank you sir love from bangladesh

[@vrushankdoshi7813]

could you please add a video on in-place rotation of matrix (90 degree) ?

[@anshumanpraharaj5582]

Could you please share the time nd space complexity for each algorithm

[@birunthamalini8696]

Kindly share me program for sum of the all diagonals of a matrix

[@academydrawing]

Sir I want class 12 comp practical comp programing

[@krashdata]

Thank you so Much , nice explanation.

[@chilukabharath4809]

good job sir, this question was asked in campus interview.

[@Ak-um1yg]

which company man

[@BinaryEmyaneh]

Thank you that helped a lot. Just had to add in a small fix on the second portion of the code.

[@WILLGYS]

Thanks a lot, that really helped.

[@hsandeep007]

Excellent and thank you so much.

[@shankars4281]

Thanks! Very well explained.

[@sweatheart786]

Simple and clear, thank you

[@ankitgarhewal9916]

sir plz upload a vedio to rotate a matrix k times

[@riaganesha]

Best channel in KZbin!!

[@bot74774]

very clear explanation.

[@prabhunathtiwary9852]

Anyone can help me for antidiagonal programming in java or c !

[@sairamgourishetty]

Perfect explanation 👌

[@maheshchowdarypydi6192]

Superb 👍👍👍

[@RaviKumar-vk6ib]

excellent!!!

[@cheivcheiv756]

Good job!

[@SachinSPatil-jm4ls]

easy to understand tq sir....