The Algorithms logo
The Algorithms

Data Structures

Randomized Heap

Double Ended Queue

Circular Queue Linked List

Queue on Pseudo Stack

Priority Queue Using List

Infix to Postfix Conversion

Stack with Doubly Linked List

Next Greater Element

Balanced Parentheses

Postfix Evaluation

Stack with Singly Linked List

Stock Span Problem

Prefix Evaluation

Infix to Prefix Conversion

Dijkstras Two Stack Algorithm

Evaluate Postfix Notations

Maximum Fenwick Tree

Binary Tree Path Sum

Binary Search Tree

Merge Two Binary Trees

Binary Search Tree Recursive

Binary Tree Traversals

Lowest Common Ancestor

Inorder Tree Traversal 2022

Non Recursive Segment Tree

Number of Possible Binary Trees

Diff Views of Binary Tree

Binary Tree Node Sum

Singly Linked List

Circular Linked List

Middle Element of Linked List

Doubly Linked List

Doubly Linked List Two

Alternate Disjoint Set

Quadratic Probing

Hash Table with Linked List

Queue Using 2 Stacks

Local Maximom Point

Number Of Local Maximum Points

Singly Circular Linked List

Reverse Singly Linked List

Min Priority Queue

Key Priority Queue

Queue Using Array 2

Stack Using Array

Queue Using Linkedlist

Queue Using Array

Trie Using Hashmap

Queue Using Two Stacks

Binary Search Tree 2

Dsu Union Rank


Circular Queue Using Linked List

Dsu Path Compression

Linked List

Reverse a Linked List

Linkedlist Implentation Usingarray

Stack Using Queue

Connected Component

Bipartite Grapf DFS

Tarjans Algorithm


Empty Heap Exception

Generic Array List Queue

Linear Probing Hash Map

Hash Map Cuckoo Hashing

Generic Hash Map Using Array List

Generic Hash Map Using Array

BST Recursive Generic

Valid BST Or Not

Create BST From Sorted Array

Check Tree Is Symmetric

Same Trees Check

Level Order Traversal Helper

Check If Binary Tree Balanced

Tree Random Node

Create Binary Tree From Inorder Preorder

Level Order Traversal

Vertical Order Traversal

Ceil In Binary Search Tree

Nearest Right Key

Print Top Viewof Tree

Pre Order Traversal

Post Order Traversal

Zigzag Traversal

Inorder Traversal

Dynamic Array

Duplicate Brackets

Postfix To Infix

Next Smaller Element

Infix To Postfix

Calculate Max Of Min

Decimal To Any Using Stack

Maximum Minimum Window

Stack Array List

Largest Rectangle

Balanced Brackets

Next Grater Element

Disjoint Sets

Circle Linked List

Count Singly Linked List Recursion

Cursor Linked List

Merge K Sorted Linkedlist

Merge Sorted Singly Linked List

Create And Detect Loop

Search Singly Linked List Recursion

Merge Sorted Array List

Transitive Closure

Threaded Binary Trees

Recursive Traversals

Ascending Priority Queue

Circular Doubly Linked List

Singly Link List Deletion

Middle Element in List

Cycle in Linked List

Find All Duplicates in an Array

Sorted Arrays Intersection

Find the Highest Altitude

Almost Palindrome Checker

Maximum Product Subarray

Shortest Word Distance

Remove Elements

Richest Customer Wealth

Sort Squares of an Array

Get Products of All Other Elements

Arrays Intersection

Basic Binary Search Tree

Data Structure

Prefix Aggregate List