Retroceso
N Queens
Cifradores
Caesar
AES
Vigenere
Morse Code
Tea
Rot 13
Xor
Another Rot 13
Transposition
Polybius
Estructuras de datos
Lowest Common Ancestor
Prime Numbers
Binary Search Tree
+1
B Tree
AVL Tree
+1
Graph
Queue
Stack with Singly Linked List
+2
Rb Tree
Heap
Segment Tree
Trie
Fenwick Tree
Linked List
Dividir y conquistar
Programación dinámica
Maximal Square
Longest Continuous Increasing Subsequence
Edit Distance
+3
Longest Common Subsequence
Coin Change
+4
Knapsack
Is Subsequence
Egg Dropping
Maximum Subarray
Rod Cutting
Longest Increasing Subsequence
General
Geometría
Closest Points
Gráficas
Prufer Code
Minimum Spanning Tree
Graph Enumeration
Breadth First Search
+2
Depth First Search
+3
Bellman Ford
+1
Dinic Maxflow
Prim
Centroid Decomposition
Depth First Search Tic Tac Toe
Strongly Connected Components
Disjoint Set Union
Dijkstra
+1
Hashing
Sha 256
Matemáticas
Random
Extended Euclidean Algorithm
Baby Step Giant Step
Pascal Triangle
Square Root
Sieve of Eratosthenes
+3
Matrix Ops
Prime Check
+2
Nthprime
Perfect Numbers
Linear Sieve
Prime Factors
Miller Rabin
Trial Division
Zellers Congruence Algorithm
Karatsuba Multiplication
Greatest Common Divisor
Simpson Integration
Pollard Rho
Armstrong Number
+2
Gcd of N Numbers
Quadratic Residue
Fast Power
Lcm of N Numbers
Fibonacci Numbers
+9
Two Sum
Análisis numérico
Métodos numéricos
Fast Fourier Transform
Consultas de rango
Heavy Light Decomposition
Búsquedas
Union Find
Ternary Search Min Max
Ternary Search
+4
Interpolation Search
+3
Ternary Search Min Max Recursive
Jump Search
+6
Fibonacci Search
+4
Exponential Search
Kth Smallest
Kth Smallest Heap
Binary Search Recursive
Binary Search
+12
Linear Search
+11
Quick Select
Ternary Search Recursive
Ordenamiento
Topological Sort
Exchange Sort
Bucket Sort
+3
Comb Sort
+8
Insertion Sort
+16
Bubble Sort
+17
Radix Sort
+8
Bogo Sort
+4
Cycle Sort
+2
Counting Sort
+6
Cocktail Shaker Sort
Pancake Sort
+4
Stooge Sort
Heap Sort
+13
Tim Sort
+1
Gnome Sort
+4
Shell Sort
+7
Selection Sort
+13
Odd Even Sort
Quick Sort
+17
