Top 6 Coding Interview Concepts (Data Structures & Algorithms) 

Any recommended order while learning?

Please try to avoid reveals like these in the comment section. What it does is, 1. reduces the average watch time for this video which impacts the creator, 2. the viewer misses the other important things said in the video apart from just the highlight.

@@chagsssss If people really care about content they will watch it. This helps people avoid watching things thet may already know.

thnx

Thank you! Surprised that there's no Arrays....

Wow! Congrats! Amazon?

@@pelusemua8425 yeah lol Thanks :)

That's great, congrats!!! Your hard work paid off!!🎉

@@NeetCode thank you! Keep up the great work man

Congrats! May I ask how long you've been doing leetcode for?

Update?

I've done quite a few Leetcode questions but these are the two I find these two topics the most difficult by a wide margin! Really struggle with these two.

how's it going bro

No. You probably are saying that because of a particular problem in mind. It may not always be the case.

No.

Don't think so, I think so you probably have a question in mind.

Dictionary is a hash map

Good luck!

That's because the surname is Dijkstra, not Djikstra ;)

That one is tough. I don't like the condition function for that problem, I think it's an implicit graph/dp problem so pretty hard. I had an easier time with 2187. Minimum Time to Complete Trips and KoKo eating banana problem.

@@1cannon3 yeah it is. It’s solvable with binary search but I still can’t wrap my head around it

What is DSA dude

@@yippeeki-yeyDSA stands for data structures & algorithms

Coding only

@@Nick-uo2bi coding only?

@@Nick-uo2bi a

@@kirilivanov7677 yes

Even if he teaches everyone how to ace a “typical” FAANG technical interview, the result would be that they no longer act as an effective way to filter out candidates, and they would just change what they ask, rendering the “answers” useless for interviewing.

We should use library. Only limited time of 45mins( at max ) is given per problem in a coding round. If the language doesn't have in built heap then switch the language.The interviewer wants to check how you can use existing Data structures to solve your problem efficiently.

@@amitpadaliya6916 I disagree. You can just as easily say "JS doesn't have this data structure, so I am going to assume it exists and solve the problem". They aren't testing your ability to create a data structure from scratch.

In the real world, someone much smarter than you already implemented these data structures and algorithms for you in a more efficient way than you could probably ever write. Many come in the standard library of the programming language that you need to work in or as an external lib you can include in your project. So implementing data structures and algorithms is usually reserved for specific needs when the out of the box solutions don't solve the problem for you. Most of the time you will just use these premade solutions to solve the problem in your app. Knowing data structures and algorithms is essential because I'd say 50% of a software engineer's job is knowing when to apply which tool to solve a problem. That way you're not wasting time remaking the wheel in a probably more bug prone solution, but instead improving your productivity and providing a harder to break solution. Software engineering is all about recognizing patterns, when you know these patterns you can optimize your dev time and your solution, improve readability and shareability and so on. You will also know the trade offs of each tool so you know when it's better to apply a different tool than it might seem at first glance. Depending on your project most of the time you're probably not gonna need anything besides the basics and to just know the API of the standard library of your programming language. You won't be solving complicated algorithmic problems most of the time either, most of the complexity will come from the architecture you're using and the business requirements of your project. Knowing how to reverse a binary tree might not help you there, but if you understand how to solve that kind of a complicated problem, then you can probably figure out how to solve whatever is the actual problem at hand because it demonstrates you're good at pattern recognition and breaking down problems into smaller divisible chunks that are easier to solve. Of course there is a lot more to the software engineering roles than just that, lots of communication and organizing skills are needed besides it among other things, but this is an easy way for interviewers to standardize the process to and filter out unwanted candidates. Remember, the interview isn't there to pick the best person for the job, it's to make sure you filter out all the undesirables.

Yeah js is enough... Programming language doesn't matter that much

Yeah i learned that eventually lol, after I recorded most of my videos unforunately lol

ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-emNkJGwcusQ.html

Valium :-)

All the best 🙂, breathing exercises.

all is well, you will shine, good luck

@@NirmalSilwal thanks, that was so nice of you! Wish you all the best!

@@MrAkehtam thanks, that did actually help a bit ^_^

Yep

He meant that Sliding window uses 2 pointers, one that defines left bound of the window, and another one the right one. Two Pointers Algorithm is when one pointer starts at first element, second on last, and there a target number. If the sum of the numbers of both pointer is bigger than the target, move second pointer to the left. If it is smaller, move first pointer to the right. And in result you'll get two numbers that will result in a target number when added.

2D DP?

Which leetcode question was it?

Agreed

how lmfao that is some niche topic inside graphs

Heapify costs O(n), then popping the min/max element is O(log n). So the total is O(n + log n), which is still O(n).

Some companies like Facebook supposedly banned their employees from asking DP questions in interviews.

Why did you fail? Where did you mess up?

There is always a morning after night. Don't worry

Keep it, strong brother. I am in the similar situation, and many times.

*I mean, anyone with common sense can tell by raising the title*