Backtracking
Generate Parentheses
Graph Coloring
Knight Tour
Magic Sequence
Minimax
N Queens
N Queens All Solution Optimised
Nqueen Print All Solutions
Rat Maze
Subarray Sum
Subset Sum
Sudoku Solver
+1
Word Break
Bitmanipulation
Count Bits Flip
Count of Set Bits
Count of Trailing Ciphers in Factorial N
Find Non Repeating Number
Gray Code
Next Higher Number with Same Number of Set Bits
Power of 2
Set Kth Bit
Travelling Salesman Using Bit Manipulation
Verschlüsselungsverfahren
A 1z 26 Cipher
Atbash Cipher
Base 64 Encoding
Caesar Cipher
Elliptic Curve Key Exchange
Hill Cipher
Morse Code
Uint 128 T
Uint 256 T
Vigenere Cipher
XOR Cipher
+3
Kompression
Huffman
Konvertierungen
CPU Scheduling Algorithmen
Datenstrukturen
AVL Tree
+4
Binary Search Tree
+3
Binary Search Tree 2
Binary Heap
Bloom Filter
Circular Queue Using Linked List
Cll
Cll
Main Cll
Disjoint Set
Doubly Linked List
+5
Dsu Path Compression
Dsu Union Rank
Linked List
+1
Linkedlist Implentation Usingarray
List Array
Morrisinorder
Node
Queue
+3
Queue Using Array
Queue Using Array 2
Queue Using Linked List
Queue Using Linked List
Queue Using Two Stacks
Rb Tree
Reverse a Linked List
Segment Tree
+4
Skip List
Sparse Table
Stack
+4
Stack Using Array
Stack with Singly Linked List
+3
Stack Using Queue
Treap
Tree
Tree 234
Trie Modern
Trie Tree
Trie Using Hashmap
Lowest Common Ancestor
Prime
+8
Prime
+8
Circular Linked List
Postfix Evaluation
Fenwick Tree
+1
Teile und herrsche
Dynamische Programmierung
Wildcard Matching
0 1 Knapsack
Abbreviation
Armstrong Number Templated
Catalan Numbers
Coin Change
+6
Coin Change Topdown
Cut Rod
Edit Distance
+1
Egg Dropping Puzzle
Fibonacci Bottom Up
Floyd Warshall
+3
House Robber
Kadane
Longest Common String
Longest Common Subsequence
+1
Longest Increasing Subsequence
Longest Increasing Subsequence Nlogn
Longest Palindromic Subsequence
Matrix Chain Multiplication
Maximum Circular Subarray
Minimum Edit Distance
Palindrome Partitioning
Partition Problem
Searching of Element in Dynamic Array
Shortest Common Supersequence
Subset Sum Dynamic
Trapped Rainwater
Tree Height
Unbounded 0 1 Knapsack
Knapsack
+2
Factorial
+13
Fibonacci Numbers
+12
Longest Substring Without Repeating Characters
Spiele
Memory Game
Geometrie
Grafiken
Spirograph
Graphen
Bellman Ford
+4
Bi Directional Dijkstra
Breadth First Search
+3
Bridge Finding with Tarjan Algorithm
Connected Components
Connected Components with Dsu
Cycle Check Directed Graph
Depth First Search
+4
Depth First Search with Stack
Dijkstra
+4
Hamiltons Cycle
Hopcroft Karp
Is Graph Bipartite
Is Graph Bipartite 2
Kosaraju
Kruskal
Max Flow with Ford Fulkerson and Edmond Karp Algo
Prim
Topological Sort by Kahns Algo
Travelling Salesman Problem
Greedy-Algorithmen
Binary Addition
Boruvkas Minimum Spanning Tree
Digit Separation
Dijkstra Greedy
Gale Shapley
Jump Game
Kruskals Minimum Spanning Tree
Prims Minimum Spanning Tree
Hashing
Chaining
Double Hash Hash Table
Linear Probing Hash Table
Md 5
Quadratic Probing Hash Table
Sha 1
Sha 256
Lineare Algebra
Maschinelles Lernen
A Star Search
Adaline Learning
K Nearest Neighbors
Kohonen Som Topology
Kohonen Som Trace
Neural Network
Ordinary Least Squares Regressor
Vector Ops
Mathematik
Aliquot Sum
+5
Approximate Pi
Area
Armstrong Number
+8
Binary Exponent
Binomial Calculate
Check Amicable Pair
Check Factorial
Complex Numbers
Double Factorial
Eratosthenes
Euler's Totient
+2
Extended Euclid Algorithm
Fast Power
Fibonacci Fast
Fibonacci Large
Fibonacci Matrix Exponentiation
Fibonacci Sum
Finding Number of Digits in a Number
Gcd Iterative Euclidean
Gcd of N Numbers
Gcd Recursive Euclidean
Integral Approximation
Integral Approximation 2
Inv Sqrt
Iterative Factorial
Large Factorial
Large Number
Largest Power
LCM
+2
Least Common Multiple
Linear Recurrence Matrix
Magic Number
Miller Rabin
Modular Division
Modular Exponentiation
Modular Inverse Fermat Little Theorem
Modular Inverse Simple
N Bonacci
N Choose R
Ncr Modulo P
Number of Positive Divisors
Perimeter
Power for Huge Numbers
Power of Two
Prime Factorization
Primes up to Billion
Quadratic Equations Complex Numbers
Realtime Stats
Sieve of Eratosthenes
+4
Sqrt Double
String Fibonacci
Sum of Binomial Coefficient
Sum of Digits
+1
Vector Cross Product
Volume
Bisection Method
Qr Decomposition
Runge Kutta
Happy Number
Matrix Exponentiation
Matrix
Numerische Methoden
Babylonian Method
Brent Method Extrema
Composite Simpson Rule
Durand Kerner Roots
False Position
Fast Fourier Transform
Golden Search Extrema
Gram Schmidt
Inverse Fast Fourier Transform
Lu Decompose
Midpoint Integral Method
Newton Raphson Method
Ode Forward Euler
Ode Midpoint Euler
Ode Semi Implicit Euler
Qr Decompose
Qr Eigen Values
Successive Approximation
Operationen an Datenstrukturen
Array Left Rotation
Array Right Rotation
Circular Queue Using Array
Get Size of Linked List
Inorder Successor of Bst
Intersection of Two Arrays
Reverse a Linked List Using Recusion
Reverse Binary Tree
Selectionsortlinkedlist
Trie Multiple Search
Union of Two Arrays
Andere
Buzz Number
Decimal to Roman Numeral
Easter
Fast Integer Input
Iterative Tree Traversals
Kadanes 3
Kelvin to Celsius
Lfu Cache
Lru Cache
Lru Cache 2
Palindrome of Number
Paranthesis Matching
Recursive Tree Traversal
Smallest Circle
Sparse Matrix
Stairs Pattern
Tower of Hanoi
+1
Vector Important Functions
Physik
Ground to Ground Projectile Motion
Wahrscheinlichkeit
Addition Rule
Bayes Theorem
Binomial Dist
Exponential Dist
Geometric Dist
Poisson Dist
Windowed Median
Bereichsabfragen
Heavy Light Decomposition
Mo
Persistent Seg Tree Lazy Prop
Prefix Sum Array
Segtree
Sparse Table Range Queries
Suchen
Binary Search
+15
Exponential Search
+2
Fibonacci Search
+5
Floyd Cycle Detection Algo
Hash Search
Interpolation Search
+6
Interpolation Search 2
Jump Search
+8
Linear Search
+14
Longest Increasing Subsequence Using Binary Search
Median Search
Median Search 2
Saddleback Search
Sublist Search
Ternary Search
+5
Text Search
Sortieren
Topological Sort
+2
Bead Sort
+2
Binary Insertion Sort
+4
Bitonic Sort
Bogo Sort
+8
Bubble Sort
+19
Bucket Sort
+5
Cocktail Selection Sort
Comb Sort
+8
Count Inversions
Counting Sort
+9
Counting Sort String
Cycle Sort
+5
Dnf Sort
Gnome Sort
+8
Heap Sort
+15
Insertion Sort
+18
Insertion Sort Recursive
Library Sort
Merge Insertion Sort
Non Recursive Merge Sort
Numeric String Sort
Odd Even Sort
+2
Pancake Sort
+7
Pigeonhole Sort
+2
Quick Sort
+19
Quick Sort 3
Quick Sort Iterative
Radix Sort
+9
Radix Sort 2
Random Pivot Quick Sort
Recursive Bubble Sort
Selection Sort Iterative
Selection Sort Recursive
Shell Sort
+10
Shell Sort 2
Slowsort
Stooge Sort
+1
Strand Sort
Swap Sort
Tim Sort
+3
