Must read research papers on Data Structures


0

101

December 21, 2019

Autocomplete Feature using Ternary Search Tree


0

118

December 19, 2019

Autocomplete feature using TRIE Data Structure


0

86

December 16, 2019

Max Heap and Min Heap


1

412

October 27, 2019

Implement Least Recently Used (LRU) Cache


0

129

October 27, 2019

Gap Buffer


0

118

October 25, 2019

Interval Trees: One step beyond BST


0

153

October 16, 2019

Sparse Tables


0

121

October 5, 2019

Persistent Segment Tree


0

129

August 29, 2019

Solving Unbounded Knapsack Problem using Dynamic Programming


0

122

August 29, 2019

Rope: the Data Structure used by text editors to handle large strings


0

123

August 24, 2019

Converting Postfix to Infix using Stack


0

253

August 3, 2019

Learn how to traverse a Tree (Inorder , Preorder , Postorder)


0

679

July 30, 2019

Optimizing a Segment Tree with Lazy Propagation


0

124

July 29, 2019

Understand everything about Binary Search Tree


0

139

July 25, 2019

Fibonacci Heap


0

159

July 12, 2019

Bit Mask


0

295

July 8, 2019

Pairing Heap


0

116

June 6, 2019

Leftist Heap


0

99

May 26, 2019

Merge Sort a singly Linked List


1

178

May 21, 2019

Binomial Heap


0

133

May 20, 2019

Priority Queue


0

114

May 20, 2019

Implementing Stack using queues in two ways


0

122

May 17, 2019

Stack data structure


0

134

May 13, 2019

Union Find (Disjoint Set)


0

133

May 9, 2019

K Dimensional Tree


0

127

May 2, 2019

Hash Map / Hash table


0

106

April 26, 2019

XOR Linked List


0

187

April 22, 2019

List in Java


0

117

April 13, 2019

Circular Queue / Ring Buffer / Circular Buffer


0

189

April 9, 2019
