The Algorithms logo
The Algorithms
AboutDonate
undefined

Minimizing Lateness

Knapsack

Audio Filters
Backtracking
Ciphers

Simple Sub Cipher

Hill Cipher

AES Encryption

Product Cipher

Simple Substitution Cipher

Affine Cipher

Columnar Transposition Cipher

Vigenere

Compression
Conversions

Hexadecimal to Decimal

Hexa Decimal To Binary

Decimal to Hexadecimal

Roman To Integer

Decimal to Binary

Binary to Decimal

Any Base To Decimal

Octal to Decimal

Turkish To Latin Conversion

Rgb Hsv Conversion

Decimal To Any Base

Binary to Octal

Binary to Hexadecimal

Decimal to Octal

Integer To Roman

Any Base To Any Base

Hex To Oct

Octal To Hexadecimal

Data Structures

Level Order Traversal

Level Order Traversal Queue

Check If Binary Tree Balanced

Print Top Viewof Tree

Vertical Order Traversal

Create BST From Sorted Array

Ceil In Binary Search Tree

Nearest Right Key

Create Binary Tree From Inorder Preorder

Valid BST Or Not

Tree Random Node

BST Recursive Generic

Stack with Singly Linked List

Next Smaller Element

Decimal To Any Using Stack

Maximum Minimum Window

Balanced Brackets

Infix To Postfix

Duplicate Brackets

Next Grater Element

Stack Array List

Dynamic Array

Remove Duplicate Nodes

Merge Sorted Array List

Merge Sorted Singly Linked List

Search Singly Linked List Recursion

Cursor Linked List

Count Singly Linked List Recursion

Merge K Sorted Linkedlist

Circle Linked List

Create And Detect Loop

Singly Linked List

Doubly Linked List

Disjoint Sets

Min Priority Queue

Empty Heap Exception

Generic Array List Queue

Connected Component

Bipartite Grapf DFS

DIJSKSTRAS ALGORITHM

Hash Map Linear Probing

Queue Using Two Stacks

Devutils

Simple Tree Node

Simple Node

Large Tree Node

Search Algorithm

Digital Image Processing
Divide and Conquer

Strassen Matrix Multiplication

Skyline Algorithm

Dynamic Programming

Fibonacci Numbers

Palindromic Partitioning

Matrix Chain Recursive Top Down Memoisation

Knapsack Memoization

Memoization Technique Knapsack

Matrix Chain Multiplication

New Man Shanks Prime

Fibonacci Numbers

Longest Palindromic Subsequence

Dyanamic Programming Knapsack

Minimum Path Sum

Brute Force Knapsack

Longest Common Subsequence

Shortest Common Supersequence Length

Longest Valid Parentheses

Minimum Sum Partition

Longest Increasing Subsequence

Kadane Algorithm

Longest Alternating Subsequence

Fibonacci Numbers

Fractals

Koch Snowflake

Mandelbrot

Graphs

Prim MST

Bellman Ford

Kruskal

Dijkstra

Page Rank

Depth First Search

Breadth First Search

Hashing
Machine Learning
Math

Sieve of Eratosthenes

Binary Exponentiation

Find Min Recursion

Circular Convolution FFT

Leonardo Number

Digital Root

Sum of Digits

Find Max Recursion

Absolute Max

Median

Pronic Number

Absolute Value

Parse Integer

Matrix Util

Perfect Number

Linear Diophantine Equations Solver

Pascal Triangle

Binary Pow

Perfect Square

Min Value

Aliquot Sum

Krishnamurthy Number

Convolution FFT

Automorphic Number

Non Repeating Element

Roman Numeral Util

Find Min

Reverse Number

ADT Fraction

Vampire Number

Square Root With Babylonian Method

Binomial Coefficient

Power Of Two Or Not

Prime Check

FFT Bluestein

Find Max

Prime Factorization

Juggler Sequence

Lucas Series

Gaussian

Pow Recursion

Simpson Integration

Perfect Cube

Pythagorean Triple

Sum of Arithmetic Series

Harshad Number

Average

Ugly Numbers

Combinations

Vector Cross Product

Number of Digits

Factorial Recursion

Fibonacci Java Streams

Max Value

Convolution

Palindrome Number

Determinant Of Matrix

Generic Root

GCD Recursion

Armstrong

Kaprekar Numbers

Dudeney Number

Euler Method

Keith Number

Amicable Number

Absolute Min

Volume

Magic Square

Trinomial Triangle

Pi Nilakantha

Matrix

Inverse of Matrix

Networking Flow

Ford Fulkerson

Operations on Datastructures
Others

Lru Cache

Median Of Running Array

Palindrome Prime

Three Sum Problem

Two Sum Problem

Sparcity

Word Boggle

Range In Sorted Array

Sort 012 D

Palindrome Singly Linked List

Matrix Transpose

Color Contrast Ratio

String Match Finite Automata

Two Pointers

Stack Postfix Notation

Verhoeff

Mini Max Algorithm

Implementing Auto Completing Features Using Trie

Count Char

Tower of Hanoi

CP Ualgorithms

Boyer Moore

Three Sum

Root Precision

Remove Duplicate From String

Password Gen

Perlin Noise

Insert Delete In Array

Krishnamurthy

Return Subsequence

Guass Legendre

Count Words

Rotate Matrice By 90 Degree

Floyd Triangle

CRC Algorithm

Happy Numbers Seq

Top K Words

Fibbonaci Series

Eulers Function

Lowest Base Palindrome

Linear Congruential Generator

Brian Kernighan Algorithm

Skyline Problem

Reverse Stack Using Recursion

Bankers Algorithm

Recursive

Flood Fill

Searches

Iterative Ternary Search

Square Root Binary Search

Interpolation Search

Linear Search

+11

More

Binary Search

+12

More

Jump Search

Iterative Binary Search

Monte Carlo Tree Search

Fibonacci Search

Upper Bound

Perfect Binary Search

Linear Search Thread

Ternary Search

Saddleback Search

Exponental Search

How Many Times Rotated

Union Find

Lower Bound

Quick Select

Sorts

Tree Sort

Merge Sort Recursive

Link List Sort

Bogo Sort

Shell Sort

Selection Sort

+12

More

Simple Sort

Stooge Sort

Dnf Sort

Bitonic Sort

Odd Even Sort

Gnome Sort

Heap Sort

+13

More

Counting Sort

Merge Sort No Extra Space

Comb Sort

Circle Sort

Merge Sort

+17

More

Cycle Sort

Quick Sort

+17

More

Cocktail Shaker Sort

Insertion Sort

+15

More

Pancake Sort

Swap Sort

Sort Algorithm

Bucket Sort

Bubble Sort Recursion

Slowsort

Bubble Sort

+16

More

Radix Sort

Sort Utils

Tim Sort

Strings

Word Ladder

Anagrams

List All Possible Words From Phone Digits

Characters Same

Alphabetical

Check Vowels

Permute String

Longest Palindromic Substring

Reverse String

Horspool Search

Palindrome

Check Anagrams

Rabin Karp

Levenshtein Distance

Longest Palindromic Substring