Data Structures - The Algorithms

The Algorithms

Data Structures

Evaluate Postfix Notations

Postfix Evaluation

Balanced Parentheses

Stock Span Problem

Stack with Doubly Linked List

Prefix Evaluation

Stack with Singly Linked List

+2

Infix to Postfix Conversion

Infix to Prefix Conversion

Dijkstras Two Stack Algorithm

Stack

+2

Next Greater Element

Double Ended Queue

Queue on List

Linked Queue

Circular Queue Linked List

Queue on Pseudo Stack

Priority Queue Using List

Circular Queue

Double Hash

Hash Table

Hash Table with Linked List

Prime

+7

Quadratic Probing

Distribute Coins

Binary Tree Mirror

Basic Binary Tree

Binary Search Tree

+1

Maximum Fenwick Tree

Inorder Tree Traversal 2022

Red Black Tree

Segment Tree Other

Merge Two Binary Trees

Binary Tree Node Sum

Binary Tree Traversals

Binary Tree Path Sum

Lazy Segment Tree

Treap

Segment Tree

+2

Non Recursive Segment Tree

Is Bst

Wavelet Tree

Lowest Common Ancestor

AVL Tree

+1

Number of Possible Binary Trees

Diff Views of Binary Tree

Fenwick Tree

Binary Search Tree Recursive

Disjoint Set

Alternate Disjoint Set

Print Reverse

Middle Element of Linked List

Skip List

Has Loop

Doubly Linked List Two

Singly Linked List

+1

Merge Two Lists

Is Palindrome

Doubly Linked List

+2

Deque Doubly

Circular Linked List

Swap Nodes

From Sequence

Permutations

Prefix Sum

Randomized Heap

Skew Heap

Min Heap

Heap

Max Heap

Heap Generic

Binomial Heap

Trie

Radix Tree

Queue Using 2 Stacks

Queue

+1

Min Priority Queue

Vector 2

Local Maximom Point

Number Of Local Maximum Points

Reverse

Stack ES 6

Graph 3

Graph 2

Graph

Cycle Detection

Singly Circular Linked List

Reverse Singly Linked List

Add Two Numbers

Dsu Path Compression

Circular Queue Using Linked List

Trie Tree

Trie Modern

Rb Tree

Trie Using Hashmap

Bloom Filter

Sparse Table

Stack Using Array

Node

List Array

Tree

Queue Using Array 2

Morrisinorder

Linkedlist Implentation Usingarray

Reverse a Linked List

Binary Search Tree 2

Stack Using Queue

Dsu Union Rank

Queue Using Linkedlist

Linked List

Queue Using Array

Tree 234

Queue Using Two Stacks

Main Cll

Cll

Binaryheap

Infix To Postfix

Node Stack

Next Grater Element

Duplicate Brackets

Calculate Max Of Min

Stack Array

Next Smaller Element

Decimal To Any Using Stack

Stack Array List

Postfix To Infix

Maximum Minimum Window

Balanced Brackets

Largest Rectangle

Reverse Stack

Disjoint Sets

Bag

Nearest Right Key

KD Tree

Valid BST Or Not

Print Top Viewof Tree

Level Order Traversal Queue

Level Order Traversal

Ceil In Binary Search Tree

Red Black BST

BST Recursive

LCA

Binary Tree

Trie Imp

BST Iterative

Vertical Order Traversal

Generic Tree

Check Tree Is Symmetric

Check If Binary Tree Balanced

Tree Random Node

BST Recursive Generic

Create Binary Tree From Inorder Preorder

AVL Simple

Zigzag Traversal

Tree Traversal

Same Trees Check

Create BST From Sorted Array

Dynamic Array

Random Node

Count Singly Linked List Recursion

Create And Detect Loop

Cursor Linked List

Merge Sorted Array List

Search Singly Linked List Recursion

Circle Linked List

Merge Sorted Singly Linked List

Merge K Sorted Linkedlist

Circular Buffer

Bipartite Grapf DFS

Cycles

Kahns Algorithm

Graphs

DIJSKSTRAS ALGORITHM

Connected Component

Matrix Graphs

MRU Cache

Generic Hash Map Using Array List

Hash Map Linear Probing

Generic Hash Map Using Array

Hash Map Cuckoo Hashing

Hash Map

Main Cuckoo Hashing

Main Linear Probing

Main

Fibonacci Heap

Generic Heap

Empty Heap Exception

Heap Element

Leftist Heap

Priority Queues

Queues

Generic Array List Queue

Deques

Words Alphabetical

Create Node

Threaded Binary Trees

Recursive Traversals

List

Carray

Queue Linked List

Middle Element in List

Singly Link List Deletion

Merge Linked Lists

Ascending Priority Queue

Hash Set

Euler

Bfs

Dfs Recursive

Transitive Closure

Dfs

Hamiltonian

Bfs Queue

Dict

Vector

Parenthesis

B Tree

Priority Queue

List Queue

Min Heap Two

Quad Tree

Array Stack

Cycle in Linked List

Hashing

Preorder Traversal

Postorder Traversal

Invert

Inorder Traversal

3sum

Find All Duplicates in an Array

Single Number

Add Digits

Shortest Word Distance

Richest Customer Wealth

Good Pairs

Sort Squares of an Array

Remove Vowels

Jewels and Stones

Almost Palindrome Checker

Find the Highest Altitude

Two Sum Ii

Remove Elements

Max 69 Number

Shuffle Array

Get Products of All Other Elements

Maximum Product Subarray

Sorted Arrays Intersection

Common Characters

Arrays Intersection

Isomorphic Strings

Uncommon Words

Splay

Basic Binary Search Tree

Data Structure

Table Stack

Prefix Aggregate List

Linked Deque

Median Heap

Table List

Table Heap

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