Solved problems and assignments of DSA course
Topics discussed are:
- Recursion - 1
- Recursion - 2
- OOPS - 1
- OOPS - 2
- OOPS - 3
- Time Complexity Analysis
- Space Complexity Analysis
- Time Complexity Improvement
- Linked List - 1
- Linked List - 2
- Stacks
- Queues
- Binary Trees - 1
- Binary Trees - 2
- BST - 1
- BST - 2
- Generic Trees
- Dictionaries/Maps
- Graphs - 1
- Graphs - 2
- Priority Queues - 1
- Huffman Coding
- Priority Queues - 2
- Dynamic Programming - 1
- Recursion - 3
- Dynamic Programming - 2
- Backtracking
- Advanced Data Structures and Algorithms
For contributing, please read Contributing.md. Now, merging hacktober PRs.
Download Jupyter notebook from here: https://jupyter.org/
Installing Jupyter notebook: https://jupyter.org/install
If you're not comfortable with Jupyter notebooks then you can use Repl.it (Online Editor): https://repl.it/languages/python3
Note: Refer serial wise to avoid confusion and non-understanding of topics.
After this course completion, I recommend to have a look on these MIT lectures to get in depth knowledge of data structures and algorithms: https://www.youtube.com/playlist?list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb