DataStructure/

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

Links

Open Source Insights

Directories ¶

Path	Synopsis
02-Arrays
01-Array-Basics/src command
02-Create-Our-Own-Array/src command
02-Create-Our-Own-Array/src/Array
03-Add-Element-in-Array/src command
03-Add-Element-in-Array/src/Array
04-Query-and-Update-Element/src command
04-Query-and-Update-Element/src/Array
05-Contain-Find-and-Remove/src command
05-Contain-Find-and-Remove/src/Array
06-Generic-Data-Structure/src command
06-Generic-Data-Structure/src/Array
06-Generic-Data-Structure/src/Student
07-Dynamic-Array/src command
07-Dynamic-Array/src/Array
09-Amortized-Time-Complexity/src command
09-Amortized-Time-Complexity/src/Array
03-Stacks-and-Queues
02-Array-Stack/src command
02-Array-Stack/src/Array
02-Array-Stack/src/ArrayStack
02-Array-Stack/src/Stack
03-A-Stack-Problem-in-Leetcode/src/Solution command
04-More-about-Leetcode/src/Array
04-More-about-Leetcode/src/ArrayStack
04-More-about-Leetcode/src/Solution command
04-More-about-Leetcode/src/Stack
05-Array-Queue/src command
05-Array-Queue/src/Array
05-Array-Queue/src/ArrayQueue
05-Array-Queue/src/Queue
05-Array-Queue/src/Solution command
06-Loop-Queue/src command
06-Loop-Queue/src/Array
06-Loop-Queue/src/ArrayQueue
06-Loop-Queue/src/LoopQueue
06-Loop-Queue/src/Queue
07-Implementation-of-Loop-Queue/src command
07-Implementation-of-Loop-Queue/src/Array
07-Implementation-of-Loop-Queue/src/ArrayQueue
07-Implementation-of-Loop-Queue/src/LoopQueue
07-Implementation-of-Loop-Queue/src/Queue
08-Queues-Comparison/src command
08-Queues-Comparison/src/Array
08-Queues-Comparison/src/ArrayQueue
08-Queues-Comparison/src/LoopQueue
08-Queues-Comparison/src/Queue
Optional-01-Loop-Queue-without-Wasting-One-Space/src/LoopQueue command
Optional-01-Loop-Queue-without-Wasting-One-Space/src/Queue
Optional-01-Loop-Queue-without-Wasting-One-Space/src/Solution
Optional-02-Loop-Queue-without-Size-Member/src/LoopQueue command
Optional-02-Loop-Queue-without-Size-Member/src/Queue
Optional-02-Loop-Queue-without-Size-Member/src/Solution
04-Linked-List
01-Linked-List-Basics/src/LinkedList
02-Add-Elements-in-LinkedList/src/LinkedList
03-DummyHead-in-LinkedList/src/LinkedList
04-Query-and-Update-in-LinkedList/src command
04-Query-and-Update-in-LinkedList/src/LinkedList
05-Remove-Element-in-LinkedList/src command
05-Remove-Element-in-LinkedList/src/LinkedList
06-Implement-Stack-in-LinkedList/src command
06-Implement-Stack-in-LinkedList/src/Array
06-Implement-Stack-in-LinkedList/src/ArrayStack
06-Implement-Stack-in-LinkedList/src/LinkedList
06-Implement-Stack-in-LinkedList/src/LinkedListStack
06-Implement-Stack-in-LinkedList/src/Solution command
06-Implement-Stack-in-LinkedList/src/Stack
07-Implement-Queue-in-LinkedList/src command
07-Implement-Queue-in-LinkedList/src/Array
07-Implement-Queue-in-LinkedList/src/ArrayQueue
07-Implement-Queue-in-LinkedList/src/LinkedListQueue
07-Implement-Queue-in-LinkedList/src/LoopQueue
07-Implement-Queue-in-LinkedList/src/Queue
07-Implement-Queue-in-LinkedList/src/Solution command
05-Recursion
01-Linked-List-Problems-in-Leetcode/src/ListNode
01-Linked-List-Problems-in-Leetcode/src/Solution
01-Linked-List-Problems-in-Leetcode/src/Solution2
01-Linked-List-Problems-in-Leetcode/src/Solution3
02-Test-Your-LinkedList-Solution/src command
02-Test-Your-LinkedList-Solution/src/ListNode
02-Test-Your-LinkedList-Solution/src/Solution
02-Test-Your-LinkedList-Solution/src/Solution2
02-Test-Your-LinkedList-Solution/src/Solution3
03-Recursion-Basics/src command
03-Recursion-Basics/src/ListNode
03-Recursion-Basics/src/Solution
03-Recursion-Basics/src/Solution2
03-Recursion-Basics/src/Solution3
03-Recursion-Basics/src/Sum command
04-LinkedList-and-Recursion/src command
04-LinkedList-and-Recursion/src/ListNode
04-LinkedList-and-Recursion/src/Solution
04-LinkedList-and-Recursion/src/Solution2
04-LinkedList-and-Recursion/src/Solution3
04-LinkedList-and-Recursion/src/Solution4
04-LinkedList-and-Recursion/src/Sum command
06-Debug-Recursive-Solution/src/ListNode
06-Debug-Recursive-Solution/src/Solution command
Optional-01-Recursive-LinkedList/src command
Optional-01-Recursive-LinkedList/src/LinkedList
Optional-01-Recursive-LinkedList/src/LinkedListR
Optional-01-Recursive-LinkedList/src/Solution command
06-Binary-Search-Tree
02-Binary-Search-Tree-Basics/src/BST
03-Add-Elements-in-BST/src/BST
04-Improved-Add-Elements-in-BST/src/BST
04-Improved-Add-Elements-in-BST/src/Solution command
05-Search-in-BST/src/BST
06-PreOrder-Traverse-in-BST/src command
06-PreOrder-Traverse-in-BST/src/BST
07-InOrder-and-PostOrder-Traverse-in-BST/src command
07-InOrder-and-PostOrder-Traverse-in-BST/src/BST
09-Non-Recursion-Preorder-Traverse-in-BST/src command
09-Non-Recursion-Preorder-Traverse-in-BST/src/Array
09-Non-Recursion-Preorder-Traverse-in-BST/src/ArrayStack
09-Non-Recursion-Preorder-Traverse-in-BST/src/BST
09-Non-Recursion-Preorder-Traverse-in-BST/src/Solution command
10-Level-Traverse-in-BST/src command
10-Level-Traverse-in-BST/src/Array
10-Level-Traverse-in-BST/src/BST
10-Level-Traverse-in-BST/src/LoopQueue
11-Remove-Min-and-Max-in-BST/src command
11-Remove-Min-and-Max-in-BST/src/BST
12-Remove-Elements-in-BST/src command
12-Remove-Elements-in-BST/src/BST
07-Set-and-Map
01-Set-Basics-and-BSTSet/src command
01-Set-Basics-and-BSTSet/src/BST
01-Set-Basics-and-BSTSet/src/BSTSet
01-Set-Basics-and-BSTSet/src/Set
02-LinkedListSet/src command
02-LinkedListSet/src/LinkedList
02-LinkedListSet/src/LinkedListSet
02-LinkedListSet/src/Set
03-Time-Complexity-of-Set/src command
03-Time-Complexity-of-Set/src/BST
03-Time-Complexity-of-Set/src/BSTSet
03-Time-Complexity-of-Set/src/LinkedList
03-Time-Complexity-of-Set/src/LinkedListSet
03-Time-Complexity-of-Set/src/Set
04-TreeSet-and-Set-Problems-in-Leetcode/src/BSTSetSolution command
04-TreeSet-and-Set-Problems-in-Leetcode/src/LinkedListSetSolution command
04-TreeSet-and-Set-Problems-in-Leetcode/src/Solution command
05-Map-Basics/src/Map
06-LinkedListMap/src command
06-LinkedListMap/src/LinkedListMap
06-LinkedListMap/src/Map
06-LinkedListMap/src/Solution command
07-BSTMap/src/BSTMap
07-BSTMap/src/Map
07-BSTMap/src/Solution command
08-More-about-Map/src command
08-More-about-Map/src/BSTMap
08-More-about-Map/src/LinkedListMap
08-More-about-Map/src/Map
09-Leetcode-Problems-about-Map-and-Set/src/BSTMapSolution350 command
09-Leetcode-Problems-about-Map-and-Set/src/BSTSetSolution349 command
09-Leetcode-Problems-about-Map-and-Set/src/LinkedListMapSolution350 command
09-Leetcode-Problems-about-Map-and-Set/src/LinkedListSetSolution349 command
09-Leetcode-Problems-about-Map-and-Set/src/Solution349 command
09-Leetcode-Problems-about-Map-and-Set/src/Solution350 command
08-Heap-and-Priority-Queue
02-Heap-Basics/src/Array
02-Heap-Basics/src/MaxHeap
03-Add-and-Sift-Up-in-Heap/src/Array
03-Add-and-Sift-Up-in-Heap/src/MaxHeap
04-Extract-and-Sift-Down-in-Heap/src command
04-Extract-and-Sift-Down-in-Heap/src/Array
04-Extract-and-Sift-Down-in-Heap/src/MaxHeap
04-Extract-and-Sift-Down-in-Heap/src/Solution command
05-Heapify-and-Replace-in-Heap/src command
05-Heapify-and-Replace-in-Heap/src/Array
05-Heapify-and-Replace-in-Heap/src/MaxHeap
05-Heapify-and-Replace-in-Heap/src/Solution command
06-Priority-Queue/src command
06-Priority-Queue/src/Array
06-Priority-Queue/src/MaxHeap
06-Priority-Queue/src/PriorityQueue
06-Priority-Queue/src/Queue
06-Priority-Queue/src/Solution command
07-Priority-Queue-Problems-in-Leetcode/src/Array
07-Priority-Queue-Problems-in-Leetcode/src/Solution command
09-Segment-Tree
02-Segment-Tree-Basics/src/SegmentTree
03-Building-Segment-Tree/src command
03-Building-Segment-Tree/src/Merger
03-Building-Segment-Tree/src/SegmentTree
04-Query-in-Segment-Tree/src command
04-Query-in-Segment-Tree/src/Merger
04-Query-in-Segment-Tree/src/SegmentTree
05-Segment-Tree-Problems-in-Leetcode/src command
05-Segment-Tree-Problems-in-Leetcode/src/Merger
05-Segment-Tree-Problems-in-Leetcode/src/NumArray command
05-Segment-Tree-Problems-in-Leetcode/src/NumArray2 command
05-Segment-Tree-Problems-in-Leetcode/src/NumArray3 command
05-Segment-Tree-Problems-in-Leetcode/src/NumArrayComplete command
05-Segment-Tree-Problems-in-Leetcode/src/SegmentTree
06-Update-Single-Element-in-Segment-Tree/src command
06-Update-Single-Element-in-Segment-Tree/src/Merger
06-Update-Single-Element-in-Segment-Tree/src/NumArray command
06-Update-Single-Element-in-Segment-Tree/src/NumArrayComplete command
06-Update-Single-Element-in-Segment-Tree/src/SegmentTree
10-Trie
02-Trie-Basics/src/Trie
03-Searching-in-Trie/src command
03-Searching-in-Trie/src/BST
03-Searching-in-Trie/src/BSTSet
03-Searching-in-Trie/src/Set
03-Searching-in-Trie/src/Trie
04-Prefix-in-Trie/src command
04-Prefix-in-Trie/src/BST
04-Prefix-in-Trie/src/BSTSet
04-Prefix-in-Trie/src/Set
04-Prefix-in-Trie/src/Trie
04-Prefix-in-Trie/src/Trie208
05-Trie-and-Pattern-Match/src/WordDictionary command
06-Trie-and-Map/src command
08-Trie-Using-HashMap-and-Array/src command
08-Trie-Using-HashMap-and-Array/src/BST
08-Trie-Using-HashMap-and-Array/src/BSTMap
08-Trie-Using-HashMap-and-Array/src/BSTSet
08-Trie-Using-HashMap-and-Array/src/Map
08-Trie-Using-HashMap-and-Array/src/Set
08-Trie-Using-HashMap-and-Array/src/Trie
08-Trie-Using-HashMap-and-Array/src/Trie2
08-Trie-Using-HashMap-and-Array/src/Trie3
11-Union-Find
01-What-is-UnionFind/src/UF
02-Quick-Find/src/LinkedList
02-Quick-Find/src/LinkedListSet
02-Quick-Find/src/Set
02-Quick-Find/src/Solution command
02-Quick-Find/src/UF
02-Quick-Find/src/UnionFind1
03-Quick-Union/src/Solution command
03-Quick-Union/src/UF
03-Quick-Union/src/UnionFind1
03-Quick-Union/src/UnionFind2
04-Optimized-by-Size/src command
04-Optimized-by-Size/src/UF
04-Optimized-by-Size/src/UnionFind1
04-Optimized-by-Size/src/UnionFind2
04-Optimized-by-Size/src/UnionFind3
05-Optimized-by-Rank/src command
05-Optimized-by-Rank/src/UF
05-Optimized-by-Rank/src/UnionFind1
05-Optimized-by-Rank/src/UnionFind2
05-Optimized-by-Rank/src/UnionFind3
05-Optimized-by-Rank/src/UnionFind4
06-Path-Compression/src command
06-Path-Compression/src/UF
06-Path-Compression/src/UnionFind1
06-Path-Compression/src/UnionFind2
06-Path-Compression/src/UnionFind3
06-Path-Compression/src/UnionFind4
06-Path-Compression/src/UnionFind5
07-More-about-Union-Find/src command
07-More-about-Union-Find/src/Solution command
07-More-about-Union-Find/src/UF
07-More-about-Union-Find/src/UnionFind1
07-More-about-Union-Find/src/UnionFind2
07-More-about-Union-Find/src/UnionFind3
07-More-about-Union-Find/src/UnionFind4
07-More-about-Union-Find/src/UnionFind5
07-More-about-Union-Find/src/UnionFind6
12-AVL-Tree
02-Calculating-Balance-Factor/src command
02-Calculating-Balance-Factor/src/AVLTree command
02-Calculating-Balance-Factor/src/BSTMap
03-Checking-Balancing-and-Binary-Search-Property/src/AVLTree command
03-Checking-Balancing-and-Binary-Search-Property/src/BSTMap
04-Rotation-Operations/src/AVLTree command
04-Rotation-Operations/src/BSTMap
05-The-Implementation-of-Left-Rotation-and-Right-Rotation/src/AVLTree command
05-The-Implementation-of-Left-Rotation-and-Right-Rotation/src/BSTMap
06-LR-and-RL/src command
06-LR-and-RL/src/AVLTree
06-LR-and-RL/src/BSTMap
06-LR-and-RL/src/Solution command
07-Remove-Elements-in-AVL-Tree/src command
07-Remove-Elements-in-AVL-Tree/src/AVLTree
07-Remove-Elements-in-AVL-Tree/src/BSTMap
07-Remove-Elements-in-AVL-Tree/src/Solution349 command
07-Remove-Elements-in-AVL-Tree/src/Solution350 command
08-Map-and-Set-in-AVL-Tree/src/AVLMap
08-Map-and-Set-in-AVL-Tree/src/AVLSet
08-Map-and-Set-in-AVL-Tree/src/AVLTree
08-Map-and-Set-in-AVL-Tree/src/BST
08-Map-and-Set-in-AVL-Tree/src/BSTMap
08-Map-and-Set-in-AVL-Tree/src/BSTSet
08-Map-and-Set-in-AVL-Tree/src/LinkedList
08-Map-and-Set-in-AVL-Tree/src/LinkedListMap
08-Map-and-Set-in-AVL-Tree/src/LinkedListSet
08-Map-and-Set-in-AVL-Tree/src/Map
08-Map-and-Set-in-AVL-Tree/src/Set
08-Map-and-Set-in-AVL-Tree/src/Solution349 command
08-Map-and-Set-in-AVL-Tree/src/Solution350 command
08-Map-and-Set-in-AVL-Tree/src/TestMapMain command
08-Map-and-Set-in-AVL-Tree/src/TestSetMain command
13-Red-Black-Tree
03-The-Equivalence-of-RBTree-and-2-3-Tree/src command
03-The-Equivalence-of-RBTree-and-2-3-Tree/src/AVLTree
03-The-Equivalence-of-RBTree-and-2-3-Tree/src/BSTMap
03-The-Equivalence-of-RBTree-and-2-3-Tree/src/Map
03-The-Equivalence-of-RBTree-and-2-3-Tree/src/RBTree
05-Keep-Root-Black-and-Left-Rotation/src command
05-Keep-Root-Black-and-Left-Rotation/src/AVLTree
05-Keep-Root-Black-and-Left-Rotation/src/BSTMap
05-Keep-Root-Black-and-Left-Rotation/src/Map
05-Keep-Root-Black-and-Left-Rotation/src/RBTree
06-Flip-Colors-and-Right-Rotation/src command
06-Flip-Colors-and-Right-Rotation/src/AVLTree
06-Flip-Colors-and-Right-Rotation/src/BSTMap
06-Flip-Colors-and-Right-Rotation/src/Map
06-Flip-Colors-and-Right-Rotation/src/RBTree
07-Adding-Elements-in-Red-Black-Tree/src command
07-Adding-Elements-in-Red-Black-Tree/src/AVLTree
07-Adding-Elements-in-Red-Black-Tree/src/BSTMap
07-Adding-Elements-in-Red-Black-Tree/src/Map
07-Adding-Elements-in-Red-Black-Tree/src/RBTree command
08-The-Performance-of-Red-Black-Tree/src command
08-The-Performance-of-Red-Black-Tree/src/AVLTree
08-The-Performance-of-Red-Black-Tree/src/BSTMap
08-The-Performance-of-Red-Black-Tree/src/Main2 command
08-The-Performance-of-Red-Black-Tree/src/Main3 command
08-The-Performance-of-Red-Black-Tree/src/Map
08-The-Performance-of-Red-Black-Tree/src/RBTree
14-Hash-Table
01-Hash-Table-Basics/src/Solution
03-Hash-Function-in-Java/src command
03-Hash-Function-in-Java/src/Student
05-Hash-Table-Implementation/src command
05-Hash-Table-Implementation/src/AVLTree
05-Hash-Table-Implementation/src/BSTMap
05-Hash-Table-Implementation/src/HashTable
05-Hash-Table-Implementation/src/RBTree
06-Resizing-in-Hash-Table/src command
06-Resizing-in-Hash-Table/src/AVLTree
06-Resizing-in-Hash-Table/src/BSTMap
06-Resizing-in-Hash-Table/src/HashTable
06-Resizing-in-Hash-Table/src/RBTree
07-More-About-Resizing-in-Hash-Table/src command
07-More-About-Resizing-in-Hash-Table/src/AVLTree
07-More-About-Resizing-in-Hash-Table/src/BSTMap
07-More-About-Resizing-in-Hash-Table/src/HashTable
07-More-About-Resizing-in-Hash-Table/src/RBTree

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL