Bro has legit Brute Forced recording all LeetCode problems. This is the only possible explanation I have. Or you are some part of Higher Order leetCode group. If you are, don't forget to thank Beyonce
I actually use a different heuristic, but with all these people thinking i'm some kind of leetcode time traveler.. i'm reluctant to tell them how i'm doing it lol
The leetcode home page when you're signed in. Leetcode publishes editorials and you can see which ones were most recently added. Those are generally the daily LC questions.
@@NeetCodeIO You can also go one step further by tracking the existing editorials which are recently removed, those ones are also gonna show up....but well I guess they are gonna publish new editorial in few days... so yeah tracking discuss is enough
I just want to express my gratitude for your numerous and clear explanations on how to approach this problem. They are so much more helpful than the LC editorials, for sure.
Mate thanks for these. Your structures made learning DSA so much easier. I sometimes get shocked how some questions that seemed impossible look so easy now. Can you possibly make a follow up for the video "Median of Data Stream"? When you made it it had no follow-ups, and it's kinda easy when you know the approach. But the follow ups now pose some interesting challenges. Would love to hear you thoughts.
Amazing video! Your explanations are crystal clear and helped me grasp new concepts. The different approaches to solving the LeetCode problem were incredibly insightful. Keep creating!
Divide and conquer boys and girls! First start by (recursively in my case) generating all possible subsets. Then once you have that you can concentrate on how to manage and compute the bitwise OR. I always do the problems on my own and then come back to the Neetcode vid to review and see if I missed something. Happy friday!
I don't get the intuition of the better approach with simple recursion without memo in the given explanation at 13:30. Let's say we are counting the time complexity as n* maxOrValue but will there be a case to cover all the orValues between 0 -> maxOrValue ? no, right ? memoization is the same approach with pure recursion just it adds up one step to check if the index and orValue is present in the cache (previous computation) and right away gives the result early without further computation than how it's actually slower as compared to the vanilla recursion implementation ? Am I mistaken ? Appreciate if someone could help here. Btw, Thank you for this thorough explanation!
Just a doubt. How in the caching approach did you come up with the fact that the time complexity is the same as space? Since we are adding caching to the first approach, if something repeats it will return immediately. What am i missing?
37 minute video uploaded 8 minutes after the problem was revealed? Teach us your ways
he recorded it on 11th October
Different Time Zone maybe
Bro has legit Brute Forced recording all LeetCode problems. This is the only possible explanation I have.
Or you are some part of Higher Order leetCode group. If you are, don't forget to thank Beyonce
I actually use a different heuristic, but with all these people thinking i'm some kind of leetcode time traveler.. i'm reluctant to tell them how i'm doing it lol
@@NeetCodeIO Please tell, my curiosity is pipiqued
The leetcode home page when you're signed in. Leetcode publishes editorials and you can see which ones were most recently added. Those are generally the daily LC questions.
@@NeetCodeIO You can also go one step further by tracking the existing editorials which are recently removed, those ones are also gonna show up....but well I guess they are gonna publish new editorial in few days... so yeah tracking discuss is enough
how did bro record 37 mins in like 7 mins since the problem's released 💀.
okay...ig its pre recorded
because he made the question
I just want to express my gratitude for your numerous and clear explanations on how to approach this problem. They are so much more helpful than the LC editorials, for sure.
30:44 “I’m not even finna lie to you”. That gave me whiplash
im kind of proud that i came up with the bit mask solution myself :)
Mate thanks for these. Your structures made learning DSA so much easier. I sometimes get shocked how some questions that seemed impossible look so easy now.
Can you possibly make a follow up for the video "Median of Data Stream"? When you made it it had no follow-ups, and it's kinda easy when you know the approach. But the follow ups now pose some interesting challenges. Would love to hear you thoughts.
You can actually initialize defaultdict at construction by passing the initial dict as the second parameter.
Amazing video! Your explanations are crystal clear and helped me grasp new concepts. The different approaches to solving the LeetCode problem were incredibly insightful. Keep creating!
Thanks！Love this kind of multiple solutions to learn more!
Divide and conquer boys and girls!
First start by (recursively in my case) generating all possible subsets.
Then once you have that you can concentrate on how to manage and compute the bitwise OR.
I always do the problems on my own and then come back to the Neetcode vid to review and see if I missed something.
Happy friday!
The goat posts, I watch
Keep up the good work
I don't get the intuition of the better approach with simple recursion without memo in the given explanation at 13:30.
Let's say we are counting the time complexity as n* maxOrValue but will there be a case to cover all the orValues between 0 -> maxOrValue ? no, right ? memoization is the same approach with pure recursion just it adds up one step to check if the index and orValue is present in the cache (previous computation) and right away gives the result early without further computation than how it's actually slower as compared to the vanilla recursion implementation ?
Am I mistaken ? Appreciate if someone could help here.
Btw, Thank you for this thorough explanation!
Just a doubt. How in the caching approach did you come up with the fact that the time complexity is the same as space? Since we are adding caching to the first approach, if something repeats it will return immediately. What am i missing?
Really cool!
7:40 how come you're not pop()/backtrack if you do include i?
I like the 4th way because I have not learn what dp is.
thank you is the least I can say!
so how did you know on 11th Oct that this will be a daily problem for 17 oct? 🤔🤔
Hello 👋
I feel like it's because different parts of this editorial is written by different authors...
I wonder how tf recursive solutions leaks so much memory and deepcopying dict is not
Lightning
im fast af boiiii 🏃
this is a nice vid tho hahahah, in a past life you and i would be great friends bc id lie and make up stories about hidden gems i discovered
What
Hey there's a mistake, 10^5 = 100,000, not 10,000.
So the further calculation are also wrong, n * max_or is not 160,000 but 1,600,000
Good catch. I believe my point still stands that 65,000 < 1,600,000 and the first solution is more efficient
Actually it should be 3200000 as
max_or * n
(2 * max_value) * n
2 * 10^5 * 16
= 3200000
bro i live in india , can i buy your lifetime subscription of neetcode of 300 something $ ? and how
please send an email to support@neetcode.io
mail him
@@saishivamgupta4584 i think i know you bro 😄
Streakkkk bb
But how do we know you arent a shape shifting AI brained alien though?
this makes me feel so stupid
Bro do you know Hindi just chill
Bruh it’s been only 10 mins since daily launched, how you record 30min video 🤌