Completed both problems

[restacksyj]

No description provided.

[super30admin]

• Strengths:

  • Both solutions are correct and handle edge cases well.
  • Code is clean, readable, and well-commented.
  • The logic is straightforward and easy to follow.

• Areas for Improvement:

  • For Exercise2.cpp, the time complexity should be corrected to O(n log n) due to the sorting step.
  • Avoid using #include <bits/stdc++.h> in favor of including only necessary headers.
  • Consider adding more edge case checks, such as handling empty input or negative values of k in Exercise2.cpp.