Diagonal Traverse | Leet code 498 | Theory explained + Python code

This video is a solution to Leet code 498, Diagonal Traverse. I explain the question, go over how the logic / theory behind solving the question and finally solve it using Python code.

Comment below if you have a better solution to this problem!

Let me know if you have any feedback and don't forget to subscribe for more videos!

Time stamps:
0:00 Question Explained
1:38 Solution 1
5:08 Solution 22
11:52 Python Code

Code:

More leetcode questions solved:

[chigalaenyeazu]

Even if I was given 10 years I probably wouldn’t have come up with this man!

[sonmic]

I was stuck on this for days. You're so good! Thank you!

[xiangyugao]

Brilliant!! That's the best answer I have seen to this question!

[sureshgarine]

This is a pretty cool solution, I really like your thought process. Thank you so much. please keep up the good work.

[nityagudi]

Thanks so much for this video, very Simple to understand. Well Explained

[gowthamyarlagadda]

Is there an optimal solution? -That interviewer having a bad day!

[anmolsinghsethi]

This is easy to understand but the Approach 1 is better in terms of space.

[anythingcommon]

Not sure if I can think something like that someday, but great explanation. Could you also let me know what would be the time and space complexity of this ?
Is it O(n^2) ?
Help me to understand, As I'm new in programming.

[amitupadhyay]

dont feel bad bro, if the interviewer asks this type of question, then I dont care if I use a trick which I dont understand. Because, its really tough for average IQ student like to crack this solution in 15-20 mins

[waleeddib]

The amount of “trial and error”. Hate to say this but Leetcode is more of a memorization test, not an IQ test.