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

11, 13 (Same - 14, 15), 17(18 - with duplicate), 19, 22, 24, 29(colourful), 30(2 sum), 31 (4 sum), 34, 35, 38 InterviewBit Imp Problem Set GeeksForGeek Problem Set and https://leetcode.com/tag/hash-table/ 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 … Continue reading Hashing Question List

## Hashing – Theory

*** Implement HashTable in Java 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… Continue reading Hashing – Theory