Data Structures
Product Sum
Prefix Sum
Permutations
Radix Tree
Trie
Prefix Evaluation
Dijkstras Two Stack Algorithm
Balanced Parentheses
Evaluate Postfix Notations
Postfix Evaluation
Stack
+2
Next Greater Element
Infix to Prefix Conversion
Infix to Postfix Conversion
Stock Span Problem
Stack with Singly Linked List
+3
Stack with Doubly Linked List
Middle Element of Linked List
Deque Doubly
Doubly Linked List
+3
Print Reverse
Merge Two Lists
From Sequence
Doubly Linked List Two
Is Palindrome
+1
Skip List
Swap Nodes
Circular Linked List
Has Loop
Singly Linked List
+3
Alternate Disjoint Set
Disjoint Set
Heap
+1
Binomial Heap
Randomized Heap
Min Heap
Max Heap
+1
Skew Heap
Heap Generic
Linked Queue
Circular Queue Linked List
Circular Queue
Double Ended Queue
Priority Queue Using List
Queue on List
Queue by Two Stacks
Queue on Pseudo Stack
Hash Map
Hash Table with Linked List
Double Hash
Hash Table
Bloom Filter
Quadratic Probing
Prime
+7
Lowest Common Ancestor
Binary Tree Path Sum
Treap
Inorder Tree Traversal 2022
Binary Search Tree Recursive
Lazy Segment Tree
Diff Views of Binary Tree
Maximum Fenwick Tree
Binary Tree Node Sum
Red Black Tree
Binary Tree Traversals
Segment Tree
+3
Distribute Coins
Is Bst
Merge Two Binary Trees
AVL Tree
+2
Fenwick Tree
Number of Possible Binary Trees
Basic Binary Tree
Binary Search Tree
+3
Binary Tree Mirror
Segment Tree Other
Wavelet Tree
Non Recursive Segment Tree
Number Of Local Maximum Points
Reverse
Local Maximom Point
Queue Using 2 Stacks
Queue
+1
Vector 2
Stack ES 6
Key Priority Queue
Min Priority Queue
Cycle Detection
Add Two Numbers
Singly Circular Linked List
Reverse Singly Linked List
Graph
Graph 3
Graph 2
Dsu Path Compression
Queue Using Two Stacks
Binary Search Tree 2
Queue Using Array 2
Linkedlist Implentation Usingarray
Tree 234
Dsu Union Rank
Trie Modern
Rb Tree
Queue Using Linkedlist
Trie Tree
Tree
Binaryheap
Queue Using Array
Stack Using Array
Circular Queue Using Linked List
Reverse a Linked List
Stack Using Queue
Node
List Array
Morrisinorder
Linked List
+1
