The Algorithms logo
The Algorithms
Acerca deDonar
Filtros de audio
Retroceso

All Paths From Source To Target

Array Combination

Combination

Crossword Solver

Knights Tour

M Coloring

Maze Recursion

Parentheses Generator

Permutation

Power Sum

Subsequence Finder

Word Pattern Matcher

Word Search

Hamiltonian Cycle

Subset Sum

Sudoku Solver

Word Ladder

Manipulación de bits

Binary Palindrome Check

Boolean Algebra Gates

Clear Leftmost Set Bit

Count Leading Zeros

First Different Bit

Generate Sub Sets

Gray Code Conversion

Higher Lower Power Of Two

Index of Rightmost Set Bit

Modulo Power Of Two

Next Higher Same Bit Count

Non Repeating Number Finder

Number Appearing Odd Times

Numbers Different Signs

One Bit Difference

Single Bit Operations

Swap Adjacent Bits

Generate Sub Sets

Cifradores

ADFGVX Cipher

AES Encryption

Affine Cipher

Atbash Cipher

Baconian Cipher

Columnar Transposition Cipher

Diffie Hellman

Hill Cipher

Mono Alphabetic

Playfair Cipher

Product Cipher

Rail Fence Cipher

Simple Sub Cipher

XOR Cipher

A 5 Key Stream Generator

Composite LFSR

Compresión
Conversiones

Affine Converter

Any Base To Any Base

Any Base To Decimal

Binary to Decimal

Binary to Hexadecimal

Binary to Octal

Decimal To Any Base

Decimal to Binary

Decimal to Hexadecimal

Decimal to Octal

Endian Converter

Hexa Decimal To Binary

Hexadecimal to Decimal

IP Converter

I Pv 6 Converter

Integer To English

Integer To Roman

Morse Code Converter

Octal to Binary

Octal to Decimal

Octal to Hexadecimal

Phonetic Alphabet Converter

Rgb Hsv Conversion

Roman To Integer

Turkish To Latin Conversion

Unit Conversions

Units Converter

Algoritmos de programación de CPU
Estructuras de datos

Disjoint Set Union

Dijkstra Optimized Algorithm

Edmonds Blossom Algorithm

Generic Hash Map Using Array

Generic Hash Map Using Array List

Merge K Sorted Arrays

Min Priority Queue

Count Singly Linked List Recursion

Create And Detect Loop

Merge K Sorted Linked List

Merge Sorted Array List

Merge Sorted Singly Linked List

Quick Sort Linked List

Rotate Singly Linked Lists

Search Singly Linked List Recursion

Generic Array List Queue

Queue by Two Stacks

Sliding Window Maximum

Stack with Singly Linked List

BST From Sorted Array

BST Recursive Generic

Ceil In Binary Search Tree

Check Binary Tree Is Valid BST

Check If Binary Tree Balanced

Check Tree Is Symmetric

Create Binary Tree From Inorder Preorder

Level Order Traversal

Post Order Traversal

Pre Order Traversal

Print Top Viewof Tree

Vertical Order Traversal

Queue Using Two Stacks

Next Greater Element

Stack Using Two Queues

Utilidades de desarrollador
Procesamiento digital de imágenes
Dividir y conquistar

Counting Inversions

Median Of Two Sorted Arrays

Skyline Algorithm

Strassen Matrix Multiplication

Programación dinámica

Assignment Using Bitmask

Brute Force Knapsack

Count Friends Pairing

Fibonacci Numbers

+12

Más

Knapsack Memoization

Longest Alternating Subsequence

Longest Arithmetic Subsequence

Longest Common Subsequence

Longest Increasing Subsequence

Longest Palindromic Subsequence

Longest Palindromic Substring

Longest Valid Parentheses

Matrix Chain Multiplication

Matrix Chain Recursive Top Down Memoisation

Maximum Sum Of Non Adjacent Elements

Minimum Sum Partition

New Man Shanks Prime

Optimal Job Scheduling

Palindromic Partitioning

Shortest Common Supersequence Length

Subset Sum Space Optimized

Unique Subsequences Count

Fibonacci Numbers

+12

Más

Longest Substring Without Repeating Characters

Longest Palindromic Substring

Fractales

Koch Snowflake

Mandelbrot

Geometría

Bresenham Line

Midpoint Circle

Midpoint Ellipse

Gráficas

Bellman Ford

Dijkstra Algorithm

Minimum Path Sum

Strongly Connected Component Optimized

Dijkstra

Page Rank

Breadth First Search

Depth First Search

Algoritmos voraces

Bandwidth Allocation

Binary Addition

Digit Separation

Egyptian Fraction

Merge Intervals

Minimizing Lateness

Optimal File Merging

Stock Profit Calculator

Métodos Voraces

Fractional Knapsack

Minimum Waiting Time

Hashing
Io

Buffered Reader

Recorte de línea
Matemáticas

Binary Exponentiation

ADT Fraction

Absolute Max

Absolute Min

Absolute Value

Aliquot Sum

Amicable Number

Auto Correlation

Binomial Coefficient

Chinese Remainder Theorem

Circular Convolution FFT

Collatz Conjecture

Combinations

Convolution

Convolution FFT

Cross Correlation

Determinant Of Matrix

Digital Root

Distance Formula

Dudeney Number

Euler Method

Eulers Function

FFT Bluestein

Factorial Recursion

Fast Exponentiation

Fast Inverse Sqrt

Fibonacci Java Streams

Fibonacci Loop

Fibonacci Number Check

Fibonacci Number Golden Ration

Find Kth Number

Find Max Recursion

Find Min Recursion

Frizzy Number

GCD Recursion

Generic Root

Harshad Number

Herons Formula

Josephus Problem

Juggler Sequence

Kaprekar Numbers

Karatsuba Multiplication

Keith Number

Least Common Multiple

Leonardo Number

Linear Diophantine Equations Solver

Liouville Lambda Function

Long Division

Lucas Series

Magic Square

Matrix Rank

Matrix Util

Miller Rabin Primality Check

Mobius Function

Non Repeating Element

Number of Digits

Palindrome Number

Parse Integer

Perfect Cube

Perfect Number

Perfect Square

Pi Nilakantha

Pollard Rho

Power Of Two Or Not

Power Using Recursion

Prime Factorization

Pythagorean Triple

Quadratic Equation Solver

Reverse Number

Roman Numeral Util

Second Min Max

Sieve of Eratosthenes

Simpson Integration

Square Free Integer

Square Root With Babylonian Method

Square Root With Newton Raphson Method

Standard Deviation

Standard Score

Strobogrammatic Number

Sum of Arithmetic Series

Sum of Digits

Sum Of Odd Numbers

Sum Without Arithmetic Operators

Trinomial Triangle

Uniform Numbers

Vampire Number

Vector Cross Product

Matriz

Pascal Triangle

Inverse of Matrix

Flujo de la red

Ford Fulkerson

Operaciones en estructuras de datos
Otros

Lfu Cache

Lru Cache

Graham Scan

Activity Selection

Color Contrast Ratio

Map Reduce

Matrix Transpose

Median Of Matrix

Median Of Running Array

Median Of Running Array Byte

Median Of Running Array Double

Median Of Running Array Float

Median Of Running Array Integer

Median Of Running Array Long

Mirror Of Matrix

Palindrome Prime

Palindrome Singly Linked List

Range In Sorted Array

Shuffle Array

Sparsity

Three Sum Problem

Two Sum Problem

Word Boggle

Bankers Algorithm

Brian Kernighan Algorithm

CRC 16

CRC 32

CRC Algorithm

Conway

Floyd Triangle

Gauss Legendre

Happy Numbers Seq

Implementing Auto Completing Features Using Trie

Insert Delete In Array

Krishnamurthy

Line Sweep

Linear Congruential Generator

Lowest Base Palindrome

Maximum Sliding Window

Maximum Sum Of Distinct Subarrays With Length K

Memory Management Algorithms

Mini Max Algorithm

Password Gen

Perlin Noise

Print A Matrix In Spiral Order

Remove Duplicate From String

Reverse Stack Using Recursion

Rotate Matrix By 90 Degrees

Skyline Problem

Tower of Hanoi

Two Pointers

Verhoeff

Recursión

Fibonacci Series

Recursivo

Flood Fill

Planificación

Aging Scheduling

EDF Scheduling

Fair Share Scheduling

Gang Scheduling

Highest Response Ratio Next Scheduling

Job Scheduling With Deadline

Lottery Scheduling

MLFQ Scheduler

Multi Agent Scheduling

Non Preemptive Priority Scheduling

Preemptive Priority Scheduling

Proportional Fair Scheduling

RR Scheduling

Random Scheduling

SJF Scheduling

SRTF Scheduling

Self Adjusting Scheduling

Slack Time Scheduling

Búsquedas

BM 25 Inverted Index

Binary Search

+15

Más

Binary Search 2d Array

Exponental Search

Fibonacci Search

How Many Times Rotated

Interpolation Search

Iterative Binary Search

Iterative Ternary Search

Jump Search

KMP Search

Linear Search

+14

Más

Linear Search Thread

Lower Bound

Monte Carlo Tree Search

Order Agnostic Binary Search

Perfect Binary Search

Quick Select

Rabin Karp Algorithm

Random Search

Recursive Binary Search

Row Column Wise Sorted 2d Array Binary Search

Saddleback Search

Search In A Row And Col Wise Sorted Matrix

Sort Order Agnostic Binary Search

Square Root Binary Search

Ternary Search

Union Find

Upper Bound

Ventana Deslizante

Longest Subarray With Sum Less Or Equal To K

Max Sum K Size Subarray

Min Sum K Size Subarray

Ordenamiento

Adaptive Merge Sort

Bead Sort

Binary Insertion Sort

Bitonic Sort

Bogo Sort

Bubble Sort

+19

Más

Bubble Sort Recursive

Bucket Sort

Circle Sort

Cocktail Shaker Sort

Comb Sort

Counting Sort

Cycle Sort

Dual Pivot Quick Sort

Dutch National Flag Sort

Exchange Sort

Gnome Sort

Heap Sort