The Algorithms logo
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

Infix to Postfix Conversion

Infix to Prefix Conversion

Dijkstras Two Stack Algorithm

Next Greater Element

Double Ended Queue

Circular Queue Linked List

Queue on Pseudo Stack

Priority Queue Using List

Hash Table with Linked List

Quadratic Probing

Binary Search Tree

Maximum Fenwick Tree

Inorder Tree Traversal 2022

Merge Two Binary Trees

Binary Tree Node Sum

Binary Tree Traversals

Binary Tree Path Sum

Non Recursive Segment Tree

Lowest Common Ancestor

Number of Possible Binary Trees

Diff Views of Binary Tree

Binary Search Tree Recursive

Alternate Disjoint Set

Middle Element of Linked List

Doubly Linked List Two

Singly Linked List

Doubly Linked List

Circular Linked List

Randomized Heap

Queue Using 2 Stacks

Min Priority Queue

Local Maximom Point

Number Of Local Maximum Points

Singly Circular Linked List

Reverse Singly Linked List

Dsu Path Compression

Circular Queue Using Linked List

Trie Using Hashmap

Stack Using Array

Queue Using Array 2


Linkedlist Implentation Usingarray

Reverse a Linked List

Binary Search Tree 2

Stack Using Queue

Dsu Union Rank

Queue Using Linkedlist

Queue Using Array

Queue Using Two Stacks

Infix To Postfix

Next Grater Element

Duplicate Brackets

Calculate Max Of Min

Next Smaller Element

Decimal To Any Using Stack

Stack Array List

Postfix To Infix

Maximum Minimum Window

Balanced Brackets

Largest Rectangle

Disjoint Sets

Nearest Right Key

Valid BST Or Not

Print Top Viewof Tree

Level Order Traversal Queue

Level Order Traversal

Ceil In Binary Search Tree

Vertical Order Traversal

Check Tree Is Symmetric

Check If Binary Tree Balanced

Tree Random Node

BST Recursive Generic

Create Binary Tree From Inorder Preorder

Zigzag Traversal

Same Trees Check

Create BST From Sorted Array

Dynamic Array

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

Bipartite Grapf DFS


Connected Component

Generic Hash Map Using Array List

Hash Map Linear Probing

Generic Hash Map Using Array

Hash Map Cuckoo Hashing

Empty Heap Exception

Generic Array List Queue

Threaded Binary Trees

Recursive Traversals

Middle Element in List

Singly Link List Deletion

Ascending Priority Queue

Transitive Closure

Cycle in Linked List

Postorder Traversal

Find All Duplicates in an Array

Shortest Word Distance

Richest Customer Wealth

Sort Squares of an Array

Almost Palindrome Checker

Find the Highest Altitude

Remove Elements

Get Products of All Other Elements

Maximum Product Subarray

Sorted Arrays Intersection

Arrays Intersection

Basic Binary Search Tree

Data Structure

Prefix Aggregate List