Which Algorithms to Study for Coding Interviews? (Algorithm Tier List)

[@algo.monster]

What's the craziest algorithm you've used in an interview? Interviewer once made me find all Strongly Connected Components (SCC)🙄

[@zodman]

was the NASA right ?

[@modiji2435]

Such a useful explanation , i was reading about monotonic stack or solution to such problems but it was so confusing , i think I will be able to relate to those better now

[@nofinatorr]

Final tier list is at 20:40 Great video. Thank you!

[@27051740]

Amazing Content!

[@IntelsCreed]

Never seen any DSA content as simplified as this one

[@pamelapang9913]

It's super useful! Thanks!!

[@helloworldcsofficial]

Great vid! Given the current job market for devs, do you think this tier list needs an update?

[@asparshraj9016]

The BFS icon though 😂😂

[@Tom-tn9cf]

Great video, it it safe to say that for preparation for FANG. You should really only focus on S-C algorithms since there the ones that are most likely to come up?

[@algo.monster]

Yes, you are right! Knowing where to put your effort is the #1 thing.

[@sarnobat2000]

This is really useful (as is your site). I just hope employers don't adjust interview difficulty because the candidate pool's performance is raised.

[@abdelrahmansamir6278]

actually your rating for the dp is unjustifiable when solving problems that need memoization if you get the basic solution without the correct way to save states (memoize) it wont be like you solved the problem at all so optimizing the code in interviews mostly is what matters and that's what dp does

[@danielseo7040]

hello! i found this after seeing it on your website but your roi chart doesn't really match up with this, did something change? which one do you recommend following?

[@algo.monster]

Hi, thanks for the comment. The tier list is value only. The ROI table (algo.monster/problems/stats) takes effort into consideration. So it's like earning vs price to earning. Some topics may be valuable but the effort makes it less worthy it to study. We take a very data-driven approach.

[@helloumeis]

Im new in algorithms, whats the best starting point to see how strong algorithms are and what benefits i can get to use them in code? I have advanced understanding of python but never used alogorithms types, maybe my program is like a algorithm but i never got into stuff like u showed 😅

[@algo.monster]

Yes, the focus here is on acing interviews rather than tackling everyday business app programming. A lot of the nitty-gritty is concealed within APIs. Imagine developing a friend-connection app; you'd be navigating a graph with DFS. Or, constructing a dungeon crawler game? You'd employ BFS/DFS to uncover the routes. Those are just some examples. We have a basic evaluator that tests your algo knowledge here, check it out: algo.monster/evaluator

[@adrianford468]

Fire Video 🔥🤌🏼

[@bigbaggoyard]

Usually Hackerrank always has DP problem.

[@portiseremacunix]

thanks! subed!

[@algo.monster]

Thanks for the sub!

[@bigbaggoyard]

How do you get the freq of questions asked stats?

[@MrJoki56]

Just to clarify would you recommend going from top to bottom of the tiers

[@algo.monster]

Yes, definitely!

[@goldencrafttimmy5398]

Glad I won't be needing Dijkstra any time soon lol

[@algo.monster]

or KMP, Ford−Fulkerson, Boyer−Moore, Bellman-Ford lol

[@siddhantprakash.]

where does Bit Manipulation fits in?

[@algo.monster]

from our data, it's too niche to be useful. almost never asked in a real interview

[@siddhantprakash.]

@@algo.monster sure, got it. only few times it's useful in optimization o(1), but yeah even I've not faced any BM questions till now in interviews.

[@mitroitskii]

Hey folks, what is that app you’re using to layout the algorithm type pictures?

[@mahdiaziztls]

I don't believe Greedy Algorithm belongs to F tier!

[@algo.monster]

Thanks for the comment! Haha, yeah academic textbooks like to cover it. So this ranking is pretty much based on the return on investment you get from studying for interviews. Now, when it comes to greedy, there aren't really any universal templates for solving greedy problems (unlike say two pointers or BFS), and you'll need math proofs to ensure it works. So, I'd say the time spent studying isn't quite worth it. If it's simple enough, you'll likely nail it on the spot. But if it's meant to be tricky, well, studying might not do you much good.😅

[@CharanSaiAnnam]

I did 280+ in leetcode and I would place greedy at S or A tier!!

[@algo.monster]

haha, for sure a lot of "ad-hoc" problems come down to coding to spec are essentially greedy. The ranking is based on ROI, i.e. greedy is more like "you know it when you see it" kinda approach rather than being able to systematically study it. That's why we put it there.