Day3- implement-queue-using-stacks, Design-hashmap

[tanvipandhre]

Day3- implement-queue-using-stacks, Design-hashmap

[super30admin]

Strengths:

• The student has clearly understood the problem requirements and implemented both solutions correctly.
• The use of helper methods (like find in MyHashMap) improves code readability and reusability.
• The comments and README explanations are clear and concise.

Areas for Improvement:

• In the MyQueue implementation, the peek() method could be optimized to avoid unnecessary transfers when the out stack is not empty.
• The README could be more detailed about the time and space complexity of the solutions.
• The MyHashMap implementation could benefit from a brief explanation of the hash function choice (why 10000).