2 votes 2 votes what is minimum number of elements that need to be hashed into a hash table of size m with chaining in order to make sure that at least one hash location has a chain of length n? Vasu_gate2017 asked Nov 5, 2017 Vasu_gate2017 357 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Rishabh Gupta 2 commented Nov 5, 2017 reply Follow Share m(n-1) + 1 ?? 1 votes 1 votes sachin! commented Nov 5, 2017 reply Follow Share m(n-1)+1 by pigeonhole priniple 1 votes 1 votes Vasu_gate2017 commented Nov 5, 2017 i edited by Vasu_gate2017 Nov 5, 2017 reply Follow Share @risabh....seems right... 1 votes 1 votes Please log in or register to add a comment.