Python
undefined
Geometry
Audio Filters
Backtracking
All Combinations
All Permutations
All Subsequences
Coloring
Combination Sum
Crossword Puzzle Solver
Generate Parentheses
Hamiltonian Cycle
Knight Tour
Match Word Pattern
Minimax
N Queens
N Queens Math
Power Sum
Rat in Maze
Sudoku Solver
+1
Sum of Subsets
Word Break
Word Ladder
Word Search
Sudoku Solver
+1
Word Break
Word Search
Bit Manipulation
Binary and Operator
Binary Coded Decimal
Binary Count Setbits
Binary Count Trailing Zeros
Binary or Operator
Binary Shifts
Binary Twos Complement
Binary Xor Operator
Bitwise Addition Recursive
Count 1s Brian Kernighan Method
Count Number of One Bits
Excess 3 Code
Find Previous Power of Two
Gray Code Sequence
Highest Set Bit
Index of Rightmost Set Bit
Is Even
Is Power of Two
Largest Pow of Two Le Num
Missing Number
Numbers Different Signs
Power of 4
Reverse Bits
Single Bit Manipulation Operations
Swap All Odd and Even Bits
Blockchain
Diophantine Equation
Boolean Algebra
And Gate
Imply Gate
Karnaugh Map Simplification
Multiplexer
Nand Gate
Nimply Gate
Nor Gate
Not Gate
Or Gate
Quine Mc Cluskey
Xnor Gate
Xor Gate
Cellular Automata
Conways Game of Life
Game of Life
Langtons Ant
Nagel Schrekenberg
One Dimensional
Wa Tor
Ciphers
A 1z 26
Affine Cipher
Atbash
Autokey
Baconian Cipher
Base 16
Base 32
Base 64
Base 85
Beaufort Cipher
Bifid
Brute Force Caesar Cipher
Caesar Cipher
Cryptomath Module
Decrypt Caesar with Chi Squared
Deterministic Miller Rabin
Diffie
Diffie Hellman
Elgamal Key Generator
Enigma Machine 2
Fractionated Morse Cipher
Gronsfeld Cipher
Hill Cipher
Mixed Keyword Cypher
Mono Alphabetic Ciphers
Morse Code
Onepad Cipher
Permutation Cipher
Playfair Cipher
Polybius
Porta Cipher
Rabin Miller
Rail Fence Cipher
Rot 13
Rsa Cipher
Rsa Factorization
Rsa Key Generator
Running Key Cipher
Shuffled Shift Cipher
Simple Keyword Cypher
Simple Substitution Cipher
Transposition Cipher
Transposition Cipher Encrypt Decrypt File
Trifid Cipher
Vernam Cipher
Vigenere Cipher
XOR Cipher
+3
Compression
Burrows Wheeler
Huffman
Lempel Ziv
Lempel Ziv Decompress
Lz 77
Peak Signal to Noise Ratio
Run Length Encoding
Computer Vision
Cnn Classification
Flip Augmentation
Haralick Descriptors
Harris Corner
Horn Schunck
Mean Threshold
Mosaic Augmentation
Pooling Functions
Conversions
Astronomical Length Scale Conversion
Binary to Decimal
+4
Binary to Hexadecimal
Binary to Octal
Convert Number to Words
Decimal to Any
Decimal to Binary
+5
Decimal to Hexadecimal
Decimal to Octal
Energy Conversions
Excel Title to Column
Hex to Bin
Hexadecimal to Decimal
Ipv 4 Conversion
Length Conversion
Molecular Chemistry
Octal to Binary
Octal to Decimal
Octal to Hexadecimal
Prefix Conversions
Prefix Conversions String
Pressure Conversions
Rgb Cmyk Conversion
Rgb Hsv Conversion
Roman Numerals
Speed Conversions
Temperature Conversions
Time Conversions
Volume Conversions
Weight Conversion
Data Structures
Equilibrium Index in Array
Find Triplets with 0 Sum
Index 2d Array in 1d
Kth Largest Element
Median Two Array
Monotonic Array
Pairs with Given Sum
Permutations
Prefix Sum
Product Sum
Sparse Table
AVL Tree
+3
Basic Binary Tree
Binary Search Tree
+3
Binary Search Tree Recursive
Binary Tree Mirror
Binary Tree Node Sum
Binary Tree Path Sum
Binary Tree Traversals
Diameter of Binary Tree
Diff Views of Binary Tree
Distribute Coins
Fenwick Tree
+1
Flatten Binarytree to Linkedlist
Floor and Ceiling
Inorder Tree Traversal 2022
Is Sorted
Is Sum Tree
Lazy Segment Tree
Lowest Common Ancestor
Maximum Fenwick Tree
Maximum Sum Bst
Merge Two Binary Trees
Mirror Binary Tree
Non Recursive Segment Tree
Number of Possible Binary Trees
Red Black Tree
Segment Tree
+4
Segment Tree Other
Serialize Deserialize Binary Tree
Symmetric Tree
Treap
Wavelet Tree
Alternate Disjoint Set
Disjoint Set
Bloom Filter
Double Hash
Hash Map
Hash Table
Hash Table with Linked List
Prime
+8
Quadratic Probing
Binomial Heap
Heap
+1
Heap Generic
Max Heap
Min Heap
Randomized Heap
Skew Heap
Build Kdtree
Example Usage
Hypercube Points
Kd Node
Nearest Neighbour Search
Circular Linked List
Deque Doubly
Doubly Linked List
+5
Doubly Linked List Two
Floyds Cycle Detection
From Sequence
Has Loop
Is Palindrome
+1
Merge Two Lists
Middle Element of Linked List
Print Reverse
Reverse K Group
Rotate to the Right
Singly Linked List
+3
Skip List
Swap Nodes
Circular Queue
Circular Queue Linked List
Double Ended Queue
Linked Queue
Priority Queue Using List
Queue by List
Queue by Two Stacks
Queue on Pseudo Stack
Balanced Parentheses
Dijkstras Two Stack Algorithm
Infix to Postfix Conversion
Infix to Prefix Conversion
Lexicographical Numbers
Next Greater Element
Postfix Evaluation
Prefix Evaluation
Stack
+4
Stack Using Two Queues
Stack with Doubly Linked List
Stack with Singly Linked List
+3
Stock Span Problem
Example Usage
Suffix Tree
Suffix Tree Node
Radix Tree
Trie
+3
Prime
+8
Prime
+8
Digital Image Processing
Change Brightness
Change Contrast
Convert to Negative
Burkes
Canny
Bilateral Filter
Convolve
Gabor Filter
Gaussian Filter
Laplacian Filter
Local Binary Pattern
Median Filter
Sobel Filter
Histogram Stretch
Index Calculation
Dilation Operation
Erosion Operation
Resize
Rotation
Sepia
Divide and Conquer
Closest Pair of Points
Convex Hull
Heaps Algorithm
Heaps Algorithm Iterative
Inversions
Kth Order Statistic
Max Difference Pair
Max Subarray
Mergesort
+19
Peak
Power
Strassen Matrix Multiplication
Mergesort
+19
Docs
Conf
Dynamic Programming
Abbreviation
All Construct
Bitmask
Catalan Numbers
Climbing Stairs
Combination Sum Iv
Edit Distance
+1
Factorial
+13
Fast Fibonacci
Fibonacci Numbers
+12
Fizz Buzz
Floyd Warshall
+3
Integer Partition
Iterating Through Submasks
K Means Clustering Tensorflow
Knapsack
+2
Largest Divisible Subset
Longest Common Subsequence
+1
Longest Common Substring
Longest Increasing Subsequence
Longest Increasing Subsequence O Nlogn
Longest Palindromic Subsequence
Matrix Chain Multiplication
Matrix Chain Order
Max Non Adjacent Sum
Max Product Subarray
Max Subarray Sum
Min Distance up Bottom
Minimum Coin Change
Minimum Cost Path
Minimum Partition
Minimum Size Subarray Sum
Minimum Squares to Represent a Number
Minimum Steps to One
Minimum Tickets Cost
Optimal Binary Search Tree
Palindrome Partitioning
Regex Match
Rod Cutting
Smith Waterman
Subset Generation
Sum of Subset
Trapped Water
Tribonacci
Viterbi
Wildcard Matching
Minimum Coin Change
Knapsack
+2
Factorial
+13
Fibonacci Numbers
+12
Edit Distance
+1
Electronics
Apparent Power
Builtin Voltage
Capacitor Equivalence
Carrier Concentration
Charging Capacitor
Charging Inductor
Circular Convolution
Coulombs Law
Electric Conductivity
Electric Power
Electrical Impedance
Ic 555 Timer
Ind Reactance
Ohms Law
Real and Reactive Power
Resistor Color Code
Resistor Equivalence
Resonant Frequency
Wheatstone Bridge
Coulombs Law
File Transfer
Financial
Equated Monthly Installments
Exponential Moving Average
Interest
Present Value
Price Plus Tax
Simple Moving Average
Fractals
Fuzzy Logic
Fuzzy Operations
Genetic Algorithm
Basic String
Geodesy
Graphics
Graphs
A Star
Ant Colony Optimization Algorithms
Articulation Points
Basic Graphs
Bellman Ford
+4
Bi Directional Dijkstra
Bidirectional a Star
Bidirectional Breadth First Search
Boruvka
Breadth First Search
+3
Breadth First Search 2
Breadth First Search Shortest Path
Breadth First Search Shortest Path 2
Breadth First Search Zero One Shortest Path
Check Bipatrite
Check Cycle
Connected Components
Deep Clone Graph
Depth First Search
+4
Depth First Search 2
Dijkstra
+4
Dijkstra 2
Dijkstra Algorithm
Dijkstra Alternate
Dijkstra Binary Grid
Dinic
Directed and Undirected Weighted Graph
Edmonds Karp Multiple Source and Sink
Eulerian Path and Circuit for Undirected Graph
Even Tree
Finding Bridges
Frequent Pattern Graph Miner
G Topological Sort
Gale Shapley Bigraph
Graph Adjacency List
Graph Adjacency Matrix
Graph List
Graphs Floyd Warshall
Greedy Best First
Greedy Min Vertex Cover
Kahns Algorithm Long
Kahns Algorithm Topo
Karger
Markov Chain
Matching Min Vertex Cover
Minimum Path Sum
Minimum Spanning Tree Boruvka
Minimum Spanning Tree Kruskal
Minimum Spanning Tree Kruskal 2
Minimum Spanning Tree Prims
Minimum Spanning Tree Prims 2
Multi Heuristic Astar
Page Rank
Prim
Random Graph Generator
Scc Kosaraju
Strongly Connected Components
Tarjans Scc
A Star
Greedy Methods
Best Time to Buy and Sell Stock
Fractional Cover Problem
Fractional Knapsack
Fractional Knapsack 2
Gas Station
Minimum Waiting Time
Optimal Merge Pattern
Smallest Range
Hashing
Adler 32
Chaos Machine
Djb 2
Elf
Enigma Machine
Fletcher 16
Hamming Code
Luhn
Md 5
SDBM
Sha 1
Sha 256
Knapsack
Linear Algebra
Gaussian Elimination
Jacobi Iteration Method
Lu Decomposition
Conjugate Gradient
Gaussian Elimination Pivoting
Lib
Polynom for Points
Power Iteration
Rank of Matrix
Rayleigh Quotient
Schur Complement
Transformations 2d
Linear Programming
Simplex
Machine Learning
Apriori Algorithm
Automatic Differentiation
Data Transformations
Decision Tree
Dimensionality Reduction
Run
Frequent Pattern Growth
Gradient Boosting Classifier
Gradient Descent
K Means Clust
K Nearest Neighbours
Linear Discriminant Analysis
Linear Regression
Local Weighted Learning
Logistic Regression
Loss Functions
Lstm Prediction
Mfcc
Multilayer Perceptron Classifier
Polynomial Regression
Scoring Functions
Self Organizing Map
Sequential Minimum Optimization
Similarity Search
Support Vector Machines
Word Frequency Functions
Xgboost Classifier
Xgboost Regressor
Math
Abs
+5
Addition without Arithmetic
Aliquot Sum
+5
Allocation Number
Arc Length
Area
Area Under Curve
Average Absolute Deviation
Average Mean
Average Median
Average Mode
Bailey Borwein Plouffe
Base Neg 2 Conversion
Basic Maths
Binary Exponentiation
Binary Multiplication
Binomial Coefficient
+1
Binomial Distribution
Ceil
+1
Chebyshev Distance
Check Polygon
Chinese Remainder Theorem
Chudnovsky Algorithm
Collatz Sequence
Combinations
Continued Fraction
Decimal Isolate
Decimal to Fraction
Dodecahedron
Double Factorial
Dual Number Automatic Differentiation
Entropy
Euclidean Distance
Euler Method
Euler Modified
Euler's Totient
+2
Extended Euclidean Algorithm
Factors
Fast Inverse Sqrt
Fermats Little Theorem
Find Max
Find Min
+1