- Binary Search Tree
- Binary Tree
- Doubly Linked List
- Hashtable with separate chaining
- Heap Sort
- Linked List
- Max and Min heap Implementation
- Nodes At A Distance K From A Given Target Node In A Binary Tree
- Priority Queue
- Queue
- Queue Linked list
- Red-Black Tree
- Singly Linked List
- Stack Using Array
- Stack Using Linked List
- Tim Sort
- Trie Implementation
- Updated Reverse Linked List
- Bubble Sort
- Counting Sort
- Heap Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Randomized Quick Sort
- Selection Sort
- Shell Sort
- Topological Sort
- Breadth First Search Tree Traversal
- Dijkstra's Algorithm
- In-order (LNR) Tree Traversal
- Kosaraju's Algorithm
- Kruskal's Algorithm
- Post-order (LRN) Tree Traversal
- Pre-order (NLR) Tree Traversal
- Prim's Algorithm <<<<<<< HEAD
- Kosaraju's Algorithm
- FloodFill Algorithm =======
master
add list here
- Ackermann_Function
- Binary Exponentiation
- Euler's_Totient_Function
- Extended Euclidean Algorithm
- Sieve of Eratosthenes
- Coin Change Problem
- Edit Distance
- Fibonacci number with bottom-up approach
- Fibonacci number with top-down approach
- Longest increasing subsequence
- Longest common subsequence
- String permutations
add list here
- Array Right Rotation Naive Approach
- Check whether two strings are anagrams or not
- Contiguous Sub Array with Given Sum
- Elements Occurrence using Binary Search
- Find number of digits in an integer
- Intersection Point of Y shaped LinkedList
- Infix to Postfix
- Kadane's Algorithm for max sum subArray
- Knuth–Morris–Pratt_algorithm
- Maximum in Array
- Reverse words in Given String
- Infix to Postfix
- Target sum triplets
- 2-D MatrixSorting algorithm