Highest voted questions in Programming and DS

70 votes
13 answers
35
67 votes
14 answers
37
The number of possible min-heaps containing each value from $\{1,2,3,4,5,6,7\}$ exactly once is _______
65 votes
9 answers
42
64 votes
7 answers
44
62 votes
4 answers
47
62 votes
11 answers
48
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collide...