This repository was created for me to better understand and reinforce computer science fundamentals in data structures and algorithms. This project has two main goals. First, is to go over all of the core and important data structures and algorithms used in computer science. The second goal is to have at least 15 practice exercises per category in data structures and in algorithms. I hope you find this repository useful and informative as well.
.
├── ds-algos # Main project folder
│ ├── algorithms # Stores all exercises and learning material associated with algorithms.
│ │ ├── ... # This would be a folder for any concept or algorithm topic.
│ │ │ ├── exercises # Would store all exercises associated with the current algorithm topic.
│ │ │ │ ├── ... # Code solutions (source code) files
│ │ │ │ └── README.md # A readme with a list of problem exercises and a sort of table of contents of all exercises.
│ │ │ ├── ... # Code implementation for the current algorithm topic.
│ │ │ └── README.md # A readme with explanations and theory for the current algorithm topic.
│ │ └── ...
│ ├── data-structures # Stores all exercises and learning material associated with data structures.
│ │ ├── ... # This would be a folder for any data structure topic.
│ │ │ ├── exercises # Would store all exercises associated with the current data structure topic.
│ │ │ │ ├── ... # Code solutions (source code) files
│ │ │ │ └── README.md # A readme with a list of problem exercises and a sort of table of contents of all exercises.
│ │ │ ├── ... # Code implementation for the current data structure topic.
│ │ │ └── README.md # A readme with explanations and theory for the current data structure topic.
│ │ └── ...
│ └── concepts # Store all core concepts you need to understand
│ └── README.md # A readme file with a list of core concepts
├── LICENCE # This projects licence file
└── README.md # This File
Each topic (any folder within either data-structures or concepts-algorithms) has a readme file in that folders root, this readme would be an overview/explanation for the current topic. In addition, each topic has a sub-folder called exercises and inside that there is an additional readme file to be a sort of table of contents of all exercises associated with that topic.
When using this resource it is best to start with going over some core concepts in the concepts folder. After you have reviewed some important computer science concepts it is recommended for you to continue with data structures as most algorithms implement many of the core computer science data structures. Whether you are exploring data structures or algorithms it is best to check out how the specific topic is implemented first before moving in to their exercises.
- Big O
- Memory(stack vs heap)
- Recursion
- Dynamic Programming
- Bit Manipulation
- P vs NP
- Concurrency
- Hill Climbing
- Simulated annealing
- Insertion Sort
- Selection Sort
- Bubble Sort
- Merge Sort
- Quick Sort
- Counting Sort
- Heap Sort
- Bucket Sort
- Topological Sort
- Shortest Path in Maze (Lee algorithm)
- Flood Fill
- Prorder Traversal
- Inorder Traversal
- Postorder Traversal
- Floyd's Cycle Detection
- Kadane's Algorithm
- Longest Increasing Subsequence
- Union Find Algorithm
- Minimum Spanning Tree (Kruskal's algorithm)
- Single-Source Shortest Path (Dijkstra's algorithm)
- All-Pairs Shortest Paths (Floyd Warshall Algorithm)
- Backtracking Algorithms
This Project is under the BSD 3-Clause licence.
It is 100% free for personal and commercial use.
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent