I want to learn Data Structures and Algorithms. I want to do this for my knowledge sake and also to prepare for jobs.<p>So, where do i start ? which resources/books would you recommend ? How do i master Data Structures and Algorithms?
This subject has been discussed a lot of times and there is an insane number of content available for free. Even high quality courses from MIT, etc, all for free! From udacity, to udemy, to khan academy, to youtube, etc.<p>An example to get started apart from those millions of options you have available for free, there's:
"Grokking Algorithms: An illustrated guide for programmers and other curious people"
If you want to learn it for job interviews, I've got to say, just trawling through hacker rank[1] practice questions for C++. Read the question, attempt the question, read up on the theory behind the question and read the discussion pages. Then maybe attempt a similar question from some other very similiar sites. It's very possible to just cover all the possible questions and it's probably going to give you the tools you need to answer any interview coding test. The only real thing it sometimes doesn't give you is recognizing which algorithm to use for a specific problem - very often interview questions are very poorly disguised variations on "do you know what a dictionary is and how it's implemented".<p>To learn more deeply about algorithms I'd probably start off with MIT courses.<p>[1] - <a href="https://www.hackerrank.com/domains/cpp" rel="nofollow">https://www.hackerrank.com/domains/cpp</a>
i keep CLRS as a reference book and i regularly read a chapter on something i find interesting, it's been a great book in my collection. For lectures, i recommend the algorithms course by Robert Sedgewick on Coursera, his way of presenting the material is extremely clear. Here are some key things i think you should know : 1)analyzing time + space complexity - omega (lower bound), theta, and big o notation 2) quick sort, merge sort (study quick sort more extensively because the partitioning idea is used in other algorithms), radix sort (what does it mean when a sort is stable? why is this idea important) - radix sort is used in some string sorting algorithms 2)binary search 3)Binary Search Trees, maybe a little bit about B-Trees (this is more for personal knowledge than interviews) 4)dictionary implementation 5)Graph representation (adj-list-matrix) and graph processing algorithms (mainly DFS and BFS and what properties do they have? can you detect a cycle in a graph?) You could also study minimum spanning tree algorithms and shortest path algorithms 6)Backtracking 7)Dynamic programming 8)Greedy algorithms<p>finally get a leetcode account. In many leetcode problems you don't need to know alot of these things i mentioned but studying those topics will allow you to learn different ways of thinking about problems solving.
A year ago, I was like you. I can't understand a single piece of it. I went on sailing in the ocean of youtube videos. I did'nt even understand how Linked List works. I mean, I can really draw how it works but can't implement it. A month later, I realized that I was not strong in C/C++ pointers and structures. I tried to learn them again from scratch and then I kind of understood the implmentation. I started off with Linked Lists and then went on with stacks, queues and trees. I was not strong in C or C++ and that was the reason why I didn't understand basic concepts. If you want to learn data structures in C/C++, then make sure that you understand pointers and structures. If you choose to do it in Java or Python or some other language with OOP, then you should understand how Classes and Objects work and how to store the addresses of other objects of same class. I want to tell you one thing, take your time. Don't stress at all.
Stanford CS 161 undergrad algo course<p><a href="https://timroughgarden.org/videos.html" rel="nofollow">https://timroughgarden.org/videos.html</a><p>U Illinois CS 374 undergrad algo course<p><a href="https://jeffe.cs.illinois.edu/teaching/algorithms/" rel="nofollow">https://jeffe.cs.illinois.edu/teaching/algorithms/</a><p>If you are just looking for code in dozens of languages, Rosetta Code has many examples<p><a href="http://www.rosettacode.org/wiki/Category:Programming_Tasks" rel="nofollow">http://www.rosettacode.org/wiki/Category:Programming_Tasks</a><p>Best of Luck ;)
Practice building things.<p>My first personal software application was a diff tool that compared beautified code thereby ignoring differences due to whit space and comments. I eventually moved from a bunch of plugins to custom parsers and just figured it out through trial and error.
There's a list of resources here: <a href="https://github.com/tayllan/awesome-algorithms" rel="nofollow">https://github.com/tayllan/awesome-algorithms</a>
Very useful suggestions from the community but my question is that how often data structures are implemented on a real job like the way they are asked in the interview