The Algorithms logo
The Algorithms
AboutDonate
undefined

Minimizing Lateness

Knapsack

Audio Filters
Backtracking
Ciphers

AES Encryption

Vigenere

Hill Cipher

Columnar Transposition Cipher

Simple Sub Cipher

Simple Substitution Cipher

Affine Cipher

Product Cipher

Compression
Conversions

Decimal To Any Base

Hexadecimal to Decimal

Hexa Decimal To Binary

Turkish To Latin Conversion

Integer To Roman

Decimal to Hexadecimal

Decimal to Binary

Binary to Octal

Octal to Decimal

Octal To Hexadecimal

Decimal to Octal

Any Base To Decimal

Any Base To Any Base

Roman To Integer

Binary to Hexadecimal

Hex To Oct

Binary to Decimal

Rgb Hsv Conversion

Data Structures

Queue Using Two Stacks

Hash Map Linear Probing

DIJSKSTRAS ALGORITHM

Connected Component

Bipartite Grapf DFS

Stack Array List

Decimal To Any Using Stack

Infix To Postfix

Balanced Brackets

Stack Of Linked List

Duplicate Brackets

Maximum Minimum Window

Vertical Order Traversal

Level Order Traversal

BST Recursive Generic

Ceil In Binary Search Tree

Create Binary Tree From Inorder Preorder

Check If Binary Tree Balanced

Valid BST Or Not

Create BST From Sorted Array

Nearest Right Key

Print Top Viewof Tree

Level Order Traversal Queue

Dynamic Array

Min Priority Queue

Empty Heap Exception

Merge Sorted Singly Linked List

Create And Detect Loop

Merge K Sorted Linkedlist

Search Singly Linked List Recursion

Cursor Linked List

Doubly Linked List

Circle Linked List

Merge Sorted Array List

Count Singly Linked List Recursion

Remove Duplicate Nodes

Generic Array List Queue

Disjoint Sets

Devutils

Large Tree Node

Simple Tree Node

Simple Node

Search Algorithm

Digital Image Processing
Divide and Conquer

Strassen Matrix Multiplication

Skyline Algorithm

Dynamic Programming

Matrix Chain Recursive Top Down Memoisation

Brute Force Knapsack

Longest Increasing Subsequence

Matrix Chain Multiplication

Longest Valid Parentheses

Dyanamic Programming Knapsack

Longest Palindromic Subsequence

Memoization Technique Knapsack

Minimum Sum Partition

Longest Common Subsequence

Longest Alternating Subsequence

Palindromic Partitioning

Minimum Path Sum

Knapsack Memoization

Kadane Algorithm

Fractals

Mandelbrot

Koch Snowflake

Graphs

Page Rank

Dijkstra

Prim MST

Bellman Ford

Kruskal

Breadth First Search

Depth First Search

Hashing
Math

Binary Exponentiation

GCD Recursion

Armstrong

Max Value

Absolute Min

Absolute Max

FFT Bluestein

Automorphic Number

Determinant Of Matrix

Sum of Digits

Linear Diophantine Equations Solver

Absolute Value

Harshad Number

Factorial Recursion

Keith Number

Convolution

Ugly Numbers

Fibonacci Numbers

Pi Nilakantha

Average

Binary Pow

Number of Digits

Vector Cross Product

Perfect Number

Matrix Util

Leonardo Number

Fibonacci Java Streams

Sum of Arithmetic Series

Lucas Series

Magic Square

Juggler Sequence

Find Min Recursion

Amicable Number

Gaussian

Perfect Square

Find Max

Generic Root

Aliquot Sum

Binomial Coefficient

Median

Prime Check

Digital Root

Circular Convolution FFT

Convolution FFT

Euler Method

Pow Recursion

Find Max Recursion

Prime Factorization

Power Of Two Or Not

ADT Fraction

Roman Numeral Util

Min Value

Dudeney Number

Vampire Number

Reverse Number

Pythagorean Triple

Find Min

Trinomial Triangle

Parse Integer

Krishnamurthy Number

Combinations

Volume

Perfect Cube

Simpson Integration

Palindrome Number

Non Repeating Element

Fibonacci Numbers

Sieve of Eratosthenes

Fibonacci Numbers

Matrix

Inverse of Matrix

Networking Flow

Ford Fulkerson

Others

Remove Duplicate From String

Rotate Matrice By 90 Degree

Stack Postfix Notation

Skyline Problem

Linear Congruential Generator

Insert Delete In Array

Password Gen

Lowest Base Palindrome

Fibbonaci Series

Krishnamurthy

Verhoeff

Count Char

Happy Numbers Seq

Bankers Algorithm

Three Sum

String Match Finite Automata

Top K Words

Return Subsequence

Worst Fit

Eulers Function

Boyer Moore

Brian Kernighan Algorithm

Best Fit

CRC Algorithm

Root Precision

Floyd Triangle

Tower of Hanoi

Guass Legendre

Implementing Auto Completing Features Using Trie

First Fit

Two Pointers

Perlin Noise

Reverse Stack Using Recursion

Count Words

Lru Cache

Three Sum Problem

Median Of Running Array

Range In Sorted Array

Palindrome Prime

Sort 012 D

Sparcity

Word Boggle

Matrix Transpose

Color Contrast Ratio

Palindrome Singly Linked List

Two Sum Problem

Recursive

Flood Fill

Searches

Interpolation Search

Binary Search

+12

More

Union Find

Iterative Binary Search

Fibonacci Search

Saddleback Search

Linear Search

+11

More

Monte Carlo Tree Search

Perfect Binary Search

Exponental Search

How Many Times Rotated

Jump Search

Square Root Binary Search

Upper Bound

Ternary Search

Iterative Ternary Search

Linear Search Thread

Lower Bound

Sorts

Slowsort

Cycle Sort

Swap Sort

Merge Sort No Extra Space

Bogo Sort

Pancake Sort

Quick Sort

+17

More

Merge Sort Recursive

Odd Even Sort

Tree Sort

Dnf Sort

Heap Sort

+13

More

Sort Algorithm

Bucket Sort

Gnome Sort

Stooge Sort

Circle Sort

Simple Sort

Shell Sort

Comb Sort

Sort Utils

Insertion Sort

+15

More

Bubble Sort Recursion

Bitonic Sort

Bubble Sort

+15

More

Radix Sort

Counting Sort

Tim Sort

Selection Sort

+12

More

Cocktail Shaker Sort

Strings

Rabin Karp

Check Anagrams

List All Possible Words From Phone Digits

Reverse String

Alphabetical

Word Ladder

Longest Palindromic Substring

Horspool Search

Characters Same

Palindrome

Check Vowels

Levenshtein Distance

Longest Palindromic Substring