Data Structures - The Algorithms

The Algorithms

Data Structures

Lazy Segment Tree

Segment Tree

Maximum Fenwick Tree

Binary Search Tree

+1

Binary Tree Mirror

Merge Two Binary Trees

Treap

AVL Tree

+1

Fenwick Tree

Wavelet Tree

Lowest Common Ancestor

Segment Tree Other

Binary Tree Traversals

Red Black Tree

Number of Possible Binary Trees

Non Recursive Segment Tree

Binary Search Tree Recursive

Basic Binary Tree

Trie

Priority Queue Using List

Circular Queue

Double Ended Queue

Queue on Pseudo Stack

Queue on List

Circular Queue Linked List

Linked Queue

Circular Linked List

Doubly Linked List

+2

Deque Doubly

Doubly Linked List Two

Singly Linked List

+1

Print Reverse

Is Palindrome

Skip List

From Sequence

Middle Element of Linked List

Has Loop

Swap Nodes

Merge Two Lists

Disjoint Set

Alternate Disjoint Set

Max Heap

Skew Heap

Heap Generic

Binomial Heap

Heap

Min Heap

Randomized Heap

Hash Table

Hash Table with Linked List

Quadratic Probing

Double Hash

Balanced Parentheses

Next Greater Element

Stack with Doubly Linked List

Evaluate Postfix Notations

Stock Span Problem

Stack

+2

Infix to Postfix Conversion

Prefix Evaluation

Postfix Evaluation

Stack with Singly Linked List

+2

Infix to Prefix Conversion

Dijkstras Two Stack Algorithm

Min Priority Queue

Vector 2

Queue Using 2 Stacks

Queue

Local Maximom Point

Number Of Local Maximum Points

Singly Circular Linked List

Cycle Detection

Add Two Numbers

Graph 3

Graph 2

Graph

Stack ES 6

Dsu Path Compression

Queue Using Linkedlist

Linked List

Tree

Stack Using Queue

Queue Using Two Stacks

Binaryheap

Binary Search Tree 2

Trie Modern

Linkedlist Implentation Usingarray

List Array

Trie Tree

Rb Tree

Circular Queue Using Linked List

Cll

Main Cll

Reverse a Linked List

Dsu Union Rank

Bloom Filter

Trie Using Hashmap

Stack Using Array

Queue Using Array 2

Queue Using Array

Morrisinorder

Tree 234

Generic Hash Map Using Array

Hash Map

Hash Map Cuckoo Hashing

Generic Hash Map Using Array List

Hash Map Linear Probing

Main Cuckoo Hashing

Main Linear Probing

Main

Count Singly Linked List Recursion

Search Singly Linked List Recursion

Random Node

Merge K Sorted Linkedlist

Merge Sorted Singly Linked List

Circle Linked List

Cursor Linked List

Merge Sorted Array List

Create And Detect Loop

Node

Disjoint Sets

MRU Cache

Dynamic Array

Bag

Circular Buffer

Fibonacci Heap

Empty Heap Exception

Generic Heap

Heap Element

DIJSKSTRAS ALGORITHM

Cycles

Bipartite Grapf DFS

Kahns Algorithm

Connected Component

Graphs

Matrix Graphs

Red Black BST

AVL Simple

Generic Tree

Ceil In Binary Search Tree

Level Order Traversal

Nearest Right Key

BST Recursive

Print Top Viewof Tree

Tree Random Node

Level Order Traversal Queue

Create Binary Tree From Inorder Preorder

LCA

Tree Traversal

Vertical Order Traversal

Check If Binary Tree Balanced

BST Recursive Generic

Trie Imp

KD Tree

Binary Tree

Valid BST Or Not

BST Iterative

Create BST From Sorted Array

Deques

Priority Queues

Generic Array List Queue

Queues

Next Grater Element

Stack Array

Maximum Minimum Window

Reverse Stack

Infix To Postfix

Stack Array List

Postfix To Infix

Node Stack

Decimal To Any Using Stack

Calculate Max Of Min

Balanced Brackets

Largest Rectangle

Next Smaller Element

Duplicate Brackets

Parenthesis

Hash Set

Threaded Binary Trees

Create Node

Recursive Traversals

Words Alphabetical

Singly Link List Deletion

Queue Linked List

Ascending Priority Queue

Middle Element in List

Merge Linked Lists

Carray

Hamiltonian

Dfs

Dfs Recursive

Euler

Bfs Queue

Transitive Closure

Bfs

Dict

List

B Tree

Min Heap Two

Hashing

Quad Tree

List Queue

Priority Queue

Cycle in Linked List

Array Stack

Postorder Traversal

Inorder Traversal

Preorder Traversal

Invert

Single Number

Find All Duplicates in an Array

Shuffle Array

Two Sum Ii

Sorted Arrays Intersection

Sort Squares of an Array

Find the Highest Altitude

Good Pairs

3sum

Maximum Product Subarray

Remove Elements

Shortest Word Distance

Richest Customer Wealth

Get Products of All Other Elements

Remove Vowels

Anagram Checker

Almost Palindrome Checker

Jewels and Stones

Max 69 Number

Common Characters

Isomorphic Strings

Arrays Intersection

Uncommon Words

Basic Binary Search Tree

Splay

Table List

Median Heap

Table Stack

Linked Deque

Table Heap

© The Algorithms 2022

What is an algorithm?About us Programming Languages Contribute Donate

GitHub Gitter Twitter Source code Contact

Powered by Vercel