Hi This is my first post on blind. So Apologies if I missed something / put in the wrong tags / tagged the wrong ones. I would like to know what graph algorithms and trees types are really important for interviews? There are many types of trees like Fenwick, suffix, tournament, AVL, splay, red-black, segment, XOR, expression, Cartesian, balanced, interval, threaded, B, B+ etc., (besides the usual binary trees and binary search trees) Similarly the topic of graphs has a ton of algorithms. https://leetcode.com/discuss/interview-question/753236/List-of-graph-algorithms-for-coding-interview?page=2 Are these all to be learnt for interviews? Is there a subset of the most important of graph algorithms and trees types to focus on ? Besides, what are some good resources to learn DP? Thanks! #interview #dynamicprogramming #algorithms #datastructures #leetcode #faang TC: 180K Non Bay Area location
Just blind 75
Ya I did notice neetcode.io Wasn’t really sure if dealing with patterns to understand the concept is right or first read the concepts. What is your strategy?
I'd read/watch videos about it first then do neetcode along the way.
usually Binary Trees, BSTs, BFS, DFS, Topological Sorting, Inorder, preorder, postorder traversals and maybe Dijkstra?
with heavy focus on bfs, dfs basically
Be comfy with n-Ary trees too. They’re rare but still.
Blind 75 leet code should be good start!! Also you forgot blind tax TC or GTFO ✌️
Ya I updated. Sorry my bad missed it.
Just DFS, bfs and topological sort will do. Never heard of anyone being asked kruskal’s, prim’s etc
I think it's more important to know the properties of trees, whether or not they're balanced, is there an order to the elements (eg binary search tree) or some other invariant (eg heap), if you have a static or dynamic tree, and what kinds of operations you're doing than the various types. A lot of libraries use red black trees but I've never had to implement the operations myself nor have I seen it on an interview question. I'd be more impressed by a candidate who said you could use a suffix trie when it's the correct answer even if they couldn't come up with the algorithm to build the trie than someone implementing a Fibonacci heap from scratch when it's the wrong approach.
Thanks this is helpful 👍🏻
It might be worth it to learn about the Segment tree ds. I was asked a question in a coding interview which needed segment tree.
yeah, Lc has a problem named “range sum query” which covers exactly that. Good point, surprised that they asked that
Omg what the f is that list. At that rate, forget it. I'll just make myself happy at Amazon. May be it is my destiny
😀
Bit unrelated, but want to ask what should be the good similar start for system designs intvws?
2024 Presidential Election
Yesterday
318
Trump verdict on election interference
2024 Presidential Election
Yesterday
716
Donald Trump Guilty!
Health & Wellness
Yesterday
1610
Se****ly deprived
2024 Presidential Election
Yesterday
989
Donald Trump has become America’s first felon president.
2024 Presidential Election
Yesterday
610
2024 - the last year America is a free nation
Bruh. You leaving us?
Jokes apart, use freecodecamp graph and DP videos. You will be able to solve most of the problems after that
Not really. But it’s good to be prepared considering the current situation. Don’t really want to be in a hole if something happens.