Implementation of various Algorithms.Examples are mainly taken from Karunamachi.
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Randomized Quick Sort
- Heap Sort
1. Build Min Heap
2. TopDown Heapify
3. BottomUp Heapify
4. Insert in Heap
5. DeleteMin
6. Increase Key
7. Decrease Key
1. Adjacency List Representation
2. Breadth First Search(BFS)
3. Depth First Search(DFS)
4. Shortest Path using Dijkstra's Algorithm
- Binary Search
- Divide Array: To get equal no of True and False
- Bitonic Array : To find the position where the array is strictly decreasing after strictly increasing from beginning
- K-Nearest Neighbours : To find k-nearest neighbours in an array
- Longest Common Substring : Finding Longest Common Substring using Rabin-Karp algorithm and Rolling-Hashing
- Maximum & Minimum No b/w 2 nodes in BST : Finding the maximum and minimum number between 2 nodes of BST if there exists a unique path using LCA(Least Common Ancestor)
- Costly Phone Number : https://www.hackerearth.com/practice/algorithms/graphs/shortest-path-algorithms/practice-problems/algorithm/costly-phone-number-december-easy-easy-medium/description/
- Coloring Trees : https://www.hackerearth.com/practice/algorithms/graphs/graph-representation/practice-problems/algorithm/coloring-the-tree-7e8a557a/
- Course Schedule II : https://leetcode.com/problems/course-schedule-ii/submissions/
- Number of Operations to Make Network Connected : https://leetcode.com/problems/number-of-operations-to-make-network-connected/
- Longest Happy String : https://leetcode.com/problems/longest-happy-string/
- Yet Another Array Problem! : https://www.hackerearth.com/practice/algorithms/greedy/basics-of-greedy-algorithms/practice-problems/algorithm/yet-another-array-problem-2/description/
- Possible Sums : https://www.hackerearth.com/practice/algorithms/dynamic-programming/2-dimensional/practice-problems/algorithm/possible-sums-5/description/