Best Order to Learn Algorithms & Data Structures

#neetcode #leetcode #python

[rulercostax]

Bro explained DSA roadmap using DSA analogy and expected beginners to understand

[vigneshs]

Bro explaining algorithm with algorithm😂😂

[Kaczynskibutnotted]

Breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts at the tree root and explores all nodes at the present depth prior to moving on to the nodes at the next depth level. Extra memory, usually a queue, is needed to keep track of the child nodes that were encountered but not yet explored.
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking. Extra memory, usually a stack, is needed to keep track of the nodes discovered so far along a specified branch which helps in backtracking of the graph.

[adi_cs]

You need to update the 'Stack' section. More than half of the questions in there are related to dynamic programming and don't even need a stack to solve them

[jks]

Here's my theory on learning in general.

Learning is more like learning how to drive than it is...

Memorizing a manual.

When you learn how to drive, there is a huge gap between knowing how to do it, and being able to do it.

What is the gap?

Essentially, having the trained neural networks in your brain.

You train neural networks with immense collections of data.

I personally would approach it like training a neural network.

This means...

1) Gather as much labeled data as possible. Look at the terms, concepts, answers, and the questions and process their reasoning.
2) Do far more than you think would be enough to "get it logically". You're not trying to get to the point to get it logically. You're looking to get to the point where you are an optimally-trained model.
3) Backpropagate and error correct. When you get something wrong, trace your reasoning back and see exactly why your network didn't connect it. Adjust that node in your mind.
4) Repeat this constantly.

In my opinion, this view gives you the sort of philosophy that makes being good at this inevitable.

To put that philosophy in words... it means that no one is perfect at this, and it means that your measure for success is not getting it right. It is "having a powerfully trained model".

Or in layman terms, your considerations and the process that emerges from your mind on how to solve this new problem is structured in such a way that it quite reliably takes you to the correct answer as your model runs through the novel problem.

Put more concisely, you want to optimize for a well-trained problem-solving approach mental model.

Not “try to get everything right”. That’s too information-poor.

Optimizing the problem-solving model is far more possible.

[kanishkkala]

this reels time is iconic, just solved max path sum problem of trees, i feel gd understanding this reel fully

[umkasiberia]

this reminded me that I'm subscribed to neetcode! gotta go back and grind the dsa

[lordmahakaal]

Can you upload this learning path image?

[StreetfighterBrah]

Let me give you a real life example of BFS and DFS.

Lets say you are working on a project where you send a file through-frontend, and the server sends a file (processed).

BFS is when you complete every single step properly before moving onto next one. You create a clean front-end with CSS, JS and error handling and all. And move onto server, process the data, handle errors there and send the file.

DFS is when you create an input element to send the file to the server. You process the data in the file, and send it back to the front-end. (You reached the outcome of your project first) And only then you cover error handling and design and all of that other stuff.

So, depth first is where you reach the absolute depth and come back to the top collecting all of the remaining infinity stones where breadth first is you collect all of the stones around you at each step of your journey.

[MdKamrulIslam-loxn]

Bro used Recursion irl: used Algorithms to make beginners learn Algorithms.

[vishaltiwari]

Its a graph, and topological sorting can be used to study

[darrowthered]

Do a topological sort to get the real order

[lalalander]

Gotta look at most frequently asked before the interview and do A+ search the night b4

[benjamin]

BFS might not work either because that doesn't solve the problem of possibly reaching nodes without doing the prerequisites first. You'd need a topological sort in other words.

[rlyehdate]

Does exist a website to navigate these concepts one by one on this holy order given?

[hansu]

Well, another strategy would be to attack here and there. It works (depends on your background).

[KeL-rz]

Not a fan of the array first tbh. Array has so many different techniques

[JohnWasinger]

Anybody have a link to this learning forest that he’s using as an example?

[vteckickedin]

imo, if you understand these concepts (e.g. in my case I've almost finished my cs degree so I know the concepts, but I still need more practise) its better to vary your practise. Studies show this is more effective

[niccolomedici]

How can I read these tiny letters? Am I missing something?