Data Structures - The Algorithms

The Algorithms

Data Structures

Quadratic Probing

Hash Map

Hash Table

Bloom Filter

Double Hash

Hash Table with Linked List

Evaluate Postfix Notations

Infix to Prefix Conversion

Stock Span Problem

Stack with Doubly Linked List

Postfix Evaluation

Infix to Postfix Conversion

Next Greater Element

Prefix Evaluation

Dijkstras Two Stack Algorithm

Stack with Singly Linked List

+3

Stack

+2

Balanced Parentheses

Radix Tree

Trie

Treap

Red Black Tree

Number of Possible Binary Trees

Inorder Tree Traversal 2022

Maximum Fenwick Tree

Wavelet Tree

Distribute Coins

Segment Tree

+3

Binary Search Tree Recursive

Binary Search Tree

+3

Merge Two Binary Trees

Lazy Segment Tree

Non Recursive Segment Tree

Binary Tree Path Sum

AVL Tree

+2

Binary Tree Traversals

Fenwick Tree

Basic Binary Tree

Lowest Common Ancestor

Segment Tree Other

Diff Views of Binary Tree

Is Bst

Binary Tree Mirror

Binary Tree Node Sum

Alternate Disjoint Set

Disjoint Set

Prefix Sum

Product Sum

Permutations

Circular Linked List

Skip List

Merge Two Lists

Singly Linked List

+3

Deque Doubly

Swap Nodes

Is Palindrome

+1

Has Loop

Doubly Linked List Two

From Sequence

Middle Element of Linked List

Print Reverse

Doubly Linked List

+3

Linked Queue

Double Ended Queue

Queue by Two Stacks

Queue on Pseudo Stack

Queue on List

Priority Queue Using List

Circular Queue Linked List

Circular Queue

Min Heap

Heap

+1

Max Heap

+1

Binomial Heap

Randomized Heap

Skew Heap

Heap Generic

Stack ES 6

Queue Using 2 Stacks

Queue

+1

Reverse

Number Of Local Maximum Points

Local Maximom Point

Reverse Singly Linked List

Singly Circular Linked List

Add Two Numbers

Cycle Detection

Graph 3

Graph

Graph 2

Key Priority Queue

Min Priority Queue

Vector 2

Tree 234

Trie Using Hashmap

Binary Search Tree 2

Queue Using Two Stacks

Queue Using Array

Trie Modern

Circular Queue Using Linked List

List Array

Queue Using Linked List

Stack Using Array

Reverse a Linked List

Dsu Union Rank

Linkedlist Implentation Usingarray

Node

Cll

Main Cll

Morrisinorder

Dsu Path Compression

Stack Using Queue

Tree

Queue Using Array 2

Binaryheap

Rb Tree

Trie Tree

Sparse Table

Linked List

+1

Infix To Postfix

Reverse Stack

Maximum Minimum Window

Decimal To Any Using Stack

Node Stack

Stack Array List

Next Smaller Element

Next Grater Element

Largest Rectangle

Duplicate Brackets

Calculate Max Of Min

Stack Array

Postfix To Infix

Balanced Brackets

Bag

Dynamic Array

Tarjans Algorithm

DIJSKSTRAS ALGORITHM

Graphs

Bipartite Grapf DFS

Connected Component

Matrix Graphs

Kahns Algorithm

Cycles

KD Tree

Vertical Order Traversal

Zigzag Traversal

Inorder Traversal

Tree Random Node

Print Top Viewof Tree

Check Binary Tree Is Valid BST

Pre Order Traversal

Create Binary Tree From Inorder Preorder

LCA

Binary Tree

Trie Imp

BST From Sorted Array

Ceil In Binary Search Tree

Check If Binary Tree Balanced

BST Recursive Generic

Post Order Traversal

AVL Simple

Level Order Traversal

BST Iterative

Check Tree Is Symmetric

Nearest Right Key

BST Recursive

Red Black BST

Generic Tree

Same Trees Check

Leftist Heap

Empty Heap Exception

Fibonacci Heap

Heap Element

Generic Heap

Disjoint Sets

Majority Element

Main

Generic Hash Map Using Array List

Generic Hash Map Using Array

Hash Map Cuckoo Hashing

Main Cuckoo Hashing

Map

Linear Probing Hash Map

Circular Buffer

MRU Cache

Priority Queues

Deques

Generic Array List Queue

Queues

Search Singly Linked List Recursion

Merge Sorted Singly Linked List

Count Singly Linked List Recursion

Create And Detect Loop

Merge Sorted Array List

Cursor Linked List

Merge K Sorted Linkedlist

Random Node

Circle Linked List

Create Node

Recursive Traversals

Threaded Binary Trees

Words Alphabetical

List

Euler

Dfs Recursive

Bfs

Dfs

Bfs Queue

Hamiltonian

Transitive Closure

Dict

Hash Set

Vector

Carray

Dynamic Stack

Parenthesis

Middle Element in List

Queue Linked List

Singly Link List Deletion

Ascending Priority Queue

Circular Doubly Linked List

Merge Linked Lists

Count Min Sketch

Segment Tree Recursive

B Tree

Veb Tree

Array Stack

List Queue

Priority Queue

Hashing

Min Heap Two

Quad Tree

Cycle in Linked List

Merge Sorted List

Invert

Bst

Richest Customer Wealth

Uncommon Words

Common Characters

Find All Duplicates in an Array

Arrays Intersection

Good Pairs

Weighted Graph

Unweighted Graph

Single Number

Almost Palindrome Checker

Remove Vowels

Jewels and Stones

Shortest Word Distance

Shuffle Array

Sort Squares of an Array

Maximum Product Subarray

3sum

Sorted Arrays Intersection

Remove Elements

Get Products of All Other Elements

Max 69 Number

Find the Highest Altitude

Two Sum Ii

Splay

Basic Binary Search Tree

Data Structure

Table Heap

Sorted Table

Sorted Set

Undirected Graph

Table List

Table Stack

Median Heap

Prefix Aggregate List

Linked Deque

Map Set

Hash Map Set

Array Queue

Stack Queue

© The Algorithms 2023

What is an algorithm?About us Programming Languages Contribute Donate

GitHub Gitter Twitter Source code Contact

Powered by Vercel