Complete Design-2 in python

[subbaparitala9]

No description provided.

[super30admin]

1. Correctness: The solution correctly implements a queue using two stacks, but the peek operation has an unnecessary print statement that should be removed.
2. Time Complexity: The student claims O(1) time complexity, but it should be amortized O(1) with worst-case O(n) when the out_stack is empty. This should be clarified.
3. Space Complexity: Correctly identified as O(n).
4. Code Quality: The code is well-structured and readable. The print statement in the peek method should be removed as it's not needed for functionality.
5. Efficiency: The peek operation can be optimized by calling the pop operation's logic to refill the out_stack if needed, similar to the reference solution. This avoids code duplication.

Suggestions for improvement:

• Remove the print statement in the peek method.
• Consider combining the logic for refilling the out_stack in a helper method to avoid duplication between pop and peek.
• Update the time complexity explanation to reflect the amortized analysis.