Java - The Algorithms

The Algorithms

À propos Faire un don

Java

Filtres audio

EMA Filter

Iir Filter

Retour arrière

All Paths From Source To Target

Array Combination

Combination

Crossword Solver

Knights Tour

M Coloring

Maze Recursion

N Queens

Parentheses Generator

Permutation

Power Sum

Subsequence Finder

Word Pattern Matcher

Word Search

Hamiltonian Cycle

Subset Sum

Sudoku Solver

+1

Word Ladder

Manipulation de bits

Bcd Conversion

Binary Palindrome Check

Bit Swap

Boolean Algebra Gates

Clear Leftmost Set Bit

Count Leading Zeros

Count Set Bits

Find Nth Bit

First Different Bit

Generate Sub Sets

Gray Code Conversion

Higher Lower Power Of Two

Highest Set Bit

Index of Rightmost Set Bit

Is Even

Is Power Two

Lowest 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

Ones Complement

Parity Check

Reverse Bits

Single Bit Operations

Single Element

Swap Adjacent Bits

Twos Complement

Xs 3 Conversion

Generate Sub Sets

Chiffrement

ADFGVX Cipher

AES

AES Encryption

Affine Cipher

Atbash Cipher

Autokey

Baconian Cipher

Blowfish

Caesar

Columnar Transposition Cipher

DES

Diffie Hellman

ECC

Hill Cipher

Mono Alphabetic

Playfair Cipher

Polybius

Product Cipher

RSA

Rail Fence Cipher

Simple Sub Cipher

Vigenere

XOR Cipher

+3

A 5 Cipher

A 5 Key Stream Generator

Base LFSR

Composite LFSR

LFSR

Utils

Compression

Huffman

Conversions

Affine Converter

Any Base To Any Base

Any Base To Decimal

Anyto Any

Binary to Decimal

+4

Binary to Hexadecimal

Binary to Octal

Decimal To Any Base

Decimal to Binary

+5

Decimal to Hexadecimal

Decimal to Octal

Endian Converter

Hex To Oct

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

Algorithmes d'ordonnancement du CPU

Fcfs Scheduling

Structures de données

Node

Bag

Bloom Filter

Circular Buffer

MRU Cache

G Counter

G Set

LWW Element Set

OR Set

PN Counter

Two P Set

Disjoint Set Union

Node

Dynamic Array

Bipartite Graph DFS

Boruvka Algorithm

Connected Component

Cycles

Dijkstra Optimized Algorithm

Edmonds Blossom Algorithm

Graphs

Johnsons Algorithm

Kahns Algorithm

Matrix Graphs

Tarjans Algorithm

Welsh Powell

Generic Hash Map Using Array

Generic Hash Map Using Array List

Hash Map

Hash Map Cuckoo Hashing

Linear Probing Hash Map

Main Cuckoo Hashing

Majority Element

Map

Empty Heap Exception

Fibonacci Heap

Generic Heap

Heap

+1

Heap Element

Kth Element Finder

Leftist Heap

Max Heap

Median Finder

Merge K Sorted Arrays

Min Heap

Min Priority Queue

Circle Linked List

Count Singly Linked List Recursion

Create And Detect Loop

Cursor Linked List

Doubly Linked List

+5

Merge K Sorted Linked List

Merge Sorted Array List

Merge Sorted Singly Linked List

Quick Sort Linked List

Random Node

Reverse K Group

Rotate Singly Linked Lists

Search Singly Linked List Recursion

Singly Linked List

+3

Skip List

Sorted Linked List

Circular Queue

Deque

Generic Array List Queue

Linked Queue

Priority Queues

Queue

+3

Queue by Two Stacks

Sliding Window Maximum

Token Bucket

Node Stack

Reverse Stack

Stack

+4

Stack Array

Stack Array List

Stack with Singly Linked List

+3

AVL Simple

AVL Tree

+4

BST From Sorted Array

BST Iterative

BST Recursive

BST Recursive Generic

Binary Tree

Boundary Traversal

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

Fenwick Tree

+1

Generic Tree

Inorder Traversal

KD Tree

LCA

Lazy Segment Tree

Level Order Traversal

Post Order Traversal

Pre Order Traversal

Print Top Viewof Tree

Quad Tree

Red Black BST

Same Trees Check

Segment Tree

+4

Splay Tree

Treap

Tree Random Node

Trie

+3

Vertical Order Traversal

Zigzag Traversal

Nearest Right Key

Node

Prime

+8

Queue Using Two Stacks

Next Greater Element

Stack Using Two Queues

Devutils

Process Details

Large Tree Node

Simple Node

Simple Tree Node

Tree Node

Matrix Search Algorithm

Search Algorithm

Traitement d'images numériques

Rotation

Diviser pour régner

Closest Pair

Counting Inversions

Median Of Two Sorted Arrays

Skyline Algorithm

Strassen Matrix Multiplication

Tiling Problem

Convex Hull

Mergesort

+19

Programmation dynamique

Floyd Warshall

+3

Abbreviation

All Construct

Assignment Using Bitmask

Board Path

Boundary Fill

Brute Force Knapsack

Climbing Stairs

Coin Change

+6

Count Friends Pairing

Dice Throw

Edit Distance

+1

Egg Dropping

Fibonacci Numbers

+12

Kadane Algorithm

Knapsack

+2

Knapsack Memoization

Longest Alternating Subsequence

Longest Arithmetic Subsequence

Longest Common Subsequence

+1

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

Partition Problem

Regex Matching

Rod Cutting

Shortest Common Supersequence Length

Subset Count

Subset Sum Space Optimized

Sum of Subset

Tribonacci

Unique Paths

Unique Subsequences Count

Wildcard Matching

Wine Problem

Coin Change

+6

Catalan Numbers

Factorial

+13

Fibonacci Numbers

+12

Longest Substring Without Repeating Characters

Longest Palindromic Substring

Fractales

Koch Snowflake

Mandelbrot

Géométrie

Bresenham Line

Midpoint Circle

Midpoint Ellipse

Point

Point

Graphes

A Star

Bellman Ford

+4

Dijkstra Algorithm

Kosaraju

Kruskal

Prim MST

Minimum Path Sum

Strongly Connected Component Optimized

Dijkstra

+4

Page Rank

Breadth First Search

+3

Depth First Search

+4

Algorithme glouton

Bandwidth Allocation

Binary Addition

Digit Separation

Egyptian Fraction

Gale Shapley

Job Sequencing

K Centers

Merge Intervals

Minimizing Lateness

Optimal File Merging

Stock Profit Calculator

Méthodes gourmandes

Fractional Knapsack

Minimum Waiting Time

Hachage

Luhn

Io

Buffered Reader

Lineclipping

Cohen Sutherland

Liang Barsky

Line

Mathématiques

Intersection

Binary Exponentiation

Catalan Number

ADT Fraction

Absolute Max

Absolute Min

Absolute Value

Aliquot Sum

+5

Amicable Number

Area

Armstrong Number

+8

Auto Correlation

Automorphic Number

Average

Binary Pow

Binomial Coefficient

+1

Ceil

+1

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

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

Find Max Recursion

Find Min

+1

Find Min Recursion

Floor

Frizzy Number

GCD

GCD Recursion

Gaussian

Generic Root

Harshad Number

Herons Formula

Josephus Problem

Juggler Sequence

Kaprekar Numbers

Karatsuba Multiplication

Keith Number

Krishnamurthy Number

Least Common Multiple

Leonardo Number

Linear Diophantine Equations Solver

Liouville Lambda Function

Long Division

Lucas Series

Magic Square

Matrix Rank

Matrix Util

Max Value

Means

Median

Miller Rabin Primality Check

Min Value

Mobius Function

Mode

Non Repeating Element

Ugly Numbers

Number of Digits

Palindrome Number

Parse Integer

Perfect Cube

Perfect Number

+7

Perfect Square

+3

Perimeter

Pi Nilakantha

Pollard Rho

Pow

Power Of Two Or Not

Power Using Recursion

Prime Factorization

Pronic Number

Pythagorean Triple

Quadratic Equation Solver

Reverse Number

Roman Numeral Util

Second Min Max

Sieve of Eratosthenes

+4

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

+1

Sum Of Odd Numbers

Sum Without Arithmetic Operators

Trinomial Triangle

Twin Prime

Uniform Numbers

Vampire Number

Vector Cross Product

Volume

Matrice

Pascal Triangle

Inverse of Matrix

Flux de réseaux

Ford Fulkerson

Opérations sur les structures de données

Array Left Rotation

Array Right Rotation

Autres

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

BFPRT

Bankers Algorithm

Brian Kernighan Algorithm

CRC 16

CRC 32

CRC Algorithm

Conway

Damm

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

+1

Two Pointers

Verhoeff

Récurrence

Fibonacci Series

Récursivité

Flood Fill

Planification

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

Circular Look Scheduling

Circular Scan Scheduling

Look Scheduling

SSF Scheduling

Scan Scheduling

Recherches

BM 25 Inverted Index

Binary Search

+15

Binary Search 2d Array

Exponental Search

Fibonacci Search

+5

How Many Times Rotated

Interpolation Search

+6

Iterative Binary Search

Iterative Ternary Search

Jump Search

+8

KMP Search

Linear Search

+14

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

+5

Union Find

+1

Upper Bound

Fenêtre coulissante

Longest Subarray With Sum Less Or Equal To K

Max Sum K Size Subarray

Min Sum K Size Subarray

Tris

Adaptive Merge Sort

Bead Sort

+2

Binary Insertion Sort

+4

Bitonic Sort

Bogo Sort

+8

Bubble Sort

+19

Bubble Sort Recursive

Bucket Sort

+5

Circle Sort

Cocktail Shaker Sort

Comb Sort

+8

Counting Sort

+9

Cycle Sort

+5

Dual Pivot Quick Sort

Dutch National Flag Sort

Exchange Sort

Flash Sort

Gnome Sort

+8

Heap Sort

+15

Insertion Sort

+18

Introspective Sort

Link List Sort

Merge Sort No Extra Space

Merge Sort Recursive

Odd Even Sort

+2

Pancake Sort

+7

Patience Sort

+1

Pigeonhole Sort

+2

Quick Sort

+19

Radix Sort

+9

Selection Sort

+14

Selection Sort Recursive

Shell Sort

+10

Simple Sort

Slowsort

Sort Algorithm

Sort Utils

Sort Utils Random Generator

Spread Sort

Stalin Sort

Stooge Sort

+1

Strand Sort

Swap Sort

Tim Sort

+3

Topological Sort

+2

Tree Sort

Wave Sort

Wiggle Sort

Piles

Balanced Brackets

Celebrity Finder

Decimal To Any Using Stack

Duplicate Brackets

Greatest Element Constant Time

Infix To Postfix

Infix To Prefix

Largest Rectangle

Maximum Minimum Window

Min Stack Using Single Stack

Min Stack Using Two Stacks

Next Smaller Element

Palindrome With Stack

Postfix Evaluator

Postfix To Infix

Prefix Evaluator

Prefix To Infix

Smallest Element Constant Time

Sort Stack

Stack Postfix Notation

Chaînes de caractère

Hamming Distance

+7

Levenshtein Distance

+2

Boyer Moore

Hamming Distance

+7

Aho Corasick

Alphabetical

Anagram

Characters Same

Check Anagram

+2

Check Vowels

Count Char

Count Words

Hamming Distance

+7

Horspool Search

Isomorphic

KMP

Letter Combinations Of Phone Number

Longest Common Prefix

Longest Non Repetitive Substring

Lower

Manacher

My Atoi

Palindrome

+2

Pangram

Permute String

Rabin Karp

+2

Return Subsequence

Reverse String

Reverse String Recursive

Reverse Words In String

String Compression

String Match Finite Automata

Upper

Valid Parentheses

Zig Zag Pattern

© The Algorithms 2024

Qu'est-ce qu'un algorithme ?À propos de nous Langages de programmation Contribuer Faire un don

GitHub Gitter X Code source Contact

Powered by Vercel