- Activity Selection
- Adjacent Element Product
- Array Mirror Inverse
- Anagram Program
- Binary Search
- First Missing Positive Integer
- Finding possible codes using recursion
- Linear Search
- Max Sub Array Sum
- Painter Partition Problem
- Random Search Monte Carlo version
- Randomized selection algorithm
- Sum of Triplet
- Calculate Double Factorial
- Count of distinct elements in every window
- Longest substring without repeating characters
- Maximum Sum Subarray
- Knutt Morris Prat
- Catalan Number
- Z Algorithm
- CP Sets Question
- Boyer-Moore Voting Algorithm
- Suduko Solver
- Stock Span Problem
- Bulb Switcher problem
- Luhn's Algorithm
- Affine Substitution Cipher
- Caesar Cipher Algorithm
- Vigenere Cipher Algorithm
- Vernam Cipher
- Columnar Cipher
- Keyword Cipher
- Circular Linked List
- Fenwick Tree
- Infix to postfix
- Paranthesis Checker
- Preorder Traversal
- Queue All Functionality
- Queue implementation
- Queue Implementation with Linked List
- Singly Linked List Implementation
- Spiral Matrix
- Delete a linked list node function
- Bellman Ford Algorithm
- Implementation of Dijkstra's Algorithm
- Circular Queue
- Post Order Traversal
- Detect Middle Element of the LinkedList
- Postorder Traversal
- Stack Implementation with Array
- Stack Implementation with Linked List
- Evaluation Of Postfix Expression
- Iterative preorder traversal
- Iterative Postorder Traversal
- Iterative inorder traversal
- Implementation of maxHeap
- Implementation of minHeap
- Removing duplicates from sorted linked list
- Doubly Linked List Implementation
- Stack Using Queue
- Finding a pair of element
- Reverse Linked List
- Sparse Matrix using Linked List
- Leaf Nodes in Binary Search Tree
- Hash Table using Linear Probing
- Construction Of Binary Tree From Preorder And Inorder Traversals
- Double Ended Queue
- Merging two Linked List
- Binary Search
- Iterative-Binary Search
- Fibonacci Search
- Interpolation Search
- Linear Search
- Manacher's Algorithm
- Random Search Monte Carlo version
- Jump Search
- Bead Sort
- Heap Sort
- Bubble Sort
- Insertion Sort
- Matrix Sort
- Merge Sort
- Merge Sort in O(1) space complexity
- OddEven Sort
- Optimized Bubble Sort
- Selection Sort
- Shell Sort
- Bucket Sort
- Max_Min_HeapSort
- Radix Sort
- Counting Sort
- Three Way Merge Sort
- Shaker Sort
- Sort using Binary Search Tree
- EditDistance in Dp
- N-Queen
- Max_Sub_Square_Matrix
- Max_Sum_Rectangle_Matrix
- Implement Floyd-Warshall Algorithm
- House Robber
- Unique BST
add list here
- Binary Exponentiation
- Euler's Totient Function
- GCD By Euclidean Algorithm
- Sieve of Eratosthenes
- Armstrong Number
- Extended Euclidean Algorithm
- Happy Number
- Automorphic Number
- Karpekar Number
- Neon Number
- Strong Number
- Noble Integer
- Neon Number
- Find the Numbers
- Number_of_duplicates_using_Binary_search
- Russian Peasant Algorithm
- Tower of Hanoi
- Remove outermost parentheses
- Recursion count of substring
- Unique Number - III
- Left most non-repeating character in given string
- Nth Ugly Number
- Palindrome
- Concatenate two strings
- Affine Substitution Cipher
- Caesar Cipher Algorithm
- Check for subsequence
- Swap_Two_Nibbles
- Sudoku Solver
add list here