Completed Binary Search 2 exercises

[shreyargh]

No description provided.

[super30admin]

• Strengths:
  • The logic for finding the first and last positions using binary search is correctly implemented.
  • The code is well-commented and easy to understand.
  • The time and space complexity are optimal.
• Areas for Improvement:
  • Fix the compilation error in binarySearchLast by replacing size with nums.length - 1 or passing it as a parameter.
  • Ensure all variables are properly defined and accessible within their scope.
  • Consider adding edge case checks, such as an empty array, to make the solution more robust.