วีดีโอ

@@marcosaraque5101 thanks! Yeah it’s because TH-cam shorts has a max limit of 1 minute for shorts. If it’s cut off I usually have a long form video or another short with the rest!

Yes! Floyd warshall is wasteful in this case, no need for all pairs max paths when we only care about start and end.

Because with dfs you're exploring every path from start to end node in an unefficient way. You can think of DFS as the brute-force solution in this case. Dijkstra guarantees to find the optimal path given a directed graph and nonnegative edge weights. It is indeed undirected here but we can assume that traversing back and forth between two nodes will eventually decrease our probability and will be not selected from the max-heap. Hope this helps.

Great explanation. DFS just won’t work because of the cycles. You could do 2^n DFS but that’s way too slow.

@@ezarbali2713 wow thanks that was so clear :)

You should def switch to python. For interview problems they are mostly space and time complexity focused. By using C++ you're opening yourself to more complicated questions in an interview and slower solve times. Using python allows you to make the process of constructing a solution more frictionless. For personal development c++ is great, but for interviews especially entry it isn't worth doing it in leetcode

are you typing with your feet?

@@shazmimain8293 sorry brother I mobile get bricked and now touch is not replaceable because it red magic devices when write something it automatically intercepted, manipulate the written comments and now this time I write with my pc so it write .

@@FreeTrial0315 understandable.

I'm no expert on this, but from how I see this: High level companies like Google, Facebook started this. This is understandable since these guys want the best programmers and might often use these algorithms to implement new features instead of using existing packages. The reasons could be either security purposes or simply because there is no such package/library available for this. To give better example, Google Maps is probably using some sort of path finding algorithm. But for special case, they might need to modify parts of it to make it work as they intend, something that may not always be possible by using third-party libraries. And since they are the top in tech industry, they are not expected to depend on someone else to solve their problem. Now, this is probably the real part of the answer: Why do other companies want tech interview as well? Simply because they're following MANGA/FAANG companies and also because they're not really sure how else to do it (especially with the least effort from the hiring department). They could try take-home assignments. But if the assignment doesn't change, then people will specifically prepare for that problem and if it does change, then people will complain they're doing free labour (sometimes, they are). Also, if they do create unique problems for each candidate, they're wasting a lot of their time on candidate that they won't be hiring. So, from the hiring department, it makes more sense to do what MANGA does. There's already thousands of problems on Leetcode (they don't have to waste time on making up new problems), they can randomly pick a few and the problems will probably be unique enough per candidate. On top of that, they'll potentially find candidates who understand beyond basic programming. As a fresher, you are not expected to know about their tech stack, so this is probably what makes you better than the rest. Exceptions do exist though. If you happen to have good portfolio to show you actually know enough of the tech stack, there is a possibility that the company will ignore your competitive programming skill. Or maybe some other company will show interest in hiring you. But you'll need to show exceptional work to showcase yourself from other newbies.

@@sharif47 so without knowing the patterns in the question and without seeing the solutions how will I be able to approach the question.for that i have to see many solutions ?

@@omjagtap3432 that's the neat part, you don't. You pretend to never have seen this problem in your life and then proceed to pretend you're solving this problem for the first time. Theoretically, if you've solved enough problems, you would've seen the pattern and should be able to recognize the pattern. From my own interview experience, only Samsung R&D liked to give hardball questions (think really complicated graph based hard questions) but they gave about 3 hours for one question. Also, you can find them on the internet. But even trying to memorizing them gave me nightmares. Then again, Samsung is quite MANGA level. For other average companies, I would be asked to implement different data types (think stack, hashmap, linked list etc.) or problems like finding if a string has certain patterns, or pallindromes or at least problems that do not require you to use advanced algorithms. Maybe if you're good at understanding problem statements and have the ability to turn them into easier subproblems, you might end up with a solution within a given time. In short, other companies did not give me problems that would require research paper level knowledge to solve. But that's just my experience (which may vary on your location) and even I failed a lot of those interviews.

@@omjagtap3432 that's the neat part, you don't. You pretend to see it for the first time and then pretend to solve it for the first time then and there. More realistically, if you've solved enough problems, you'll likely be able to recognize the pattern in the questions and modify your solutions accordingly. From personal experience, average companies don't give you problems that require knowledge of algorithms from research papers. Ideally, if you can understand the problem statement and divide the problem into easier sub-problems, you won't have issue solving them. Then again, experience may vary depending on the location and/or company. Meanwhile, Samsung, which is a high level company, does give really hard questions requiring high level knowledge on data structure, dp, graph etc. You can look up their problems on the internet, they often repeat.

There's no harm in looking at solutions after atleast trying for 15-30 minutes with full concentration and ending up with no ideas. What's important is that you analyze the solution in such a way that you can make the insight next time

See my community posts for my LinkedIn!

First master recursion then go for dp

Good question, not really sure how they tiebreak but I fluctuate a lot. My highest was rank 5!

🫡

what does that have to do with views?

If I was an alien, I’d say I was human :)

@@topswe if so then I'm pretty much convinced apart from high intellect and consistency aliens have human way of good sense of humour.😃

:)