Repository hosting varied sets of algorithms and data structures intended towards increasing overall understanding of our favourite topic in computer science.
| Name | Remarks |
|---|---|
| Trie Datastructure | An ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings |
| Multiple stacks within array | Stuffing multiple stacks inside single array and handling shrinking and expanding based over space crunch |
| Merge sorted arrays with folding | Merges input sorted arrays to produce sorted array the source array with buffer is modified with result |
| Searching in rotated sorted array | Applying binary search in an sorted array but taking care of rotation by eliminating wasteful paths |
| Graph node path search | Searches if two nodes are connected and accessible by doing an Breadth First Search from one node terminating at other one or else flagging unsuccessful search |
| LRU Cache | Least Recently Used Cache implementation using doubly linked list and hash table combination |
| Minimal Tree | Generates binary search tree of minimal height from sorted array in increasing order |