The Algorithms logo
The Algorithms
AboutDonate

Data Structures

Stack with Doubly Linked List

Balanced Parentheses

Stack with Singly Linked List

Stock Span Problem

Infix to Prefix Conversion

Dijkstras Two Stack Algorithm

Postfix Evaluation

Prefix Evaluation

Evaluate Postfix Notations

Infix to Postfix Conversion

Next Greater Element

Hash Table with Linked List

Quadratic Probing

Singly Linked List

Middle Element of Linked List

Circular Linked List

Doubly Linked List

Doubly Linked List Two

Priority Queue Using List

Double Ended Queue

Queue on Pseudo Stack

Circular Queue Linked List

Randomized Heap

Alternate Disjoint Set

Lowest Common Ancestor

Number of Possible Binary Trees

Non Recursive Segment Tree

Binary Search Tree

Binary Search Tree Recursive

Binary Tree Traversals

Merge Two Binary Trees

Queue Using 2 Stacks

Single Circular Linked List

Min Priority Queue

Local Maximom Point

Number Of Local Maximum Points

Morrisinorder

Dsu Path Compression

Circular Queue Using Linked List

Linkedlist Implentation Usingarray

Queue Using Linked List

Queue Using Two Stacks

Stack Using Queue

Queue Using Array

Reverse a Linked List

Dsu Union Rank

Queue Using Array 2

Stack Using Array

Trie Using Hashmap

Binary Search Tree 2

Level Order Traversal

Level Order Traversal Queue

Check If Binary Tree Balanced

Print Top Viewof Tree

Vertical Order Traversal

Create BST From Sorted Array

Ceil In Binary Search Tree

Nearest Right Key

Create Binary Tree From Inorder Preorder

Valid BST Or Not

Tree Random Node

BST Recursive Generic

Next Smaller Element

Decimal To Any Using Stack

Maximum Minimum Window

Balanced Brackets

Postfix To Infix

Largest Rectangle

Infix To Postfix

Duplicate Brackets

Next Grater Element

Stack Array List

Dynamic Array

Merge Sorted Array List

Merge Sorted Singly Linked List

Search Singly Linked List Recursion

Cursor Linked List

Count Singly Linked List Recursion

Merge K Sorted Linkedlist

Circle Linked List

Create And Detect Loop

Disjoint Sets

Empty Heap Exception

Generic Array List Queue

Connected Component

Bipartite Grapf DFS

DIJSKSTRAS ALGORITHM

Hash Map Linear Probing

Recursive Traversals

Threaded Binary Trees

Middle Element in List

Singly Link List Deletion

Ascending Priority Queue

Transitive Closure

Cycle in Linked List

Postorder Traversal

Sorted Arrays Intersection

Richest Customer Wealth

Maximum Product Subarray

Find All Duplicates in an Array

Find the Highest Altitude

Sort Squares of an Array

Get Products of All Other Elements

Shortest Word Distance

Almost Palindrome Checker

Remove Elements

Arrays Intersection

Basic Binary Search Tree