@shenzheng2116
1:21 - Heap 3:17 - Sliding Window 4:30 - Binary Search 6:46 - DFS & BFS 8:08 - Recursion 9:16 - Hashmap
@jasonswift7468
Number 6: Heap Number 5: Sliding Window Number 4: Binary Search Number 3: DFS & BFS Number 2: Recursion Number 1: Hashmap
@ricardocaballero6357
IMO if there is a better channel for coding interview prep it is not in this this world, this is IMO by far the best resource to prepare, everything well organized , excellent explanations and a lot more. Million thanks
@zero11010
I’ve had dynamic programming show up in interviews twice. Anecdotal. But, I also went to a school for engineers that just taught algorithms and how to handle behavioral questions, how to negotiate (this part paid for the course even if you ignore everything else), and how to build a resume. They taught dynamic programming specifically because it was being asked. If you understand recursion. And if you understand how to make a cache. Then you only need to learn how to recognize when a problem can be broken up into smaller sub problems to eliminate repetitive work.
@zomgneedaname
This is a great list - having done a whole bunch of the blind 75 ones, I can definitely see that mastering the application of all of these here allows you to basically solve all common problems. Also dynamic programming is totally overrated cos in a real SWE job I can imagine the number of times you actually use it is like...0.01%, if ever.
@chillywilly314
this really helped get a broader picture on what I need to learn. I'm self-taught which makes it really difficult going through these interviews. Like what is recursion? I never used! But your channel has helped me learn so much, so thanks!
@theHootHoot
This is a thank you message to Neetcode ✨ I'm really glad I found your channel. I come from a non-CS background and I finally got into the 'FAANG' list, and a major contribution goes to you. I understood the whole concept of Trees and intervals only because of your videos buddy, thank you so much for all the work you've been doing 🖤 (I know getting into FAANG may not be that great of an achievement for everyone out there, but coming from a background where you didn't have any exposure to tech, it's a huge deal for me)
@dennismeissel
It is not Djikstra, it is Dijkstra :) Thank you for the great video!
@dantenekomew
I really recommend using whiteboard every time you make a technical challenge, specially in interviews, it shows you understood the problem and it makes you explain how you are designing the solution. It also (for example) helped me get the best solution in the 375 - Guess Number Higher or Lower just by drawing the problem. Never had a 0 milliseconds answer on a solution that I wrote on my own 😅
@utkarshdewan8736
I'm currently pursuing mechanical engineering but lost interest in it a month ago and switched to coding. I'm in my 6th sem and just got finished with basic ds and am practising them at the moment. It's really a lot of pressure when you consider that there are people who have already learned what you are atm a good while back and are many steps ahead of you and you're competing against them. I don't have a lot of time left but still I'm trying to do my best, and videos like these really help a lot. Thankyou so much
@jeremyvonhatten5811
Permutations and combinations would be a good topic to understand. It is easy to get confused about generating them and the different types
@minaFbeshay
I totally agree with you! Those are the most frequent topics that show up in the coding interviews.
@Ch4p1n17
As a self-taught this is very helpful. I still go over every concept possible but these videos help me focus more on certain ones, thank you!
@spike_021
Just started interviewing this month for mid/"senior" level SWE roles again, so far the majority of problems have been sliding window in some shape or form. Today I got some bit logic operations one that I totally bombed because I always forget which shifting to do for digits. Sigh.
@LinkingYellow
I don't work at a major company, but where I work, we really only care that pointers don't confuse you and that you can do basic problem solving. Even with the bar so low, we rarely find anyone that fits.
@sellygobeze7173
Time should really name you Person of the Year!! At the very least, you should be on the TIME 100: Most Influential People of 2022 - you've helped so many people! Thank you!
@pelusemua8425
Hi neetcode! 2:56 Doing heapify costs O(n), but when we pop each element to get the minimum or maximum element (depends on maxHeap or minHeap), it will cost O(log n). It means the total generally will cost O(n log n) because we need log n to get the particular element for n size.
@AndreiMushinsky
Sliding Window is actually a Dynamic Programming technique. You start with the small subproblem and gradually progress towards larger subproblems by reusing the result of the previous ones until you get the final result.
@JoeChang1999
I did start to solve problems using BFS, DFS, Recursion in my dream lol since I began to prepare for my incoming Google interview. I hope I can pass it.
@NeetCode