## List
- [x] [[Array]]
- [ ] [[Complexity Analysis]]
- [ ] [[Queue]]
- [ ] [[Stack]]
- [ ] [[Linked List]]
- [ ] Tree
- [ ] Graph
- [ ] Time Complexity
- [ ] Space Complexity
- [ ] Searching
- [ ] Linear Search
- [ ] Binary Search
- [ ] Sorting
- [ ] Comparison Search
- [x] [[Selection Sort]]
- [ ] [[Bubble Sort]]
- [ ] Insertion Sort
- [ ] Merge Sort
- [ ] Quick Sort
- [ ] Heap Sort
- [ ] Cycle Sort
- [ ] 3-Way Merge Sort
- [ ] Non-comparison Search
- [ ] Counting Sort
- [ ] Radix Sort
- [ ] Bucket Sort
- [ ] Tim Sort
- [ ] Comb sort
- [ ] Pigeonhole sort
- [ ] Hybrid Search
- [ ] Intro Sort
- [ ] Tim sort
- [ ] Hashing
- [ ] Hash Set
- [ ] Hash Map
- [x] [[Two Pointer Technique]]
- [ ] Window Sliding Technique
- [ ] Prefix Sum Technique
- [ ] String
- [ ] Recursion
- [ ] Matrix/Grid
- [ ] Deque
- [ ] Heap
- [ ] Greedy Algorithm
- [ ] Dynamic Programming
- [ ] Trie
- [ ] Segment Tree
- [ ] Red-Black Tree
- [ ] Binary Indexed Tree
- [ ] Bitwise algorithms
- [ ] Backtracking algorithm
- [ ] Divide and conquer
- [ ] Branch and bound
- [ ] Geometric algorithm
- [ ] Random algorithm
- [ ] Path-finding algorithm
- [ ] Shortest path algorithm
- [ ] Minimum spanning tree algorithm
- [ ] BFS
- [ ] DFS
- [ ] NP-Hard
- [ ] NP-Complete
## References
- [Data Structures - Geeks for Geeks](https://www.geeksforgeeks.org/dsa/data-structures/)
- [Problem of the Day - Geeks for Geeks](https://www.geeksforgeeks.org/problem-of-the-day)
- [Beginner Guide to DSA - Hackernoon](https://hackernoon.com/a-beginners-guide-to-data-structures-and-algorithms)
- [DSA - Google](https://techdevguide.withgoogle.com/paths/data-structures-and-algorithms/?no-filter=true)