Implement problem 1, 2 and 3

[sarvesh-gaurishankar-sawant]

No description provided.

[super30admin]

• Strengths:
  • The implementation correctly follows the binary search approach for rotated sorted arrays.
  • The code is clean, with good variable naming and logical structure.
  • The time and space complexity are correctly identified and optimal.
• Areas for Improvement:
  • The comments at the top could be expanded to explain the problem and the approach in more detail, especially since the problem description was not provided.
  • The condition nums[low] <= nums[mid] could be clarified with a comment to indicate that it checks if the left half is sorted.
  • The student could consider adding edge case handling comments (e.g., empty array) even though the code handles them implicitly.