What would you do if your professor ask you to come up with a solution for a symbol table that is targeted only for string-based keys which are Faster than Hashing and more Flexible than BSTs? Trie Data Structure is the solution that you will be looking for. Trie is a fast search and miss data structure when it comes to storing key-value pairs where key is a string. This … [Read more...] about Trie Data Structure Implementation | (PUT, GET, DELETE)
datastructure
Getting Started With Algorithms For Budding Computer Science Engineers
This article is going to be different from a ton of articles out there on the internet. It will be different because I'm going to explain it in a way that would directly get inside of you (doesn't matter what your IQ is). I will not be going to copy-paste the definitions from books to bore you rather I would try to make you understand from the best of my knowledge. In … [Read more...] about Getting Started With Algorithms For Budding Computer Science Engineers
LinkedList Implementation in Java (TDD WAY)
Hey buds, In this article, I'm going to implement a linkedlist in java and compare our linked list on various performance benchmarks in comparison with the original collections linkedlist. Our custom linked list will not contain as many features as offered by the collections framework but it will surely contains all the basic features which are required to be a part of any … [Read more...] about LinkedList Implementation in Java (TDD WAY)