Data Structures
Queue on Pseudo Stack
Priority Queue Using List
Linked Queue
Double Ended Queue
Circular Queue
Circular Queue Linked List
Queue by Two Stacks
Queue by List
Heap
+2
Randomized Heap
Heap Generic
Min Heap
Max Heap
Binomial Heap
Skew Heap
Equilibrium Index in Array
Sparse Table
Index 2d Array in 1d
Permutations
Find Triplets with 0 Sum
Pairs with Given Sum
Product Sum
Prefix Sum
Kth Largest Element
Monotonic Array
Median Two Array
Rotate Array
Postfix Evaluation
Largest Rectangle Histogram
Stack with Doubly Linked List
Next Greater Element
Kth Next Greater Element
Prefix Evaluation
Stack with Singly Linked List
+3
Balanced Parentheses
Infix to Postfix Conversion
Lexicographical Numbers
Dijkstras Two Stack Algorithm
Stock Span Problem
Stack Using Two Queues
Stack
+5
Infix to Prefix Conversion
Trie
+4
Radix Tree
Nearest Neighbour Search
Kd Node
Example Usage
Hypercube Points
Build Kdtree
Lazy Segment Tree
Number of Possible Binary Trees
Binary Search Tree
+4
Fenwick Tree
+1
Binary Tree Path Sum
Maximum Sum Bst
Merge Two Binary Trees
Diff Views of Binary Tree
Red Black Tree
Is Sum Tree
Binary Tree Mirror
Serialize Deserialize Binary Tree
Binary Tree Node Sum
Non Recursive Segment Tree
Binary Search Tree Recursive
Basic Binary Tree
Binary Tree Maximum Path Sum
Mirror Binary Tree
AVL Tree
+4
Distribute Coins
Splay Tree
Inorder Tree Traversal 2022
Flatten Binarytree to Linkedlist
Lowest Common Ancestor
Segment Tree
+4
Symmetric Tree
Wavelet Tree
Treap
Floor and Ceiling
Is Sorted
Diameter of Binary Tree
Maximum Fenwick Tree
Segment Tree Other
Binary Tree Traversals
Sorted Linked List
Deque Doubly
Floyds Cycle Detection
Singly Linked List
+4
Partition Linked List
Doubly Linked List
+7
Rotate to the Right
Has Loop
Middle Element of Linked List
From Sequence
Merge Sort Linked List
Circular Linked List
Reverse K Group
Kth Element From End
Merge Two Lists
Print Reverse
Swap Nodes
Xor Linked List
Is Palindrome
+2
Skip List
Doubly Linked List Two
Hash Table
Bloom Filter
Quadratic Probing
Hash Table with Linked List
Double Hash
Hash Map
Disjoint Set
Alternate Disjoint Set
Suffix Tree
Suffix Tree Node
Queue Using 2 Stacks
Queue
+4
Number Of Local Maximum Points
Local Maximum Point
Reverse
Singly Circular Linked List
Merge Two Sorted Linked Lists
Cycle Detection II
Add Two Numbers
Cycle Detection
Reverse Singly Linked List
Key Priority Queue
Min Priority Queue
Binary Heap
Vector 2
Graph
+1
Graph 2
Graph 3
Stack ES 6
Evaluate Expression
Linkedlist Implentation Usingarray
Trie Tree
Queue Using Array
Queue Using Two Stacks
Dsu Union Rank
Stack Using Queue
Queue Using Linked List
Circular Queue Using Linked List
Linked List
+1
