Peel-works Interview Questions, Process, and Tips

Q1. The internal implementation of HashMap.
Ans. 
HashMap is a data structure that stores key-value pairs and uses hashing to retrieve values.
• HashMap uses an array of linked lists to store key-value pairs

• The hash code of the key is used to determine the index of the array

• If multiple keys have the same hash code, they are stored in the same linked list

• HashMap uses load factor to determine when to resize the array

• The default load factor is 0.75

• HashMap allows null keys a
Answered by AI
Add your answer
Q2. The internal implementation of HashSet. We only put value in HashSet then how HashSet internally uses HashMap.
Add your answer
Q3. What is the difference between HashMap and HashSet?
Ans. 
HashMap is a key-value pair collection while HashSet is a set of unique elements.
• HashMap allows duplicate values but not duplicate keys

• HashSet does not allow duplicate values

• HashMap implements Map interface while HashSet implements Set interface

• HashMap uses put() method to add elements while HashSet uses add() method

• Example: HashMap map = new HashMap<>(); HashSet set = new HashSet<>();
Answered by AI
Add your answer
Q4. What is the difference between Local Variable, static variable, and instance variable?
Ans. 
Local, static, and instance variables differ in their scope and lifetime.
• Local variables are declared inside a method and have a limited scope.

• Static variables belong to the class and are shared among all instances.

• Instance variables are unique to each object and can be accessed using the object reference.
Answered by AI
Add your answer

Write a java program to convert numbers to strings.
for example:
10: TEN,
1559: One Thousand Five Hundred Fifty Nine.

Q1. Only Salary discussion
Add your answer