# Practice Below Topics
- [x] Arrays,Sorting,Searching,Maths
- [x] Stacks and Queues (Aditya Verma)
- [x] Heaps (Don’t ignore this data structure)(Aditya Verma)
- [x] Hashmaps (Very important data structure)(Tech Dose)
- [ ] Binary Tree, Binary Search Tree
- [x] Tree (BFS/DFS)
- [x] Linked List
- [ ] Double ended queue
- [ ] Tries (Prefix-tree)
- [ ] Segment Tree (Tech Dose)
- [x] Graph (DFS/BFS) (tech dose)
- [ ] Disjoint sets
- [ ] Topological Sort

### Practice the following algorithms:
- [x] Depth First Search
- [x] Breadth First Search
- [x] Recursive and iterative pre-order traversal
- [x] Recursive and iterative post-order traversal
- [x] Recursive and iterative in-order traversal
- [x] Binary search algorithm on binary search trees and sorted arrays (Aditya Verma)
- [ ] Dijkstra and A-star
- [ ] Merge sort and Quick sort
- [ ] Dynamic Programming, Greedy Algorithms, Recursion (Aditya Verma)

### Patterns
- [x] Sliding Window (Aditya Verma)
- [x] DP On Trees (Aditya Verma)
- [x] Recursion
- [x] Infix expression (Stack)
- [x] Prefix/Postfix expression (Stack)

### Graph
- [ ] Topological Sort
- [ ] Djikstra Shortest Path
- [ ] Union Find
- [ ] Detect Cycle in Undirected Graph
- [ ] Detect Cycle in Directed Graph
- [ ] Minimum Spanning Tree (MST)
- [ ] Strongly Connected Component (SCC)

### Sites
- [ ] Check takeuforward youtube