Done Competitive Coding-1

[vvirani1908]

No description provided.

[super30admin]

• Strengths:
  • The binary search implementation in Problem1.py is clean and handles edge cases effectively.
  • The MinHeap class in Problem2.py is well-organized, with clear methods for heap operations.
  • Comments are helpful and explain the logic well.
• Areas for Improvement:
  • In Problem1.py, the variable names lo and hi could be more descriptive (e.g., left and right).
  • In Problem2.py, adding a check for an empty heap in getMin before accessing the first element would prevent potential errors.
  • Consider adding docstrings for methods in Problem2.py to further improve readability and maintainability.