Data Structures

𝔸𝕝𝕘𝕖𝕣

About

Data Structures

Min Heap

Binomial Heap

Max Heap

Heap Generic

Skew Heap

Randomized Heap

Heap

Prime Numbers

Hash Table with Linked List

Hash Table

Quadratic Probing

Double Hash

Skip List

Doubly Linked List

Merge Two Lists

From Sequence

Middle Element of Linked List

Circular Linked List

Is Palindrome

Print Reverse

Deque Doubly

Swap Nodes

Singly Linked List

Has Loop

Doubly Linked List Two

Binary Search Tree Recursive

Fenwick Tree

Binary Tree Traversals

Lazy Segment Tree

Red Black Tree

Wavelet Tree

Treap

Merge Two Binary Trees

Number of Possible Binary Trees

AVL Tree

Basic Binary Tree

Segment Tree

Lowest Common Ancestor

Segment Tree Other

Non Recursive Segment Tree

Binary Tree Mirror

Binary Search Tree

Trie

Queue on List

Double Ended Queue

Circular Queue

Circular Queue Linked List

Linked Queue

Priority Queue Using List

Queue on Pseudo Stack

Stack

Prefix Evaluation

Dijkstras Two Stack Algorithm

Balanced Parentheses

Postfix Evaluation

Evaluate Postfix Notations

Next Greater Element

Stack with Doubly Linked List

Stack with Singly Linked List

Infix to Postfix Conversion

Infix to Prefix Conversion

Stock Span Problem

Disjoint Set

Alternate Disjoint Set

Min Priority Queue

Vector 2

Stack ES 6

Singly Circular Linked List

Add Two Numbers

Rotate List Right

Cycle Detection

Graph 2

Graph 3

Graph

Local Maximom Point

Number Of Local Maximum Points

Queue

Queue Using 2 Stacks

Linked List

Queue Using Array 2

Binaryheap

Morrisinorder

Tree 234

Trie Tree

Circular Queue Using Linked List

Rb Tree

Dsu Path Compression

Stack Using Queue

Dsu Union Rank

Queue Using Array

Binary Search Tree 2

Cll

Main Cll

Queue Using Linked List

List Array

Stack Using Array

Trie Modern

Linkedlist Implentation Usingarray

Queue Using Two Stacks

Tree

Reverse a Linked List

Trie Using Hashmap

MRU Cache

Heap Element

Fibonacci Heap

Empty Heap Exception

Bloom Filter

Disjoint Sets

Node

Circular Buffer

Main

Hash Map

Main Linear Probing

Hash Map Linear Probing

Cycles

Bipartite Grapf DFS

Connected Component

DIJSKSTRAS ALGORITHM

Kahns Algorithm

Graphs

Matrix Graphs

Dynamic Array

Cursor Linked List

Random Node

Search Singly Linked List Recursion

Merge Sorted Singly Linked List

Circle Linked List

Count Singly Linked List Recursion

Merge Sorted Array List

Create And Detect Loop

Merge K Sorted Linkedlist

BST Recursive Generic

Level Order Traversal Queue

Binary Tree

Check If Binary Tree Balanced

Create BST From Sorted Array

Generic Tree

Print Top Viewof Tree

AVL Simple

BST Iterative

Valid BST Or Not

Tree Random Node

Trie Imp

BST Recursive

LCA

Level Order Traversal

Vertical Order Traversal

Ceil In Binary Search Tree

Red Black BST

Nearest Right Key

Tree Traversal

Create Binary Tree From Inorder Preorder

Bag

Node Stack

Stack Array List

Decimal To Any Using Stack

Next Grater Element

Stack Array

Duplicate Brackets

Calculate Max Of Min

Balanced Brackets

Next Smaller Element

Largest Rectangle

Infix To Postfix

Reverse Stack

Maximum Minimum Window

Postfix To Infix

Priority Queues

Deques

Generic Array List Queue

Queues

Queue Linked List

Ascending Priority Queue

Singly Link List Deletion

Middle Element in List

Merge Linked Lists

List

Dict

Transitive Closure

Bfs

Hamiltonian

Euler

Bfs Queue

Dfs Recursive

Dfs

Carray

Parenthesis

Words Alphabetical

Threaded Binary Trees

Recursive Traversals

Create Node

Hash Set

B Tree

Min Heap Two

Quad Tree

Cycle in Linked List

Array Stack

Priority Queue

List Queue

Hashing

Uncommon Words

Common Characters

Arrays Intersection

Isomorphic Strings

Find All Duplicates in an Array

Anagram Checker

Richest Customer Wealth

Good Pairs

Sort Squares of an Array

Single Number

Max 69 Number

Two Sum Ii

3sum

Find the Highest Altitude

Get Products of All Other Elements

Remove Elements

Maximum Product Subarray

Remove Vowels

Almost Palindrome Checker

Jewels and Stones

Shortest Word Distance

Add Digits

Shuffle Array

Sorted Arrays Intersection

Preorder Traversal

Postorder Traversal

Invert

Inorder Traversal

Basic Binary Search Tree

Splay

Table Heap

Table List

Linked Deque

Median Heap

Table Stack

About us

We are a group of programmers helping each other build new things, whether it be writing complex encryption programs, or simple ciphers. Our goal is to work together to document and model beautiful, helpful and interesting algorithms using code. We are an open-source community - anyone can contribute. We check each other's work, communicate and collaborate to solve problems. We strive to be welcoming, respectful, yet make sure that our code follows the latest programming guidelines.