The Algorithms logo
The Algorithms
Acerca deDonar

Estructuras de datos

Next Greater Element

Stack with Singly Linked List

Dijkstras Two Stack Algorithm

Infix to Prefix Conversion

Stack with Doubly Linked List

Evaluate Postfix Notations

Balanced Parentheses

Infix to Postfix Conversion

Middle Element of Linked List

Number of Possible Binary Trees

Binary Search Tree Recursive

Non Recursive Segment Tree

Circular Queue Linked List

Priority Queue Using List

Queue on Pseudo Stack

Hash Table with Linked List

Min Priority Queue

Queue Using 2 Stacks

Local Maximom Point

Number Of Local Maximum Points

Single Circular Linked List

Stack Using Array

Queue Using Array

Stack Using Queue

Binary Search Tree 2

Linkedlist Implentation Usingarray

Queue Using Linked List

Dsu Path Compression

Queue Using Array 2

Reverse a Linked List

Trie Using Hashmap

Circular Queue Using Linked List

Queue Using Two Stacks

Level Order Traversal

Vertical Order Traversal

Create BST From Sorted Array

Ceil In Binary Search Tree

Check If Binary Tree Balanced

BST Recursive Generic

Print Top Viewof Tree

Level Order Traversal Queue

Create Binary Tree From Inorder Preorder

Next Smaller Element

Decimal To Any Using Stack

Next Grater Element

Maximum Minimum Window

Merge Sorted Singly Linked List

Remove Duplicate Nodes

Merge K Sorted Linkedlist

Merge Sorted Array List

Create And Detect Loop

Search Singly Linked List Recursion

Count Singly Linked List Recursion

Generic Array List Queue

Singly Link List Deletion

Find All Duplicates in an Array

Richest Customer Wealth

Maximum Product Subarray

Get Products of All Other Elements

Find the Highest Altitude

Sort Squares of an Array

Sorted Arrays Intersection

Almost Palindrome Checker