LeetCode is a JOKE with This ONE WEIRD TRICK
HTML-код
- Опубликовано: 12 сен 2024
- 🔥 How to know which algorithm to use to solve a LeetCode problem or a HackerRank online assessment? Simply use the time constraints to infer the intended time complexity and the algorithm. Learn more: algo.monster/p...
This video tutorial will help you systematically approach and quickly solve LeetCode easy, medium, and hard problems. Ideal for beginners and experienced coders alike. It's the Ultimate Leetcode interview tip. LeetCode tips and tricks.
Our unique approach emphasizes learning to solve problems by leveraging the constraints in the problem description. With this trick, you can back-calculate time complexity and select the best algorithm for your solution.
Get ready to immerse yourself in a journey of practical LeetCode learning, where we aim to help you master the art of solving coding problems. From tips and tricks to in-depth walkthroughs, this video is your one-stop resource for LeetCode mastery.
Don't forget to subscribe and hit the bell for notifications on our upcoming content. Join us in this learning journey and become a LeetCode champion!
#LeetCode #LeetCodeProblems #CodingChallenge #Algorithm #DataStructures #DSA #Programming #Hackerrank #codinginterview #leetcodetips
Full constraint to algo mapping and code examples here: algo.monster/problems/runtime_summary
This is a pretty genius way to start approaching algo problems because it's way easier to look at constraints to determine the required time complexity than it is to look at the problem description and determine what algorithms or data structures fit
Thanks! Yes, it is, indeed!
Goodhart's Law is expressed as: “When a measure becomes a target, it ceases to be a good measure.”
But, I guess, it is what it is.
hahaha, yes indeed. LeetCode-style interviews is just a game we have to play to get in the door.
You guys didn’t know this ??
Well if you knew, you wouldnt be watching this video now, would you?
😂😂😂😂😂😂😂@@sadboy-xx6gh
@@sadboy-xx6ghha got 'em!
@@sadboy-xx6gh obviously. We also never buy a kinder surprise eggs with a toy we already have!
Fr tho, people getting IT jobs should know this from a fucking college, among other fundamentals. Not as a 'crazy hack' for code monkeys to ace leet code...
Yeah how can you not see the pattern of time limit exceed and constraint
Damnnnnn, this is soooooo underrated man. Love such insights! Keep em coming
Glad it helps! And Zlatan is the best haha
Check this video to understand how LeetCode (or Hackerrank etc) works behind the scene: ruclips.net/video/hRnJxPeoZyg/видео.html
But the issue with this approach is that in the onsite interview, interviewer won't tell you the constraints. You need to find out the most optimal approach based on the problem description not the constraints.
Thank you for teaching the first concept you need to learn before starting Competitive Programming but people are so dumb they don't pay attention to even that one
It's hard coming up with what specific class of algorithms I should use :( This way is definitely useful if you ask for constraints!
Dude that was really smart wtf
ikr!
What's the point of this. You are not solving LeetCode problem to game their system. You are trying to prepare for the interviews mostly or at least I am. So even though the platform accepts quadratic or even exponential solution, what's the point of it. Interviewer will obviously expect a better solution.
To quote the classic math book "How to Solve It" by George Pólya:
"The conditions of the problem contain the essential data. If you analyze the conditions carefully, they will suggest the way to the solution."
This is exactly how you are supposed to solve a problem - using whatever information you have in the problem description. This is not gaming the system. You need this knowledge to deduce what to do next. A reasonable interviewer will understand this. If not, you probably don't want that job anyways cuz they are probably not good engineers or collegues.
Also LeetCode is usually stricter than real interviews. If you can solve it to pass LeetCode, you can pass the interview.
was much needed !!!!
I want to understand how code is executed and how does LeetCode measure the best solutions? Anybody can list some technical concepts I need to learn?
Check out this video on how leetcode works behind the scene: ruclips.net/video/hRnJxPeoZyg/видео.html
Yeah noticed this around when I had solved 70 questions.
Hey, can you make something where more of these constraints or the inputs/language hints us to use specific algorithms, like if its asked minimize the maximum sum, we use binary search or something same like that???
Hey yes, we have a full flowchart on how to determining what algo to use: algo.monster/flowchart
If the constraints is 5 *10^4
Using this constraints which time complexity is used and in which approach we have to code
Apparently 5*10^4 falls under O(n) or O(nLogn) category
In video he states that you hit TLE at around 10^7 operations. So anything faster than O(n^1.5), that is O(n) and O(n log n).
I always did wonder how to interpret the size constraint, thanks for the helpful video and cheatsheet
Thanks!
Welcome!
NICE SUPER EXCELLENT MOTIVATED
bele bele ta constraints guda deinathae anya online coding platform re. setebele tike sahibaku pade aau. aau interview re ta semane kuhantini. pacharile hi kahibe nale kahibe nahi kichhi constraints. seithi fasi jiba. jie true coder sei karipariba.
Great video!!!
Thanks! Glad you liked it!
Found best one❤
Very informative
i thought u will go to inspect element change the constraints or test case something so that anything might work
User-submitted code is run on the server so it wouldn't work. But I like the way you think!! haha
well that whale should have a full on clown costume and makeup. Because wherever the code is being tested at, the results are a joke XD
Yeah. That's really good.
This video is a GEM.
Nice❤
genius
Glad it helps!
👍👍👍
Love from india
This is HUGE!!!!!!!
This doesn't work all the time, cause there is a statistical aspect too that's taken into consideration. If more and more submissions are in O(n) rather than O(nlogn), your submission will be declined even if it was accepted before.
It doesn't work this way, but there's a probalistic element (I guess it depends on runner to which your submission is assigned and its load). So sometimes you can try to resubmit the same solution to pass
I don't think that's how it works. Timing is not dynamic adjusted. Like @fakenullie said the same solution could have different runtime. It's not stable. This is from my friend who worked as ops for LeetCode.
@@algo.monster I faced this with a few questions. When I attempted to submit the same code two years later it just kept failing. Also problems also change from hard to medium. I was watching some video by neet ode, where in the video it was hard but the problem in the site was a medium. I presumed that as acceptances increased, it changed
thx alot
Happy to help!
These are basic things.
I'm sitting here, watching AI generated content
haha, using voice clone cuz it's easier to sync the audio with video. the content is all original
I dont think the aim is to just pass the leet code question. Typically if you use brute force in an interview the interviewer would just ask you "is there any other way to solve this?" And if brute force is all that you did its not going to end well
which is why you need to ask the constraint? a big part of an engineer's job is choosing the right tool for the right job.
nerd
You think you're pretty cool don't you
This is true, but useless.
can you elaborate? figuring out the algo is half the battle
this is absolutely useful. not fully but looking at the constraints your 1/4th work is done
it's literally a binary search technique for the algorithm matching