- Depth First Search
- Breadth First Search
- Matching paranthesis
- Hash Tables
- Variables/Pointers manipulation
- reverse linked list (duplicates , removing duplicates)
- sorting fundamentals (quicksort, mergesort, bubblesort techniques, runtime of a sort, time space complexity)
- Recursion
- Custom data structures (object oriented programming)
- Binary search
- Logarithm (Complexity Analysis)
- Graph Traversals (BFS & DFS)
- Binary Search
- Sliding Window
- Recursion
- 2 Algorithms (Inverting a binary tree & Reverse a Linked List)
- Suffix Trees
- Heaps
- DP
- Sorting Algorithms (Quick & Merge)