I know this sounds stupid but... HELP ME WITH DSA
I am a student of computer engineering and starting to learn DSA. I am more into project stuffs. I like and do web dev projects. I know Javascript (obviously from web dev), Python (come on who does not know this lang) , and C as my college is of stone age.
The problem is DSA is vast and i do not know where to start at all. I know time complexity and Linked list, stack, queue theory and basic crude operation and binary/linear search
There are many terms like DS and devide and conquer, master theorem, greedy, dynamic programming etc. I do not know what are they i just know i have to study them and do not even know where to start what to learn.
DEVS PLEASE HELP ME CATEGORIES THESE TOPICS OR WHATEVER THERE IS
I know array,linked list, stack,queue, tree and graphs (still did not learnt yet) basic things with great knowledge of programming
Help me ðŸ˜
Top comments (1)
When I started DSA, I made the mistake of trying to learn everything at once and it just made things feel overwhelming.
In my opinion, a better way is to follow a simple path instead of jumping between topics.
Start with arrays and strings first. Just focus on solving easy problems until you’re comfortable with basic loops and patterns.
Then move to linked lists, stacks, and queues. These help you understand how data is structured and manipulated.
After that, start recursion and sorting. This is where you begin to see problem patterns instead of just syntax.
Once you’re okay with that, move to trees and binary search.
Graphs come after that, and only then things like DP and greedy start making sense.
This is just my experience, but trying to learn DP or greedy early usually doesn’t help much because you don’t have enough problem context yet.
Step-by-step practice worked way better for me than trying to cover everything at once.