PayPal

  www.paypal.com
  www.paypal.com

Interview Question

Software Engineer Interview San Jose, CA

HashMap implementation

Tags:
java, data structures
Answer

Interview Answer

1 Answer

0

In C++, you can use a dynamic array with varying number of hash entries per row. The hash can be found by taking the modulo of the key. If a collision occurs, you can use linear probing by taking the modulo of (key + 1).

dave on Mar 19, 2012

Add Answers or Comments

To comment on this, Sign In or Sign Up.