A curated list of data structures and algorithms.
- Binary Indexed Tree
- Circular Queue
- Codec
- Euclidean Algorithm
- Fisher–Yates Shuffle
- Hash Table
- Heap Sort
- Iterative Traversal
- Kadane's Algorithm
- Kruskal's Algorithm
- Longest Increasing Subsequence
- LRU Cache
- Merge Sort
- Minimum Swap
- Newton's Method
- Next Permutation
- Prim's Algorithm
- Quick Sort
- Reservoir Sampling
- Sieve of Eratosthenes
- Trie
- Union-Find
Design patterns are typical solutions to common problems in software design. Each pattern is like a blueprint that you can customize to solve a particular design problem in your code:
We love contributions! Before submitting a Pull Request, it's always good to start with a new issue first.
This repository is licensed under MIT. Full license text is available in LICENSE.