- Palindrome using doubly linked list
- Queue
- Stacks
- Infix to Postfix Conversion
- Tree (includes Traversals - in, pre, post-order)
- Tree (Level Order Traversal)
- Trie
- Diameter Of Binary Tree
- Dynamic Stack
- Dynamic Queue
- Invert a Binary Tree
- AVL Tree
- Linked List Intersection
- Sparse Matrix Operation
- Swapping Nodes of a Linked List
- Binary Search Tree Validation
- Implementation of Stack using queues
- Singly Linked List
- Anagram Checker
- Find Least positive number
- KMP Algorithm
- Longest Palindrome Substring
- Longest Common Prefix
- Maximum sum of k consecutive elements in an array
- Maximum Subarray Sum
- Rabin Karp Algorithm
- Target sum triplet
- Triplets with Zero Sum
- Maximum sum rectangle
- Maximum Water Container
- Smallest sum subarray
- Count ways to Nth stair (Staircase Problem)
- Delete a node from linked list
- Rain Water Harvesting
- Search Insert Position
- Stock span problem
- Bulb Switcher problem
- Vowels and consonants in a string
- Letter Count in a word
- Cyclically Rotate Clockwise
- Prime factorization using sieve
- Stable Marriage Problem
- House Robber
- Number of K-Length Sublists with Average at Least Target
- Fence Painting Algorithm
- Affine Cipher
- Caesar Cipher
- Vigenere Cipher
- RSA Algorithm
- Burrows Wheeler transform (BWT)
- XOR Cipher
- AES Algorithm
- Bilinear Search
- Binary Search
- Breadth First Search
- Depth First Search
- Exponential Search
- Interpolation Search
- Linear Search
- Random Search Las vegas version
- Random select
- Sublinear Search
- Z-Algorithm
- Jump search
- Bubble Sort
- Optimized Bubble Sort
- Selection Sort
- Insertion Sort
- Quick Sort
- Heap Sort
- Merge Sort Sequantial
- Merge Sort Parallel
- Cocktail sort
- Intro-sort
- Bead Sort
- Matrix Sort
- Pancake Sort
- Radix Sort
- Shell Sort
- Topological Sort
- Sleep Sort
- Bucket Sort
- Coin Change Problem
- Longest Common Subsequence
- Longest Increasing Subsequence
- Binary Trees with N nodes
- Unique BST with N nodes
- Edit Distance
- Knapsack Unbounded
- Knapsack 0-1
- Knapsack Fractional
- Ugly Numbers
- Dice Throw Problem
- Partition Problem
- Matrix-Chain-Multiplication
- BFS in Maze
- DFS in Maze (Recursive)
- DFS in Maze (Iterative)
- Dijkstra's Algorithm in Maze
- A*(Astar) in Maze
- Breadth First Search
- Depth of Tree
- Height of Tree
- Kruskal's Algorithm
- Prim's Algorithm
- Prim's Algorithm - Dynamic
- Dijkstra's Algorithm
- Topological Sort/Ordering
- Hamiltonian Path
- Articulation Point
- Connected Components
- Strongly Connected Components - Kosaraju's Algorithm
- Strongly Connected Components - Tarjan's Algorithm
- Bipartite Graph
- Directed Acyclic Graph
- Detect Negative Cycle
- Depth First Search
- Bellman Ford
- Rotten Oranges
- Anagram Checker
- Find Least positive number
- KMP Algorithm
- Longest Common Prefix
- Maximum sum of k consecutive elements in an array
- MaxSub Array Sum
- Prime factorization using sieve
- Rabin Karp Algorithm
- Target sum triplet
- Triplets with Zero Sum
- Maximum sum rectangle
- Search Insert Position
- Maximum Water Container
- Smallest sum subarray
- Delete a node from linked list
- Stable Marriage Problem
- Rain Water Harvesting
- House Robber
- Affine Cipher
- Caesar Cipher
- Vigenere Cipher
- RSA Algorithm
- XOR Cipher
- AES Algorithm
- Floyd Warshall Algorithm
- Knight Walk
- Bridge Edge in Graph
- Euler Circuit and Path
- Decision Tree
- Iris Classifier using Keras
- K Nearest Neighbor
- Linear Regression
- Linear Regression using PyTorch
- Logistic Regression
- Numeric Outlier Selection
- Principal Component Analysis
- Support Vector Machine
- Logically Weighted Regression
- Area
- Binary Exponentiation
- Least Common Multiple (LCM)
- GCD - Euclidean Algorithm
- Extended Euclidean Algorithm
- Fibonacci Sequence Recursion
- Factorial
- Double Factorial
- Large Number Factorial
- Sieve of Eratosthenes
- Fibonacci number
- Fibonacci number with Recursion
- Check Armstrong Number
- Strassen's Matrix Multiplication
- Ackermann Function
- Chinese Remainder theorem
- Ugly Number
- Prime Number Iterative and Recursive
- Catalan Number
- Lucas Theorem
- GCD of 2 Numbers
- Palindrome
- Sine Function
- Arctan Function
- Strong Number
add list here
- Check Inversion
- Count Inversions
- Distinct Elements Count
- Find frequency using Binary Search
- Kadane's Algorithm
- Longest Substring
- Merging Sorted arrays
- Maximum Square Matrix with all 1's
- Possible Code Recursion
- Reverse a string using stack
- Russian Peasant Algorithm
- Ocurrence of a number using binary search
- Moore's Algorithm
- Satellite Image analysis using Numpy
- Happy Number
- Subsequence Recursion
- Swap 2 nibbles
- Find leftmost non repeating character
- Subsequence check
- Painter Partition Probelm-
- Remove Outermost Paranthesis
- Find the Numbers
- Count Triplets with Sum of Two Equal to the Third One
- Sudoku Solver
- Longest substring without repeating character
- Dutch National Flag Algorithm Implementation in Python
- Ploting Diffrent Graphs in Python
- Remove Minimum Number of Parenthesis for Balanced String