Search Interview Questions
| More than 3000 questions in repository.|
There are more than 900 unanswered questions.
Click here and help us by providing the answer.
Have a video suggestion.
Click Correct / Improve and please let us know.
|Interview Questions and Answers|
|Ans. The impact of both cases (fixed hashcode or random hashcode for keys) will have same result and that is "unexpected behavior". The very basic need of hashcode in HashMap is to identify the bucket location where to put the key-value pair, and from where it has to be retrieved.|
If the hashcode of key object changes every time, the exact location of key-value pair will be calculated different, every time. This way, one object stored in HashMap will be lost forever and there will be very minimum possibility to get it back from map.
For this same reason, key are suggested to be immutable, so that they return a unique and same hashcode each time requested on same key object.
|Help us improve. Please let us know the company, where you were asked this question :|
|Like Discuss Correct / Improve   Asked in 1 Companies|
|Difference between == and .equals() ?|
|Why is String immutable in Java ?|
| Explain the scenerios to choose between String , StringBuilder and StringBuffer ?|
What is the difference between String , StringBuilder and StringBuffer ?
|What are the difference between composition and inheritance in Java?|
|What is a Lambda Expression ? What's its use ?|
|Why Char array is preferred over String for storing password?|
|Does garbage collection guarantee that a program will not run out of memory?|
| Explain OOPs |
Explain OOPs Principles
Explain OOPs Concepts
Explain OOPs features
Tell me something about OOPs
|What is the difference between final, finally and finalize() ?|
|What are different ways to create String Object? Explain.|