- Queue
- Stacks
- Linear Probing in Hashing
- Tree (includes Traversals - in,pre,post-order)
- Quadratic Probing in Hashing
- Tree (Level Order Traversal)
- Reverse Linked List
- Binary Search Tree
- Binary Search Tree (Level Order Traversal)
- Leaf Nodes in a Binary Search Tree
- Reverse Linked List in groups
- Identical BSTs
- Loop detection in Linked List
- Right view of a binary tree
- Rotate the array by k elements
- Stack using list
- Maximum distance between same elements
- Double Ended Queue
- Priority Queue
- First fit memory allocation
- Worst fit memory allocation
- Best fit memory allocation
- Reverse First K elements of Queue
- Prefix to postfix
- Lowest Common Ancestor of Binary Search Tree
- Reverse Queue Using Stack
- Bilinear Search
- Binary Search
- Breadth First Search
- Depth First Search
- Fibonacci Search
- Linear Search
- Random Search Las vegas version
- Sublinear Search
- Exponential Search
- Binary Search Iterative
- Unbounded Binary Search
- 8 Puzzle Problem (BFS)
- 8 Puzzle Problem (A* Algorithm)
- Bilinear Search
- Binary Search
- Breadth First Search
- Depth First Search
- Fibonacci Search
- Linear Search
- Random Search Las vegas version
- Sublinear Search
- Exponential Search
- Binary Search Iterative
- Jump Search
- Bead Sort
- Bubble Sort
- Gnome Sort
- Comb Sort
- Heap Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Radix Sort
- Selection Sort
- Topological Sort
- Intro Sort
- Merge Sort Sequantial
- Merge Sort Parallel
- Tim Sort
- Binary Tree (Post order transversal)
- Circular Linked List
- Infix To Postfix Conversion
- Linked List Intersection
- Palindrome using doubly linked list
- Queue
- Stacks
- Infix to Postfix Conversion
- Reverse individual words of a string using stacks
- 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
- Remove Zero Sum Consecutive Nodes from Linked List
- Sum of Linked List
- Left view of a binary tree
- Anagram Checker
- Anagram Problem
- 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
- Climbing the Leaderboard
- Dutch national flag problem
- Find Intersection of Two Given Linked Lists
- Maximum value of each subarray of size k
- Count the number of anagrams
- Hailstone Sequence
- Next Permutation
- Minimize Amplitude After K Removals
- Median of two sorted array
- Find First and Last Position of Element in Sorted_Array
- Trapping rain water
- Max of Adjacent Elements Product
- Generating Power Set
- Run Length Encoding
- Affine Cipher
- Caesar Cipher
- Vigenere Cipher
- RSA Algorithm
- Burrows Wheeler transform (BWT)
- XOR Cipher
- AES Algorithm
- Playfair Cipher
- Keyword Cipher
- Vernam Cipher
- Columnar Cipher
- Rail Fence Cipher
- Hill Cipher
- Monoalphabetic Cipher
- Diffie Helman Protocol
- 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
- Three Sum Problem
- Bubble Sort
- Bogo 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
- Tree Sort
- Wiggle Sort
- Counting Sort
- Tim Sort
- Cryptarithmetic Problem
- N Queens Problem
- Knight's Tour
- Hamiltonian Cycle
- Sudoku Solver
- Subset Sum
- Rat-In-Maze problem
- Maze Generation Visualiser
- M Coloring Problem
- Tic Tac Toe Game
- Tug Of War
- Water Jug Problem
- Coin Change Problem
- Cutting A Rod
- Longest Common Subsequence
- Longest Common Substring
- Longest Decreasing Subsequence
- Longest Increasing Subsequence
- Binary Trees with N nodes
- Unique BST with N nodes
- Edit Distance
- Golomb Sequence
- Knapsack Unbounded
- Knapsack 0-1
- Knapsack Fractional
- Maximum Sum Increasing Subsequence
- Maximum Sum Decreasing Subsequence
- Ugly Numbers
- Dice Throw Problem
- Partition Problem
- Matrix-Chain-Multiplication
- Count Derangements
- Subset Sum
- Maximum Profit
- Tiling Problem 2xN
- Coin Tower
- House Robber
- Catalan Number
- Longest Bitonic Subsequence
- BFS in Maze
- DFS in Maze (Recursive)
- DFS in Maze (Iterative)
- Dijkstra's Algorithm in Maze
- A* (Astar) in Maze
- RRT 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
- Top view of binary tree
- Warshall Algorithm
- 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
- Chocolate Distribution Problem
- Sort an Arrays of 0s, 1s, 2s
- Activity Selection
- 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
- Amazon Alexa Reviews Analysis
- Ames House Price Prediction
- Churn Risk Score Prediction
- Decision Tree
- E-Mail Classification
- Flight Delay Prediction
- Ice Cream Revenue Prediction
- Income Classification
- Iris Classifier using Keras
- K Nearest Neighbor
- Laptop Price Prediction
- Linear Regression
- Linear Regression using PyTorch
- Loan Eligibility Prediction
- Logistic Regression
- Mobile Price Range Classification
- NASA Asteroids Classification
- Naive Bayes Algorithm from Scratch
- Numeric Outlier Selection
- Principal Component Analysis
- Solar Radiation Prediction
- Questions to Subject Classification
- Support Vector Machine
- Startup Profit Prediction
- Logically Weighted Regression
- Bell State creation
- Naive Bayes Classifier
- White Wine Quality Prediction
- Area
- Binary Exponentiation
- Delannoy Number
- 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
- Min Max Sum
- 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
- Next nth Palindrome
- Sine Function
- Sum of Digits of a Number
- Sterns Diatomic Series
- Arctan Function
- Strong Number
- Noble Integer
- Next Prime Number
- Happy Number
- Magic Number
- Hamming Distance
- Natural Algorithm
- K-th Largest Number
- Transpose of matrix
- Tribonacci
- Neon Number
- Matrix addition
- Matrix Multiplication
- Sum of Divisors
- Count of Divisors
- Reverse a Number
- Count of Digits
- Lucky Numbers
- Perfect square less than n
- Perfect Number
- Harshad Number
- Roots of Quadratic Equation
- Sieve of Eratosthenes
- Pronic Number
- Positive Decimal to Binary
- Squares in N*N Chessboard
- Number of Bits to be flipped to Inter-convert Two numbers
- Toggle K-th bit
- Reverse bits of a Number
- Left Rotate bits of a Number
- Check Collinearity of Three Points
- Right Rotate bits of a Number
- Count of Set bits in a Number
- Minimum XOR value
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
- Triplet Sum in Array
- Longest Consecutive Subsequence
- Maximum Product Subarray
- Rearrange the negative and positive elements
- Find if there is a subarray with 0 sum
- Common Elements
- Count pair with given sum
- Best Time to Buy and Sell Stock
- Next premutation
- Minimum number of jumps
- Union of two arrays
- Array Rolation
- Tower of Hanoi
- Count Articles
- Wave Array
- Merge Interval
- Kth index removal
- Display all possible keypad sequences for a given number
- Arrange The String
- Finding equilibrium point in the array
- Segment Tree