- PrefixSum
- TwoPointer
- twoPointerWithoutDuplicates(int[],int);
- twoPointerWithDuplicates(int[],int);
- twoPointerInwards(int[]);
- twoPointerOutwards(int[]);
- DNFSort(int[]);
- BinarySearch
- BinarySearch(int[],int);
- searchFirstPos(int[],int);
- seachLastPos(int[],int);
- findPeakElement(int[]); - bitonic array
- rotatedSortedArray(int[],int); - pending
- Sqrt(int);
- Sorting
- Insertion
- MergeSort
- QuickSort
- Sliding Window
- cmt: 5 problems that comes under this pattern (needs to be added)
- Recursion
- BinaryTrees
- n-aryTrees
Topics yet to covered.
- Linked List
- BackTracking
- Breadth First Search
- Depth First Search
- Dynamic Programming
- Graphs
- Topological Sorting
- Greedy Algorithms
- Priority Queue
- Tries