Youtube (This is very basic implementation). Check Ketama for real implementation. Article 1 - Gives a very clean and concise way why to use consistence hashing and not the naive approach. We need consistence hashing to try to minimize the re-hashing/invalidation when a new server/machine is added or a machine goes down. Read this Article for more clarity.… Continue reading Consistence Hashing

# Category: Hashing

## Hashing Question List

InterviewBit Imp Problem Set GeeksForGeek Problem Set and https://leetcode.com/tag/hash-table/ *** Java HashMap, HashSet. when to use what and how to use them. HashSet contains only values whereas HashMap contains entry(key and value). Most of hashing questions are formed in association with String and Array. HashMap Basic Operations Iterator Map<Integer, Integer> dataSet = new HashMap<Integer, Integer>(); dataSet.get(),… Continue reading Hashing Question List

## Hashing – Theory

Resource: *MIT Video Lecture - Hashing with Chaining MIT Video - Table Doubling, Karp-Rabin Open addressing, cryptographic hashing Hashmap best and average case for Search, Insert and Delete is O(1) and worst case is O(n). Link HashMap get/put complexity - It's usually O(1), with a decent hash which itself is constant time. In the worst case, a HashMap has an O(n) lookup… Continue reading Hashing – Theory