Matrix Diagonal Sum (LeetCode 1572) | Full solution with visuals

No video

Matrix Diagonal Sum (LeetCode 1572) | Full solution with visuals | 2 possible scenarios

Рет қаралды 802

Күн бұрын

Join this channel to get access to perks: / @nikoo28
Actual problem on LeetCode: leetcode.com/problems/matrix-...
Chapters:
00:00 - Intro
00:50 - Problem Statement
02:28 - 2 possible scenarios
05:57 - Solution
07:46 - Dry-run of Code
10:33 - Final Thoughts
📚 Links to topics I talk about in the video:
Array Data Structure: • Array Data Structure e...
What is Big O?: • Big O Notation Simplif...
Other Easy Problems: • Easy Problems
📘 A text based explanation is available at: studyalgorithms.com
Code on Github: github.com/nikoo28/java-solut...
Test-cases on Github: github.com/nikoo28/java-solut...
📖 Reference Books:
Starting Learn to Code: amzn.to/3sJm8Wl
Favorite book to understand algorithms: amzn.to/4848xJH
Favorite book for data structures: amzn.to/3P96YBv
Get started for interview preparation: amzn.to/44Nn5du
🔗 To see more videos like this, you can show your support on: www.buymeacoffee.com/studyalg...
🎥 My Recording Gear:
Recording Light: amzn.to/3PdsViT
Microphone: amzn.to/3Exv83x
Recording Camera: amzn.to/3PwyN8e
Tablet to sketch and draw: amzn.to/3ZdKVy7
Sketching Tool: amzn.to/45XJEgY
Laptop to edit videos: amzn.to/460ofDu
💻 Get Social 💻
Follow on Facebook at: / studyalgos
Subscribe to RSS feeds: studyalgorithms.com/feed/
Join fan mail: eepurl.com/g9Dadv
#leetcode #programming #interview

Пікірлер: 15

@Homelander_30 Ай бұрын

DSA course from nikhil Bhai, will take unemployment away🙂

@user-ly1by2hd8p Ай бұрын

Dude is a genius-level teacher! Thanks a lot!

@topricano9964 Ай бұрын

ur explanation is amazing..Thankyou sm!!!

@Cryengineers8205 Ай бұрын

great one

@balusharmagotety8334 Ай бұрын

Excellent explanation with 0(n)

@abhinavsharma2268 Ай бұрын

Hi Nikhil, I just landed on your channel through KZfaq recommendations. Your explanation is looking very clear and crisp. Just want to know, you have used Java in all your videos ??

@nikoo28 Ай бұрын

yes, mostly Java...but my aim from this channel is to understand problem solving skills, not write the code. ChatGPT can write code for you anyway..and there are multiple other sources too

@abhinavsharma2268 Ай бұрын

@@nikoo28 Agreed. Your explanation is key and important for beginners like me.Thanks!

@baishayansaha2344 Ай бұрын

Upload video daily sir

@jayeshpatil5757 29 күн бұрын

19:25 ,10 July watching Jump game leetcode searched.

@cooltechie007 Ай бұрын

actually we can check if (i == n - i -1) then do not add that element twice. just a suggestion

@nikoo28 Ай бұрын

Yes you can..but then you are checking it n times…vs only one time if you do it later

@rih1926 Ай бұрын

Hello sir, Is there any online classes taken you on zoom or google meet for problem solving?

@nikoo28 Ай бұрын

not right now...but I am planning to setup something.

@s260888 Ай бұрын

@Nikhil Lohia, great work! I’m a big fan of yours. I have a better version of it; please check it out and please comment on it. public int diagonalSum(int[][] mat) { int sum =0; int j= mat.length-1; for(int i=0; i