- This complete repository explains all concepts of Data Structure and Algorithm from basic to advanced.
- Different Sections have been listed as different Branches.
- For every section I have created a .ipynb file.
- In this section basic content has been explained.
- The process in which function calls itself directly or indirectly is called recursion.
- I have tried to give a good idea about recursion in this section.
- I have tried some important questions in this section.
- Big O Notation is a way of describing the performance or efficiency of the code.
- I have tried to discuss the idea of Big O in this section
- I have tried some important question based on Time Complexity in this section.
- I have tried to explain One dimensional and multi dimensional arrays
- Also tried few basic practice questions to get a better understanding of arrays
- I have discussed about lists
- List is a data structure that holds an ordered collection of items
- At the end I have also solved a simple quiz based on lists
- I have tried some important questions based on some important concepts related to Lists and Arrays
- Discussed about Dictionaries
- Tried some basic quiz questions
- Discuessed about Tuples
- Tried some basic quiz questions