Done

[kanikanegii]

No description provided.

[super30admin]

• The student's implementation of the queue using two stacks is excellent and matches the reference solution in both functionality and efficiency.
• The HashMap.py file, while not part of the reference solution, is a good implementation of a hash map with linear chaining. The use of a dummy head node and the getPrev helper method simplifies the logic and makes the code more maintainable.
• One minor improvement could be to add a check for empty stacks in the pop method of QueueUsingStacks.py to handle edge cases, similar to the reference solution. However, the current implementation is still correct as it relies on the peek method to ensure the output stack is populated.
• The comments in the code are helpful, but adding a brief docstring for each method in QueueUsingStacks.py could further improve readability.