Data structures and algorithms implemented in Go. In this repository, you will find implementations of various data structures and algorithms, including sorting, searching, graph algorithms, and more.
- Arrays
- Linked List
- Stack
- Queue
- Tree
- Graph
- Hash Table
- Trie
- Heap
- Binary Search Tree
- Sorting
- Searching
- Graph Algorithms
- Dynamic Programming
- Greedy Algorithms
- Divide and Conquer
- Backtracking
- Branch and Bound
- Bit Manipulation
- Recursion
- Dynamic Programming
- Divide and Conquer
- Backtracking
- Branch and Bound
- Bit Manipulation
- Recursion
- Dynamic Programming
- Mixed (Different coding problems from different categories, like Leetcode, etc.)
- To improve my coding skills
- To be able to choose the right data structure and algorithm for the job
- To be able to implement data structures and algorithms from scratch
- To be able to understand and analyze the time and space complexity of data structures and algorithms
- To be able to implement common design patterns
- To be able to understand and analyze the time and space complexity of data structures and algorithms
- To be able to implement common design patterns
Contributions are welcome! If you have any suggestions or improvements, please open an issue or submit a pull request.
This project is licensed under the MIT License. See the LICENSE file for more details.