Lucky Numbers in a Matrix - Leetcode 1380 - Python

[@CoffeePoweredDev]

The example is incorrect @1:26, the minimum in the third row is 12. So, the lucky number is 12 in the changed example. I think the confusion arises while doing example 2, but referring to example 1. But appreciate these videos as always as they are always helpful.

[@aquaworld9965]

Yes

[@ARUNKUMARTIT]

I also had the same doubt, but how this 1st solution also support the example 2? can anyone explain this

[@chrischika7026]

3:42 the fact that it is pink and you said sweet middle lol that had to be intentional.

[@aryanmishra199]

Yeah I noticed that too lmaoo

[@fancypants6062]

Very cool little trick for this one. I'm glad I watched it even though it was an easy question.

[@md_pedia1]

The final solution was awesome Glad I watched ur solution!

[@giovannigonzalez6272]

The fact that ive gone through almost half of your neetcode 150 list and still cant solve easy problems like this is demotivating. Quitting sounds great right now!

[@ShyGuy_16]

No, You can just give up that easily, consistency is the key, keep grinding!! it will pay off soon

[@pratyushthakur8478]

This was a fun question hopefully we get more matrx questions this week to practice for codesignal oas since new grad recruitment is starting soon

[@MykolaPavluchynskyi]

I don't see need to check all rows and all cols after we identified max_of_mins. It's easier when we found max to also save column for that max. So second step would be to check only data in that exact column, not in all the matrix.

[@yang5843]

This problem is similar to City skyline

[@slizverg23]

That feel then the problem marked "easy", but Neetcode's video is 16 min long...)))

[@mahammedhashish9170]

Is it possible to come up with o(1) space solution in interview? What do you think?

[@AJK-a2j00k4]

it's not very hard.. just take a paper and pen and draw it out, you might click prolly!

[@chien-yuyeh9386]

Thanks for sharing. I think this one is interesting.

[@abhishekdhyade7500]

Not the butt cheek with a pink middle 😂😂😂

[@TechiSrivasanth]

12 is lucky number for ur example plz check

[@cosmic1602]

Please come up with a math course

[@pastori2672]

you gave it all away when you said return an array is misleading lol

[@epotnwarlock]

3:44 we all do big guy

[@chrischika7026]

3:34 gyattt

[@BigStupidTech]

Thank you for this!

[@zweitekonto9654]

I think you complicated it way too much. The simple logic behind the O(1) solution is that, there can only be one min or one max element in a collection of elements given they are all distinct. And the O(1) solution comes naturally after this.

[@NeetCodeIO]

can you explain, your explanation sounds oversimplified but maybe im missing something?

[@zweitekonto9654]

​@NeetCodeIO Maybe I was thinking something else. My O(1) solution was different than yours and I didn't watch your solution complete. Your explanation is on point.