I have a second channel where I solve the daily leetcode problems: youtube.com/@neetcodeio I curated a list of the 150 most important coding interview problems: neetcode.io/practice
I follow both of those. But ever since I started Tree, my ability to solve a problem on my own has decreased tremendously. I can sometimes explain the algorithm and how it's going to work. But when I try to code it up, I either can't or make some recursion stack error or some pointer error. It's been very demotivating for the last 2 weeks. (Would reading a bit of theory on the topic from grokking Algorithm help?)
Prepping for Google rn. My initial phone screening was a graph problem that required a hash map adjacency list to determine some minimum time at which all nodes are accessible by every other node. Listen to this man LOL
Since last two days... I am working with your one dimensional dp series. I am solving them using my ways and using recursion. Now going to solve the second last problem based on subsequences. Will be doing the iterative version once i get through this list using the recursion. Believe me, Your series is the best series. 🎉🎉
Excellent advice. Perfect example of think smarter rather then try and memorize everything. Basically you have to do these problems in 30 minutes blind. This is why most interviews are medium level. But even the original optimal solution to medium level problems took way more than 30 minutes to come up with.
Basically, these tests give you 30 to 60 minutes per question. You HAVE to be able to do these kinds of problems unconsciously. Reading the problem and comprehending it can take 5 to 10 minutes depending on the layers of obscurity (a story about cherries at dinner parties) and how you're given the inputs (parse some flatfile?) and so you need to immediately identify the solution ("sliding window solution") and then implement the solution in about 25-50 minutes. You will then be graded on whether the solution is the "rightest" (did you just bruteforce the answer? or is it performant?) and whether your code looks neat/clean (or does it look like you LLM'd it). These hazing rituals have gotten so bad that you need to be able to program without thinking to make the time limit, which feels pretty counter to the person you want to hire as an engineer, lol.
On philosophical standpoint, not being a professional coder, I'd also be inclined to believe your message (if I got it right) that strong grasp of fundamentals is much more useful than the ability to solve a really difficult trivial problem. To my understanding the interviewers (coding or not) want to see that you have a strong and healthy base to learn more and build onto, rather than very specialized memorized skill. Like they want to see your problem solving process, they might not even care if you can solve their test problem or not, but to see your thought process in how you'd start solving it, what's your planning stage like and WHY you are doing what you're doing. That tells them your potential and how easy you are to work with as a member of the team, if they can trust you with unfamiliar stuff.
This is what I look for in a candidate but when I myself try to apply for another job, I've to compete with geeks. I've to prepare for such stuff outside the actual stuff I do. Seems pointless.
I signed my Apple swe summer internship offer letter yesterday, and i wanted to thank you. I hope you continue to put out more of such useful videos for free
So bizarre that while we are looking to be employed by FAANG companies, this man/hero and others like him have parted ways with those same firms and never looked back.
That’s life I had a friend turn down an offer from google because his TikTok and Ig blew up and decided to be a content creator selling his own programs that’s life at the end of the day it’s just a job which will always have its constraints
@@kav04 Not necessarily, we’re a pretty small niche the money from YT isn’t that much, and the subscription money from the course would be good enough to keep him comfortable. I think he’s enjoying having less stress while doing something that he finds peace in
@@sandman.38it's working the opposite way, at least in France. Video made for a niche has a CPF higher because the public is more interested to buy or watch ad
These are the topics I feel it is most important to study, in order, with the first 10 being *essential*: - Two Pointers - Binary Search - Sliding Window - Trees (DFS, BFS) - Merge Intervals - Backtracking - Stacks - Hash Maps - Heaps - Linked Lists, specifically creating new ones and reversing existing - Greedy - Fast and Slow Pointers - Two Heaps - K-way merge - Top K Elements - Subsets - Matrices - Topological Sort - Dynamic Programming - Tries - Union Find - Bitwise manipulation If you do only 5 problems for the first 10 topics, it's still 50 leetcode problems. Some employers purposefully choose less popular topics, such as Union Find, so its probably better to do problems for all topics if possible
only basic data structure and algorithm is enough, maybe some advanced data structure such as priority queue other will make you special and has better value than other candidates of cause unless you apply to special role such as data scientist or ai engineer, the machine learning relate algotrthm is required
Thanks for using Python! As an aspiring data scientist, you are my savior for data structure and algorithm questions even though I got a degree from a university people considering one of the best in CS. Luckily, the neetcode 150 is more than enough for data science and/or machine learning interviews.
the thing is now you need to do hundreds of leetcode problems not just for the interview but for online assessments in order to get an interview you gotta get near perfect or perfect scores
You reminded me that I'm really only grinding LCs to pass interviews. At some point I seem to have forgotten that... well time to go back to our favorite problem DP 😂😂
Hello sir,thankyou soo much for all your tutorials, I was following your neetcode 150 and I cracked my first job just because of doing your neetcode 150 and some of dev stuff ,you are doing gods work
the only video which can motivate a non coder like me to get through python interview ocean before interviews.... kudos and thanks to bring up this..... channel subscribed...
Really grateful for your channel and also all of the problems on leet code. I find the best results when I study and practice the problem to learn new ideas and solutions, rather than just complete them for the sake of completing them. Looking forward to checking out your recommended problems
Very appreciative for your content and videos. This information is gold really helps someone like me who is trying to teach themselves everything about programming. Thank you!
I would really like to see a neetcode add a daily question based on my progression in the road map. Like you said, some questions are derived from other questions. So a daily question based on which questions I’ve completed to allow me to flex my understanding to conform to a new yet similar problem would be great. Love your videos ❤
I wish there were practical everyday problems to solve with these algos (maybe there are but no-one talks about them?). If I (personally) don't have cause to use them in my regular coding projects, they just go away. Out of sight out of mind. Advent of Code is excellent for practicing algos by applying them but again, even AoC is just a bunch of puzzles.
Thanks for your content! I'm currently preparing for an online interview with a MANGA company which I'll have in a month from now and maneuver the effort seems to be the smartest thing to do to optimize time, and your videos are helping me in that effort :)
Nice video! While the situations presented in leetcode problems are not always realistic, knowing when and how to use certain algorithms and data structures is useful on the job. Just knowing DFS (with back tracking) you can generate mazes without loops, as well as solve any maze. All from the same algorithm!
Thanks a bunch bro, I really needed this rn. There are so many leetcode problems such that I struggle with finding solutions for them. I'll heed your advice, and let's see how it goes... 😊
just a tip re hashmaps, AVG case is the key word here. Interviewers are usually looking for the worst case performance where HashMaps have O(n) worstcase for every action.
Tech interview process is broken. Dedicating this much time to solving brain teaser problems like leetcode is a huge waste of time, and its whats wrong with the industry.
Silicon Valley has been very elitist since its earliest days. These interviews are mostly about getting a ballpark measurement of IQ and conscientiousness to show that you can be a productive member of the club in a world where explicit IQ tests have been made illegal.
But so much of the thinking process used to the challengers is required to optimize processes, in machine learning for example use so many of this algorithms
100% agree. Thank God we stopped it at our workplace. It doesn’t give us good candidates, it gives us someone who can answer tricky questions, it doesn’t give us engineers who can write scalable enterprise software. The guys doing the real work are too busy to study for leetcode.
""" Hi, What do you think about the time complexity of second function here? At first, it looks like cubic() has O(n^3) but both functions practically scale quadratically, considering the cases below. GPT is confused and gives both answers sometimes. """ def quadratic(n): # O(n^2) count = 0 for a in range(n): for b in range(n): count += 1 print(count) def cubic(n): # O(?) count = 0 for a in range(n): for b in range(n): if a == b: for c in range(n): count += 1 print(count) cubic(20) # 400 (20*20) cubic(30) # 900 (30*30) print() quadratic(20) # 400 (20*20) quadratic(30) # 900 (30*30)
@Neetcode when are you adding a course for decision trees? I’ve gone through you courses and though it mentions during the dp and backtracking problems a video on just recognizing the pattern would be extremely helpful
3:37 it would help if there weren't a heap of one letter variables everywhere so I could tell what the code is doing without having to look all around the code for what it is or even what type it is.
Does your pathway reflect the frequency/difficulty questions to learn first in your Pro subscrptions? Or if not would you create a pathway that does focus on this.
I like this video, so thank you. However, all I feel like I'm getting from this is that you need to learn these things for interviews, not jobs. I'm a frontend engineer who mostly dabbles in Typescript and libraries, yet I'm still required to do LC Medium tests
Thank you, sir for sharing. Could you please create a video that will show how to learn to deeply understand the basics of algorithm concerts. Please upvote!
Many companies also expect experienced developers to know the company's stack well. If you are applying for a Full Stack Laravel React developer position you are expected to know PHP Laravel react very well. Most Full Stack positions expect you to know a Front End and Back End Framework. Solving Leetcode problems is not enough to get a job.
Im studying CS in college year 2, i know about most of those topics, but if you asked me to code them right know then im not sure i would be able to. Like i can explain to you and give some mathematical demonstrations, but idk if i can implement a heap right away.
Neetcode, how do you feel about books? Such as the Algorithm Design Manual or the classic CTCI? It's without a doubt not the fastest method but do you have any experience with these?
When you apply to Meta, there is a whole career portal with videos and lessons from the CTCI author going over how to prepare for interviews, so CTCI is definitely respected and still applicable all these years later
Don't know man, currently solving dp problems. Somehow it feels very intuitive (im using top down approach), trying to learn to convert it to bottom up. Occasionally still gets stuck 😅😅
I actually find dynamic programming to be easier than greedy algo. If you understand recursion well from DFS, then you can transform a DP problem into a DFS problem with a memo table. Greedy, on the other hand, has no consistent design patterns and is truly looking a spark on cleverness.
Every staff dev I know swears by the Alex Xu System Design Interview book. It's worth watching videos of sys design interviews online, but you HAVE TO do a mock interview before your real one. Find someone to do one with and give you feedback afterwards. Pay for a service if you must, but that's really huge because system design isn't like Leetcode where you can see how good you did and iterate and improve by yourself.
In Software Engineeriing you don't need to have solved many of those problems, just knowing basic principles are more than enough for absolutely most jobs.
@@JoshW5000 What do you mean by "all"? I didn't say that. The most jobs are not FANG and don't even demand solving medium or hard problems. In most cases you don't even need to solve those interview questions completely, all you need is to show an interviewer that you have problem solving skills and ability to communicate on that.
@@zakraw you're absolutely right, most of these concepts are irrelevant of the day to day. Anyone who works as a developer knows this, only the unemployed and 0.5% of developers that work in FANG will think this is normal
Ya our brains are essentially huge decision trees, so we naturally do better with deterministic pathways rather than sequential repetitive operations like with arrays.
Hello, I am adequate at c programming b/c it is the main language taught by my university at the start which is now transitioning to java. After learning about the two I'd like advice on which language to start next python or java script?
Hello, I would like to ask you a question, does the programming language in which I solve LeetCode really matter? The FAANG look differently if I resolve in language X and not Y.
But how do you study for each one, doing random problems at leetcode? reading random articles about random variations of them? Algorithms and DS is the most chaotic topic in Software Engineering.
What I love about DSA and patterns is how recursive they are, in this video you're describing an algorithm to solve DSA problem. Hey, we've just mentioned recursion! That's the first one. You're talking about decomposition of algorithms into concepts. That's akin to eigenvalues, or maybe OOP composition. That's 2 and 3. Arrange concepts and coding problems into a DAG, and you have dynamic programming. That's 4 and 5.
I don't know much about how this stuff is done because I'm not really a developer/programmer by trade (I'm a mathematician), but is this not how stuff is prioritized in normal CS courses? I have my minor in CS, but besides programming 1, 2, and data structures/algorithms, I took all the math-heavy courses and skipped the ones that were about, ironically, actually building or designing systems/apps from scratch. It's kind of ironic that all of these things seem like the entire focus of a math-focused CS course if they aren't touched on as much in the non-math-heavy CS courses.
It would be better if you make a course or series regarding DSA in python. Because on internet or even in UA-cam there are a few courses of DSA in python available. So for python guys and students and beginners it's really hard to get into. The stereotype of "wtf broz you are learning DSA in python?? Go for java or c++ man" is still around. It would be great if you make it.
You have grown a lot bro! Like I have seen you with less than 50K subs and now it has another zero at the end so I couldn't believe my eyes, had to look again lol.
Think about what heapify does. It goes through the list, finds the min or max and then puts that at the top of the tree. That is an O(n) operation. You can find min / max by scanning list once and build the tree by scanning the list again now that you know the min / max
I had a few questions, I know there a patterns that are asked, you don't need to do 500 questions. But as I didn't do much of graphs and trees, The approach I'm currently taking is to cover the topics and learn it, do the questions. Once it is done then ill move to 150 questions you have to practice them and keep applying in mean meantime!@Neetcode is this approach good or i should just learn 150 questions? i know it is different for everyone but just wanted to know what any of you will do!!
I have a second channel where I solve the daily leetcode problems: youtube.com/@neetcodeio
I curated a list of the 150 most important coding interview problems: neetcode.io/practice
I follow both of those. But ever since I started Tree, my ability to solve a problem on my own has decreased tremendously. I can sometimes explain the algorithm and how it's going to work. But when I try to code it up, I either can't or make some recursion stack error or some pointer error. It's been very demotivating for the last 2 weeks. (Would reading a bit of theory on the topic from grokking Algorithm help?)
Look nice with that sweater.
Do you plan to update the object oriented and system design series ?
r u crushin?@@iseeflowers
Prepping for Google rn. My initial phone screening was a graph problem that required a hash map adjacency list to determine some minimum time at which all nodes are accessible by every other node. Listen to this man LOL
How did it go my man
hello, any updates? i hope you got it 🫶🏻
djiksta's?
Since last two days... I am working with your one dimensional dp series.
I am solving them using my ways and using recursion. Now going to solve the second last problem based on subsequences. Will be doing the iterative version once i get through this list using the recursion.
Believe me, Your series is the best series. 🎉🎉
Excellent advice. Perfect example of think smarter rather then try and memorize everything. Basically you have to do these problems in 30 minutes blind. This is why most interviews are medium level. But even the original optimal solution to medium level problems took way more than 30 minutes to come up with.
Basically, these tests give you 30 to 60 minutes per question. You HAVE to be able to do these kinds of problems unconsciously. Reading the problem and comprehending it can take 5 to 10 minutes depending on the layers of obscurity (a story about cherries at dinner parties) and how you're given the inputs (parse some flatfile?) and so you need to immediately identify the solution ("sliding window solution") and then implement the solution in about 25-50 minutes. You will then be graded on whether the solution is the "rightest" (did you just bruteforce the answer? or is it performant?) and whether your code looks neat/clean (or does it look like you LLM'd it).
These hazing rituals have gotten so bad that you need to be able to program without thinking to make the time limit, which feels pretty counter to the person you want to hire as an engineer, lol.
On philosophical standpoint, not being a professional coder, I'd also be inclined to believe your message (if I got it right) that strong grasp of fundamentals is much more useful than the ability to solve a really difficult trivial problem. To my understanding the interviewers (coding or not) want to see that you have a strong and healthy base to learn more and build onto, rather than very specialized memorized skill. Like they want to see your problem solving process, they might not even care if you can solve their test problem or not, but to see your thought process in how you'd start solving it, what's your planning stage like and WHY you are doing what you're doing. That tells them your potential and how easy you are to work with as a member of the team, if they can trust you with unfamiliar stuff.
You got it right and this is what most interviewers are trained to look for actually
This is what I look for in a candidate but when I myself try to apply for another job, I've to compete with geeks. I've to prepare for such stuff outside the actual stuff I do. Seems pointless.
this!!
I signed my Apple swe summer internship offer letter yesterday, and i wanted to thank you. I hope you continue to put out more of such useful videos for free
What position did you apply for?
So bizarre that while we are looking to be employed by FAANG companies, this man/hero and others like him have parted ways with those same firms and never looked back.
That’s life I had a friend turn down an offer from google because his TikTok and Ig blew up and decided to be a content creator selling his own programs that’s life at the end of the day it’s just a job which will always have its constraints
but the things is Needcode has more than 500 000 subs. So probably he's making about 10-40 000 in months. Let alone his courses
@@kav04 Not necessarily, we’re a pretty small niche the money from YT isn’t that much, and the subscription money from the course would be good enough to keep him comfortable. I think he’s enjoying having less stress while doing something that he finds peace in
@@sandman.38his io is the money maker
@@sandman.38it's working the opposite way, at least in France. Video made for a niche has a CPF higher because the public is more interested to buy or watch ad
These are the topics I feel it is most important to study, in order, with the first 10 being *essential*:
- Two Pointers
- Binary Search
- Sliding Window
- Trees (DFS, BFS)
- Merge Intervals
- Backtracking
- Stacks
- Hash Maps
- Heaps
- Linked Lists, specifically creating new ones and reversing existing
- Greedy
- Fast and Slow Pointers
- Two Heaps
- K-way merge
- Top K Elements
- Subsets
- Matrices
- Topological Sort
- Dynamic Programming
- Tries
- Union Find
- Bitwise manipulation
If you do only 5 problems for the first 10 topics, it's still 50 leetcode problems. Some employers purposefully choose less popular topics, such as Union Find, so its probably better to do problems for all topics if possible
thanks!
cool story bro, neetcoders know
Nice
only basic data structure and algorithm is enough, maybe some advanced data structure such as priority queue
other will make you special and has better value than other candidates
of cause unless you apply to special role such as data scientist or ai engineer, the machine learning relate algotrthm is required
This is great list. Should Tries be above DP, I wonder?
Thanks for using Python! As an aspiring data scientist, you are my savior for data structure and algorithm questions even though I got a degree from a university people considering one of the best in CS. Luckily, the neetcode 150 is more than enough for data science and/or machine learning interviews.
the thing is now you need to do hundreds of leetcode problems not just for the interview but for online assessments in order to get an interview you gotta get near perfect or perfect scores
Thanks!
thank you so much!!
You reminded me that I'm really only grinding LCs to pass interviews. At some point I seem to have forgotten that... well time to go back to our favorite problem DP 😂😂
Hello sir,thankyou soo much for all your tutorials, I was following your neetcode 150 and I cracked my first job just because of doing your neetcode 150 and some of dev stuff ,you are doing gods work
you should do data structure, algorithm, programming concept tier list. i think its fun idea
Second this!!!!
the only video which can motivate a non coder like me to get through python interview ocean before interviews.... kudos and thanks to bring up this..... channel subscribed...
Respect towards you increasing day by day guruji
Really grateful for your channel and also all of the problems on leet code. I find the best results when I study and practice the problem to learn new ideas and solutions, rather than just complete them for the sake of completing them.
Looking forward to checking out your recommended problems
2:21 - Learning graph
Gotta study those DFS and BFS until they become my breakfast meal.
Very appreciative for your content and videos. This information is gold really helps someone like me who is trying to teach themselves everything about programming. Thank you!
I would really like to see a neetcode add a daily question based on my progression in the road map. Like you said, some questions are derived from other questions. So a daily question based on which questions I’ve completed to allow me to flex my understanding to conform to a new yet similar problem would be great. Love your videos ❤
I wish there were practical everyday problems to solve with these algos (maybe there are but no-one talks about them?). If I (personally) don't have cause to use them in my regular coding projects, they just go away. Out of sight out of mind. Advent of Code is excellent for practicing algos by applying them but again, even AoC is just a bunch of puzzles.
Thanks for your content! I'm currently preparing for an online interview with a MANGA company which I'll have in a month from now and maneuver the effort seems to be the smartest thing to do to optimize time, and your videos are helping me in that effort :)
Nice video! While the situations presented in leetcode problems are not always realistic, knowing when and how to use certain algorithms and data structures is useful on the job. Just knowing DFS (with back tracking) you can generate mazes without loops, as well as solve any maze. All from the same algorithm!
Thanks a bunch bro, I really needed this rn.
There are so many leetcode problems such that I struggle with finding solutions for them.
I'll heed your advice, and let's see how it goes... 😊
25 years ago I've heard saying: "Every problem is eventually a graph problem." Just learn graphs. That's it!
Thank you Neetcode, your content is super helpful!
These tips are eye-opening.
Thank you so much.
just a tip re hashmaps, AVG case is the key word here.
Interviewers are usually looking for the worst case performance where HashMaps have O(n) worstcase for every action.
Tech interview process is broken. Dedicating this much time to solving brain teaser problems like leetcode is a huge waste of time, and its whats wrong with the industry.
What you are saying is 50 50 not 100%
Silicon Valley has been very elitist since its earliest days. These interviews are mostly about getting a ballpark measurement of IQ and conscientiousness to show that you can be a productive member of the club in a world where explicit IQ tests have been made illegal.
But so much of the thinking process used to the challengers is required to optimize processes, in machine learning for example use so many of this algorithms
How should the process be then? If you can't beat them in those problems, how can I trust you will deliver a better project than them?
100% agree. Thank God we stopped it at our workplace. It doesn’t give us good candidates, it gives us someone who can answer tricky questions, it doesn’t give us engineers who can write scalable enterprise software. The guys doing the real work are too busy to study for leetcode.
Naveed, you and I are best friends this year! Period.
It’s really a forbidden jutsu. 🤣😂😂
great one 😂
I just want to say thanks. Appreciate you a lot.
Very informative Video! Thanks for all the help!
I see you have the sliding haircut algorithm implemented already
Wow this is so informative, thanks a lot!!
You know, not many people reveal their tricks like this. Thanks man!
"""
Hi,
What do you think about the time complexity of second function here?
At first, it looks like cubic() has O(n^3) but both functions practically scale quadratically,
considering the cases below.
GPT is confused and gives both answers sometimes.
"""
def quadratic(n): # O(n^2)
count = 0
for a in range(n):
for b in range(n):
count += 1
print(count)
def cubic(n): # O(?)
count = 0
for a in range(n):
for b in range(n):
if a == b:
for c in range(n):
count += 1
print(count)
cubic(20) # 400 (20*20)
cubic(30) # 900 (30*30)
print()
quadratic(20) # 400 (20*20)
quadratic(30) # 900 (30*30)
Nice overview, thanks a lot!🙇♂
What an amazingly informative video! Incredible job man
I have no idea what you are talking about in most of the video but I still subscribed because one day I will get there
@Neetcode when are you adding a course for decision trees? I’ve gone through you courses and though it mentions during the dp and backtracking problems a video on just recognizing the pattern would be extremely helpful
3:37 it would help if there weren't a heap of one letter variables everywhere so I could tell what the code is doing without having to look all around the code for what it is or even what type it is.
Does your pathway reflect the frequency/difficulty questions to learn first in your Pro subscrptions? Or if not would you create a pathway that does focus on this.
I like this video, so thank you.
However, all I feel like I'm getting from this is that you need to learn these things for interviews, not jobs.
I'm a frontend engineer who mostly dabbles in Typescript and libraries, yet I'm still required to do LC Medium tests
literally all the online assessments I've taken have tested on dynamic programming lol
Thank you so much for this video. 🙌
3:02 isnt a tree a DAG. why did you mention it to be undirected?
🎉very clear
Thank you so much for all of your videos and content
very informative video!
“I’ve done hundreds of problems, why do I still suck?”
I felt that one. Way too close to home.
Thank you, sir for sharing. Could you please create a video that will show how to learn to deeply understand the basics of algorithm concerts.
Please upvote!
Many companies also expect experienced developers to know the company's stack well. If you are applying for a Full Stack Laravel React developer position you are expected to know PHP Laravel react very well. Most Full Stack positions expect you to know a Front End and Back End Framework. Solving Leetcode problems is not enough to get a job.
Well why would you not know the stack you're applying for?
What Concepts should be learned serial-wise to ace the CP ?
for ex- array,linklist,dp,tree,etc.
This is helpful, thanks.
Thanks 🤩
When going through the neetcode 150. Do you recommend doing all the easy/medium problems for one topic then moving on? Or is there a better way
Im studying CS in college year 2, i know about most of those topics, but if you asked me to code them right know then im not sure i would be able to. Like i can explain to you and give some mathematical demonstrations, but idk if i can implement a heap right away.
It really is ridiculous that I had to solve leetcode nonsense to get a job where I write crud spring applications
Neetcode, how do you feel about books? Such as the Algorithm Design Manual or the classic CTCI? It's without a doubt not the fastest method but do you have any experience with these?
CTCI has easier algos, probably its good for a start then do leet code after
I read CLRS cover to cover, most people aren't that masochistic though.
When you apply to Meta, there is a whole career portal with videos and lessons from the CTCI author going over how to prepare for interviews, so CTCI is definitely respected and still applicable all these years later
Excellent
Nice Video! There a competition for women on coding- code to win. Can you make a video on how to ace it?
Great channel. As an idea for the next series of videos, please, could you consider FANG frontend related questions
Thank you
Ohh The GodFather I also love your sarcasm 😂😂 favorite topic dynamic programing
Don't know man, currently solving dp problems. Somehow it feels very intuitive (im using top down approach), trying to learn to convert it to bottom up. Occasionally still gets stuck 😅😅
I actually find dynamic programming to be easier than greedy algo. If you understand recursion well from DFS, then you can transform a DP problem into a DFS problem with a memo table.
Greedy, on the other hand, has no consistent design patterns and is truly looking a spark on cleverness.
please solve leetcode 654. Maximum Binary Tree
using monotonic stack
I heard that system design is also important for interviews, are there any good resources that you recommend?
Every staff dev I know swears by the Alex Xu System Design Interview book. It's worth watching videos of sys design interviews online, but you HAVE TO do a mock interview before your real one. Find someone to do one with and give you feedback afterwards. Pay for a service if you must, but that's really huge because system design isn't like Leetcode where you can see how good you did and iterate and improve by yourself.
What drawing app you're using? Thanks
Appreciate some of the advice. Although you probably shouldn’t have showed the Reddit person towards the end.
In Software Engineeriing you don't need to have solved many of those problems, just knowing basic principles are more than enough for absolutely most jobs.
Is that what you tell yourself bud? Delusional if you think that’s all you need.
@@JoshW5000 What do you mean by "all"? I didn't say that. The most jobs are not FANG and don't even demand solving medium or hard problems. In most cases you don't even need to solve those interview questions completely, all you need is to show an interviewer that you have problem solving skills and ability to communicate on that.
Agreed for onsite/hybrid roles. Only reason I am grinding Leetcode is the remote jobs seem to be asking them. I don't even care for FAANG.
@@zakraw you're absolutely right, most of these concepts are irrelevant of the day to day. Anyone who works as a developer knows this, only the unemployed and 0.5% of developers that work in FANG will think this is normal
@@JoshW5000"your daily motivational official" but you're speaking nothing but nonsense
The amazon backpack in the background is a nice easter egg
Backtracking and graph problems are easier than "simple" array problems for me. I guess i'm just weird.
Ya our brains are essentially huge decision trees, so we naturally do better with deterministic pathways rather than sequential repetitive operations like with arrays.
HashMap is really forbidden jutsu
Hello, I am adequate at c programming b/c it is the main language taught by my university at the start which is now transitioning to java. After learning about the two I'd like advice on which language to start next python or java script?
Hello, I would like to ask you a question, does the programming language in which I solve LeetCode really matter? The FAANG look differently if I resolve in language X and not Y.
4:05 Hashmaphuh😂😂😂
So Neet 🙏
Explain this to Indian employers here. Asking absurd DP questions in OA as well as interview.
Which indian employers specifically?
But how do you study for each one, doing random problems at leetcode? reading random articles about random variations of them?
Algorithms and DS is the most chaotic topic in Software Engineering.
What I love about DSA and patterns is how recursive they are, in this video you're describing an algorithm to solve DSA problem. Hey, we've just mentioned recursion! That's the first one.
You're talking about decomposition of algorithms into concepts. That's akin to eigenvalues, or maybe OOP composition. That's 2 and 3.
Arrange concepts and coding problems into a DAG, and you have dynamic programming. That's 4 and 5.
Sounds like with some consistent studying I can be interview ready in a month's time with these topics in focus?
I don't know much about how this stuff is done because I'm not really a developer/programmer by trade (I'm a mathematician), but is this not how stuff is prioritized in normal CS courses? I have my minor in CS, but besides programming 1, 2, and data structures/algorithms, I took all the math-heavy courses and skipped the ones that were about, ironically, actually building or designing systems/apps from scratch. It's kind of ironic that all of these things seem like the entire focus of a math-focused CS course if they aren't touched on as much in the non-math-heavy CS courses.
Nice man
“And of course everyone’s favourite: Dynamic programming”
It would be better if you make a course or series regarding DSA in python. Because on internet or even in UA-cam there are a few courses of DSA in python available. So for python guys and students and beginners it's really hard to get into. The stereotype of "wtf broz you are learning DSA in python?? Go for java or c++ man" is still around. It would be great if you make it.
better learn in c and translate to python
or just learn from algorithm theory/concept video if you really dont want to touch non python language ever
If you are a beginner you shouldn't even be getting into coding interview prep. Learn CS fundamentals first
Eres bueno, muy bueno
You have grown a lot bro! Like I have seen you with less than 50K subs and now it has another zero at the end so I couldn't believe my eyes, had to look again lol.
4:48, doesn't heapify operation take O(n log n) time?
No, it takes O(n) time
Think about what heapify does. It goes through the list, finds the min or max and then puts that at the top of the tree. That is an O(n) operation. You can find min / max by scanning list once and build the tree by scanning the list again now that you know the min / max
It’s O(nlogn) if you don’t have all the elements available at once ;)
How to learn decision tree?
I had a few questions, I know there a patterns that are asked, you don't need to do 500 questions.
But as I didn't do much of graphs and trees, The approach I'm currently taking is to cover the topics and learn it, do the questions. Once it is done then ill move to 150 questions you have to practice them and keep applying in mean meantime!@Neetcode
is this approach good or i should just learn 150 questions? i know it is different for everyone but just wanted to know what any of you will do!!
I see you have the sliding haircut algorithm implemented already
Was recently asked a median of a stream
What I still cannot understand is what are the actual real-life situations where you use those concepts. I still dont know honestly
It's just a measurement to identify critical thinking, problem solving skills
wonder how many programing interview relate videos there are... and how many of these exact video idea most common questions .
Amazon backpack in the background 🤌
bug report:
sometimes solved and marked questions don't work on initial load. almost game me a heart attack.
1:44