Who else knew the solution beforehand but still watched the video ✊
@1KIINGDOM5 ай бұрын
🙋🏾♂
@akinhwan5 ай бұрын
surprised how simple this one was, used to longer solutions lately
@jessesinger47905 ай бұрын
First day of the month
@akinhwan5 ай бұрын
@@jessesinger4790 oh they progress as the month goes along? i wasn't aware
@Sathvik2795 ай бұрын
Thank you for daily Leetcode solutions. If possible, please try to upload GFG POTDs also.
@hyperzhi5 ай бұрын
We can use list comprehensions to make it more pythonic: return len([c for c in details if int(c[11:13]) > 60]), len() is O(1)
@jamessandy66635 ай бұрын
IMO that is less readable.
@shubham65235 ай бұрын
happy leetcoding !
@venkatexplorermetturdam5 ай бұрын
Leetcode python + gfg python needed bro ❤ love you for ur efforts
@guitaripod5 ай бұрын
whenever you post these, i try myself first. had to ask claude about swift's string parsing API's so didn't count this as a success, but like 80% success. But I learned something then I watched you do it in python
@SalmanZaman5 ай бұрын
Congratulation on getting featured by prime today.
@31redorange085 ай бұрын
He totally missed that the conversion to int is useless.
@chrischika70265 ай бұрын
because it doesnt matter
@zweitekonto96545 ай бұрын
Guess who misses the optimal solution to hard problems.
@31redorange085 ай бұрын
@@chrischika7026 What do you mean?
@chrischika70265 ай бұрын
@@31redorange08 you said he missed it, it doesnt matter
@31redorange085 ай бұрын
@@chrischika7026 Why doesn't it matter? What's the point of these videos in your opinion?
@ESLRepeat5 ай бұрын
Done this in 36 seconds
@samarthjain50155 ай бұрын
This says that I'm not getting an August badge.
@chien-yuyeh93865 ай бұрын
Super easy one..😂
@DNKF5 ай бұрын
1st =]
@DNKF5 ай бұрын
If time is available, could you please explain LC1334 solutions besides the Dijkstra? LC has couple solutions and I think those solutions may be useful in some negative cost questions.