- Activity Selection
- Adjacent Element Product
- Array Mirror Inverse
- Arrays Duplicate Elements
- Anagram Program
- First Missing Positive Integer
- Finding possible codes using recursion
- 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
- Prefix Sum of Array
- Reverse String using Recursion
- Knutt Morris Prat
- Catalan Number
- Two Pointer Method
- Z Algorithm
- CP Sets Question
- Boyer-Moore Voting Algorithm
- Suduko Solver
- Stock Span Problem
- Bulb Switcher problem
- Luhn's Algorithm
- Lexicographical rank of a string
- Median of two sorted arrays
- Trapping rain water
- Max Consecutive Ones
- Maximum possible length of balanced bracket sequence
- Bigmod Algorithm
- Affine Substitution Cipher
- Caesar Cipher Algorithm
- Vigenere Cipher Algorithm
- Vernam Cipher
- Columnar Cipher
- Keyword Cipher
- Rail Fence Cipher
- MonoAlphabetic Cipher
- Hill Cipher
- Playfair Cipher
- Burrows Wheeler Transform
- Check for subsequence
- Swap_Two_Nibbles
- Sudoku Solver
- AVL Tree
- Balanced Parenthesis using Stack
- Circular Linked List
- Fenwick Tree
- Infix to postfix
- Infix To prefix
- Paranthesis Checker
- Reverse individual words of a string using stacks
- Preorder Traversal
- Queue All Functionality
- Queue implementation
- Queue Implementation with Linked List
- Rabin karp
- Singly Linked List Implementation
- Spiral Matrix
- Delete a linked list node function
- Bellman Ford Algorithm
- Implementation of Dijkstra's Algorithm
- Circular Queue
- Detect Middle Element of the LinkedList
- Detect Loop/Cycle in a LinkedList
- Inorder Traversal
- 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
- Inorder Predecessor and Successor in BST
- Stack Using Queue
- Infix to Postfix Conversion
- Finding a pair of element
- Reverse Linked List
- Sparse Matrix using Linked List
- Leaf Nodes in Binary Search Tree
- Open Hashing
- Hash Table using Linear Probing
- Construction Of Binary Tree From Preorder And Inorder Traversals
- Double Ended Queue
- Merging two Linked List
- Ascending Priority Queue
- Descending Priority Queue
- Finding Linked List Palindrome
- Priority Queue using Linked List
- Sorting the elements of a stack
- Postfix to Prefix Conversion
- Finding Minimum Element in a Stack
- Hashtable chaining
- Find Route Between Two Nodes
- Check Binary Tree is BST or Not
- Remove Duplicates From an Unsorted Linked List
- First Fit Memory allocation
- Adjacency Matrix in C
- Worst Fit Memory allocation
- Best Fit Memory allocation
- Palindrome Checker using doubly linked list
- Queue using Circular Array
- Reverse Queue using stack
- Prefix to Postfix Conversion
- Binary Search
- Iterative-Binary Search
- Fibonacci Search
- Interpolation Search
- Linear Search
- Manacher's Algorithm
- Random Search Monte Carlo version
- Jump Search
- Staircase Search
- Bead Sort
- Heap Sort
- Bubble Sort
- Circle Sort
- Insertion Sort
- Count Inversions
- Matrix Sort
- Merge Sort
- Merge Sort in O(1) space complexity
- OddEven Sort
- Optimized Bubble Sort
- Selection Sort
- Shell Sort
- Stooge Sort
- Bucket Sort
- Max_Min_HeapSort
- Radix Sort
- Counting Sort
- Three Way Merge Sort
- Tim Sort
- Pigeon Hole Sort
- Shaker Sort
- Sort using Binary Search Tree
- Comb Sort
- Iterative Merge Sort
- Quick Sort
- Wiggle Sort
- Gnome Sort
- Cutting a Rod
- EditDistance in Dp
- Golomb Sequence
- Longest Common Substring
- Longest Decreasing Subsequence
- Longest Increasing Subsequence
- Longest Common Subsequence
- N-Queen
- Max_Sub_Square_Matrix
- Max_Sum_Rectangle_Matrix
- Maximum Sum Increasing Subsequence
- Maximum Sum Decreasing Subsequence
- Implement Floyd-Warshall Algorithm
- House Robber
- Unique BST
- Tiling_Problem
- Kruskal's Algorithm
- Prim's Algorithm
- Breadth First Search
- Number of Connected Components
- Minimum distance of each node using SSSP on trees by DFS
- Adjacency List
- Warshall Algorithm
- Toggle k-th bit of a number
- Reverse bits of a Number
- Count number of set bits in a number
- Rotate bits of a Number
add list here
- Binary Exponentiation
- Euler's Totient Function
- Number of Divisors of a Number
- GCD By Euclidean Algorithm
- Check whether a number is power of 2
- Sieve of Eratosthenes
- Sum of Digits
- Armstrong Number
- Sum of Divisors of a Number
- Extended Euclidean Algorithm
- Find factorial of a Number
- Happy Number
- Lucas Number
- Lowest Prime Factor
- Automorphic Number
- Karpekar Number
- Krishnamurthy Number
- Strong Number
- Reverse Number
- Neon Number
- Noble Integer
- Number of Digits
- Magic Number
- Perfect Number
- Matrix Addition
- Matrix Subtraction
- Matrix Multiplication
- Matrix Transpose
- Symmetric Matrix
- Mystery Number
- Palindrome
- Decimal to Binary
- Pascal's triangle
- Decimal to Hexadecimal conversion
- Polynomial Addition
- Polynomial Multiplication
- Special Number
- Pronic Number
- Quadratic Equation
- Binary to Decimal Conversion
- Find the Numbers
- Find First and Last position index of an element in an array
- Number_of_duplicates_using_Binary_search
- Russian Peasant Algorithm
- Sliding Window Technique
- Tower of Hanoi
- Remove outermost parentheses
- Recursion count of substring
- Unique Number - III
- Left most non-repeating character in given string
- MEX of an Array
- Nth Ugly Number
- Palindrome
- Find Union and Intersection of two Sorted arrays
- Concatenate two strings
- String Palindrome
add list here