Please don't stop doing daily problems. Your videos are the only one that make sense.
@7Idiots-w2i
18 сағат бұрын
+1
@FizzaAhmad-up8ns
17 сағат бұрын
Yeah his vedios make my habit to solve the daily problem.
@patilrajesh2500
15 сағат бұрын
+1
@erick_ftw
14 сағат бұрын
+1
@hen56349
10 сағат бұрын
Especially, the Hard problems.
@akash-kumar737
Күн бұрын
RIP to candidates who get these question and expected to come up with optimized solution 😢😢😢.
@gojou1621
Күн бұрын
Love you , Thanks for doing this daily
@satyamjha68
23 сағат бұрын
A tough one! Unable to solve this on my own. Thanks for the solution!
@baetz2
Күн бұрын
Nice video, but each time you say "long story short" I get lost lol. I'm sitting with a piece of paper and drawing trees now trying to get it.
@marcoaraujo9446
17 сағат бұрын
When I was trying to solve this problem, I got the part that I needed to skip a path before starting to do the DFS. However, it's very complicated to get how many elements will be on a given path :(
@prakhar4585
Күн бұрын
Difficult to understand.
@muditkalra7077
17 сағат бұрын
He still made a little intuitive to figure out... But this questions is too hard honestly!
@blipbloping
Күн бұрын
my glorious king neetcode
@mcbotface
Күн бұрын
Hey you were right. I get memory limit exceeded for today's POTD. return sorted([i for i in range(1,n+1)], key=lambda x:str(x))[k-1]
@DevoteeInCorporate
Күн бұрын
bro n is 10^9 😶🌫
@mcbotface
Күн бұрын
@@DevoteeInCorporate I am getting TLE for yesterday's neetcode solution.
@anonymoususer9053
Күн бұрын
that's why he gave a better solution
@mcbotface
Күн бұрын
@@anonymoususer9053 I mean even O(n) is not accepted?
@onlywrestling7810
Күн бұрын
@@mcbotface that's why the problem is hard.
@krishnapranav1892
20 сағат бұрын
Sir, I really like your videos a lot. They are really helpful. But Please discuss the weekly leetcode contest solutions also sir.
@EduarteBDO
21 сағат бұрын
I feel like I'll never be smart enough to solve this kind of problem
@vanshraj4724
Күн бұрын
was waiting for this only
@vio_tio12
13 сағат бұрын
love your work! Helps us on our journey!
@prashik4810
Күн бұрын
Nice explanation, Loved it.
@ArminEghdamiDrums
6 сағат бұрын
Honestly, if you have never seen this problem before and are in an interview setting, who would figure this out??
@sahil-xz9en
Күн бұрын
bro I am lost
@jayjw1
23 сағат бұрын
same.. this problem is one of the hardest ive seen tbh
@business_central
19 сағат бұрын
Thank you for saving us
@jamesisaacson6414
10 сағат бұрын
Could you please do 373. Find K Pairs with Smallest Sums? Didn't find any intuitive explanations anywhere else.
@keshavagrawal4546
23 сағат бұрын
People doing in java in the helper function make res,nei and cur to long and do (int) to return int
@prasunroy2802
16 сағат бұрын
Thank you
@catwithlegz
19 сағат бұрын
Could you potentially make a video on leetcode 835?
@karolszymanowski518
21 сағат бұрын
I get it but also I don't :/
@buituan2909
19 сағат бұрын
bye streak, this shit is too complicated.
@studyaccount794
20 сағат бұрын
13:50. WOn't that be 1100 instead of 1110?
@kaiserandvlad
16 сағат бұрын
You cant use yesterdays code cuz of time limit exceeded
@Aanand-dd1kj
Күн бұрын
Op🎉
@DassVeryGood
19 сағат бұрын
If I get asked this I’m definitely cooked
@KishoreKumar-011
21 сағат бұрын
Great Explanation, kindly use the given example for explaining the problems. Helps in better understanding.
@7Idiots-w2i
18 сағат бұрын
+1
@martinf7586
14 сағат бұрын
@@7Idiots-w2i Given examples frequently too trivial to properly illustrate the algorithm.
Пікірлер: 50