8ff4134c04
Co-authored-by: Santosh <Santosh.palande@apisero.com> |
||
---|---|---|
.. | ||
Arrays | ||
Dynamic-Programming | ||
Graphs | ||
Linked-Lists | ||
Maths | ||
Multiplication | ||
Queues | ||
Recursion | ||
Searching | ||
Sorting | ||
Stacks | ||
Strings | ||
Trees | ||
README.md |
README.md
C++
Arrays
- Counting Inversions
- Dutch Flag Algorithm
- Left Rotation
- Max Subarray Sum
- Shift Negatives
- Boyer–Moore Voting Algorithm
- Reverse Array
- Sorted-Rotated Search Array
- Fractional Knapsack
- Quick Selection
- Remove Duplicates
Dynamic-Programming
Graphs
Multiplication
Linked Lists
- All possible insertions
- Singly linked lists
- doubley linked lists
- Circular linked lists
- Removing Elements of given value
- Reversing a linked lists
- Merging two sorted linked lists
- Reorder List
Searching
- Linear Search
- Jump Search
- Binary Search
- Finding squareroot using Binary search
- KMP String Searching
- Ternary Search
- Interpolation Search
- Exponential Search
Stacks
Sorting
- Bubble Sort
- Insertion Sort
- Quicksort
- Selection Sort
- 3 way Quick Sort
- Bucket Sort
- Comb Sort
- Counting Sort
- heap Sort
- Radix Sort
- Shell Sort
- Binary Insertion Sort
- Merge Sort
- Wave Sort
Strings
- Rabin-Karp pattern search algo
- All subsequence of a string (Recursion)
- String reversal
- String tokanisation
- Anagram check
Trees
- Creating Binary Tree
- Counting and finding sum of all the nodes in BST
- Level Order Traversal
- Depth first Traversal
- Binary Search Tree
- In order morris traversal
- In order Predecessor and Successor
- Avl Tree
- Min Heap